./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cfad0b2f92a7cfe2a62ca103d0ef6e2a604561400f9f39e859a6074e6dd658e5
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 12:47:53,373 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 12:47:53,375 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 12:47:53,395 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 12:47:53,396 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 12:47:53,397 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 12:47:53,397 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 12:47:53,399 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 12:47:53,400 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 12:47:53,401 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 12:47:53,402 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 12:47:53,403 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 12:47:53,403 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 12:47:53,404 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 12:47:53,405 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 12:47:53,405 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 12:47:53,406 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 12:47:53,407 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 12:47:53,408 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 12:47:53,409 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 12:47:53,410 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 12:47:53,412 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 12:47:53,413 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 12:47:53,413 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 12:47:53,416 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 12:47:53,416 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 12:47:53,416 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 12:47:53,417 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 12:47:53,417 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 12:47:53,418 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 12:47:53,418 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 12:47:53,418 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 12:47:53,419 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 12:47:53,419 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 12:47:53,420 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 12:47:53,420 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 12:47:53,421 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 12:47:53,421 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 12:47:53,421 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 12:47:53,422 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 12:47:53,422 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 12:47:53,423 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 12:47:53,444 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 12:47:53,444 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 12:47:53,444 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 12:47:53,444 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 12:47:53,445 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 12:47:53,445 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 12:47:53,446 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 12:47:53,446 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 12:47:53,446 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 12:47:53,446 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 12:47:53,446 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 12:47:53,446 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 12:47:53,446 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 12:47:53,446 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 12:47:53,447 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 12:47:53,447 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 12:47:53,447 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 12:47:53,447 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 12:47:53,447 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 12:47:53,447 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 12:47:53,447 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 12:47:53,447 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 12:47:53,447 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 12:47:53,448 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 12:47:53,448 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 12:47:53,448 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 12:47:53,448 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 12:47:53,448 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 12:47:53,448 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 12:47:53,448 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 12:47:53,448 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 12:47:53,448 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 12:47:53,449 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 12:47:53,449 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 12:47:53,449 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 12:47:53,449 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 12:47:53,449 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 12:47:53,449 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cfad0b2f92a7cfe2a62ca103d0ef6e2a604561400f9f39e859a6074e6dd658e5
[2023-11-03 12:47:53,659 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 12:47:53,684 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 12:47:53,687 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 12:47:53,688 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 12:47:53,688 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 12:47:53,689 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2023-11-03 12:47:54,736 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 12:47:54,926 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 12:47:54,926 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2023-11-03 12:47:54,938 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/810655d45/57fa0d0b390e441db239a1e8e012fa23/FLAG4fb39ee9c
[2023-11-03 12:47:55,289 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/810655d45/57fa0d0b390e441db239a1e8e012fa23
[2023-11-03 12:47:55,291 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 12:47:55,292 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 12:47:55,293 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 12:47:55,293 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 12:47:55,296 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 12:47:55,297 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,298 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2929d4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55, skipping insertion in model container
[2023-11-03 12:47:55,298 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,303 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 12:47:55,340 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 12:47:55,456 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 12:47:55,590 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 12:47:55,602 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 12:47:55,615 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 12:47:55,644 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 12:47:55,683 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 12:47:55,684 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55 WrapperNode
[2023-11-03 12:47:55,684 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 12:47:55,685 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 12:47:55,686 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 12:47:55,686 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 12:47:55,692 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,705 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,724 INFO  L138                Inliner]: procedures = 264, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74
[2023-11-03 12:47:55,725 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 12:47:55,725 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 12:47:55,725 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 12:47:55,726 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 12:47:55,733 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,733 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,737 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,737 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,745 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,747 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,749 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,750 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,752 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 12:47:55,753 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 12:47:55,753 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 12:47:55,753 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 12:47:55,754 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (1/1) ...
[2023-11-03 12:47:55,759 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 12:47:55,766 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:47:55,779 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-03 12:47:55,783 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-03 12:47:55,809 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 12:47:55,809 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 12:47:55,809 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 12:47:55,809 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 12:47:55,809 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 12:47:55,809 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2023-11-03 12:47:55,810 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 12:47:55,810 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 12:47:55,810 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 12:47:55,810 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 12:47:55,811 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 12:47:55,943 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 12:47:55,945 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 12:47:56,145 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 12:47:56,152 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 12:47:56,152 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 12:47:56,154 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:47:56 BoogieIcfgContainer
[2023-11-03 12:47:56,154 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 12:47:56,156 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 12:47:56,156 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 12:47:56,158 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 12:47:56,158 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 12:47:55" (1/3) ...
[2023-11-03 12:47:56,159 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f711c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:47:56, skipping insertion in model container
[2023-11-03 12:47:56,159 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:47:55" (2/3) ...
[2023-11-03 12:47:56,159 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f711c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:47:56, skipping insertion in model container
[2023-11-03 12:47:56,159 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:47:56" (3/3) ...
[2023-11-03 12:47:56,160 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i
[2023-11-03 12:47:56,167 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 12:47:56,174 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 12:47:56,174 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2023-11-03 12:47:56,175 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 12:47:56,216 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 12:47:56,243 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2023-11-03 12:47:56,288 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2023-11-03 12:47:56,288 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:47:56,293 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2023-11-03 12:47:56,293 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 210 flow
[2023-11-03 12:47:56,297 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 210 flow
[2023-11-03 12:47:56,300 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 12:47:56,308 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 101 transitions, 210 flow
[2023-11-03 12:47:56,311 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 101 transitions, 210 flow
[2023-11-03 12:47:56,311 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2023-11-03 12:47:56,337 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2023-11-03 12:47:56,337 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:47:56,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2023-11-03 12:47:56,339 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1410
[2023-11-03 12:47:58,347 INFO  L134        LiptonReduction]: Checked pairs total: 5574
[2023-11-03 12:47:58,348 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2023-11-03 12:47:58,360 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 12:47:58,365 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45ffbe33, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 12:47:58,365 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-11-03 12:47:58,368 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2023-11-03 12:47:58,368 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 12:47:58,368 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:47:58,369 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:47:58,369 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-11-03 12:47:58,373 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:47:58,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -1050340217, now seen corresponding path program 1 times
[2023-11-03 12:47:58,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:47:58,404 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491885878]
[2023-11-03 12:47:58,404 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:47:58,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:47:58,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:47:58,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:47:58,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:47:58,844 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491885878]
[2023-11-03 12:47:58,845 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491885878] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:47:58,845 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:47:58,845 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:47:58,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006187282]
[2023-11-03 12:47:58,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:47:58,852 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:47:58,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:47:58,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:47:58,870 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:47:59,075 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 68 out of 176
[2023-11-03 12:47:59,078 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 84 flow. Second operand  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:59,078 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:47:59,078 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 176
[2023-11-03 12:47:59,079 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:47:59,280 INFO  L130       PetriNetUnfolder]: 135/363 cut-off events.
[2023-11-03 12:47:59,280 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:47:59,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 691 conditions, 363 events. 135/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1596 event pairs, 91 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 632. Up to 281 conditions per place. 
[2023-11-03 12:47:59,284 INFO  L137   encePairwiseOnDemand]: 165/176 looper letters, 37 selfloop transitions, 21 changer transitions 0/65 dead transitions.
[2023-11-03 12:47:59,284 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 254 flow
[2023-11-03 12:47:59,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:47:59,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:47:59,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions.
[2023-11-03 12:47:59,301 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4431818181818182
[2023-11-03 12:47:59,301 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 468 transitions.
[2023-11-03 12:47:59,302 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 468 transitions.
[2023-11-03 12:47:59,303 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:47:59,305 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 468 transitions.
[2023-11-03 12:47:59,310 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:59,314 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:59,315 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:59,316 INFO  L175             Difference]: Start difference. First operand has 40 places, 38 transitions, 84 flow. Second operand 6 states and 468 transitions.
[2023-11-03 12:47:59,317 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 254 flow
[2023-11-03 12:47:59,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:47:59,320 INFO  L231             Difference]: Finished difference. Result has 48 places, 57 transitions, 206 flow
[2023-11-03 12:47:59,322 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=48, PETRI_TRANSITIONS=57}
[2023-11-03 12:47:59,325 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places.
[2023-11-03 12:47:59,325 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 57 transitions, 206 flow
[2023-11-03 12:47:59,325 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:59,325 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:47:59,325 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:47:59,326 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 12:47:59,326 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-11-03 12:47:59,326 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:47:59,326 INFO  L85        PathProgramCache]: Analyzing trace with hash 647833824, now seen corresponding path program 1 times
[2023-11-03 12:47:59,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:47:59,327 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75474922]
[2023-11-03 12:47:59,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:47:59,327 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:47:59,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:47:59,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:47:59,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:47:59,379 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75474922]
[2023-11-03 12:47:59,379 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75474922] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:47:59,380 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:47:59,380 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 12:47:59,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19190044]
[2023-11-03 12:47:59,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:47:59,381 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-03 12:47:59,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:47:59,381 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-03 12:47:59,382 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-03 12:47:59,449 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 176
[2023-11-03 12:47:59,450 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 57 transitions, 206 flow. Second operand  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:59,450 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:47:59,450 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 176
[2023-11-03 12:47:59,451 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:47:59,561 INFO  L130       PetriNetUnfolder]: 55/234 cut-off events.
[2023-11-03 12:47:59,561 INFO  L131       PetriNetUnfolder]: For 28/36 co-relation queries the response was YES.
[2023-11-03 12:47:59,563 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 489 conditions, 234 events. 55/234 cut-off events. For 28/36 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 984 event pairs, 3 based on Foata normal form. 2/210 useless extension candidates. Maximal degree in co-relation 421. Up to 79 conditions per place. 
[2023-11-03 12:47:59,565 INFO  L137   encePairwiseOnDemand]: 172/176 looper letters, 25 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2023-11-03 12:47:59,565 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 290 flow
[2023-11-03 12:47:59,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 12:47:59,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 12:47:59,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions.
[2023-11-03 12:47:59,571 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.546875
[2023-11-03 12:47:59,571 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 385 transitions.
[2023-11-03 12:47:59,571 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 385 transitions.
[2023-11-03 12:47:59,572 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:47:59,572 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 385 transitions.
[2023-11-03 12:47:59,574 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:59,577 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:59,578 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:59,579 INFO  L175             Difference]: Start difference. First operand has 48 places, 57 transitions, 206 flow. Second operand 4 states and 385 transitions.
[2023-11-03 12:47:59,579 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 290 flow
[2023-11-03 12:47:59,582 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:47:59,584 INFO  L231             Difference]: Finished difference. Result has 53 places, 57 transitions, 216 flow
[2023-11-03 12:47:59,585 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=57}
[2023-11-03 12:47:59,585 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places.
[2023-11-03 12:47:59,586 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 216 flow
[2023-11-03 12:47:59,586 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:47:59,586 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:47:59,587 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:47:59,587 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 12:47:59,587 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-11-03 12:47:59,588 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:47:59,588 INFO  L85        PathProgramCache]: Analyzing trace with hash -516340613, now seen corresponding path program 1 times
[2023-11-03 12:47:59,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:47:59,589 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598823289]
[2023-11-03 12:47:59,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:47:59,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:47:59,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:47:59,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:47:59,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:47:59,849 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598823289]
[2023-11-03 12:47:59,849 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598823289] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:47:59,849 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:47:59,849 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:47:59,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826727417]
[2023-11-03 12:47:59,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:47:59,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:47:59,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:47:59,850 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:47:59,851 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:48:00,028 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 176
[2023-11-03 12:48:00,030 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 216 flow. Second operand  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:00,030 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:00,030 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 176
[2023-11-03 12:48:00,030 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:00,488 INFO  L130       PetriNetUnfolder]: 193/497 cut-off events.
[2023-11-03 12:48:00,489 INFO  L131       PetriNetUnfolder]: For 111/115 co-relation queries the response was YES.
[2023-11-03 12:48:00,491 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 497 events. 193/497 cut-off events. For 111/115 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2299 event pairs, 39 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 1182. Up to 339 conditions per place. 
[2023-11-03 12:48:00,494 INFO  L137   encePairwiseOnDemand]: 158/176 looper letters, 68 selfloop transitions, 57 changer transitions 5/137 dead transitions.
[2023-11-03 12:48:00,494 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 137 transitions, 714 flow
[2023-11-03 12:48:00,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:48:00,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:48:00,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions.
[2023-11-03 12:48:00,497 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5085227272727273
[2023-11-03 12:48:00,497 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 537 transitions.
[2023-11-03 12:48:00,498 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions.
[2023-11-03 12:48:00,498 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:00,498 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions.
[2023-11-03 12:48:00,500 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:00,502 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:00,502 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:00,502 INFO  L175             Difference]: Start difference. First operand has 53 places, 57 transitions, 216 flow. Second operand 6 states and 537 transitions.
[2023-11-03 12:48:00,502 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 137 transitions, 714 flow
[2023-11-03 12:48:00,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 137 transitions, 692 flow, removed 5 selfloop flow, removed 3 redundant places.
[2023-11-03 12:48:00,507 INFO  L231             Difference]: Finished difference. Result has 58 places, 108 transitions, 562 flow
[2023-11-03 12:48:00,507 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=58, PETRI_TRANSITIONS=108}
[2023-11-03 12:48:00,507 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places.
[2023-11-03 12:48:00,508 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 108 transitions, 562 flow
[2023-11-03 12:48:00,508 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:00,508 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:00,508 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:00,508 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 12:48:00,508 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-11-03 12:48:00,509 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:00,509 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831922026, now seen corresponding path program 1 times
[2023-11-03 12:48:00,509 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:00,509 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612436827]
[2023-11-03 12:48:00,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:00,509 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:00,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:00,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 12:48:00,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:00,734 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612436827]
[2023-11-03 12:48:00,734 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612436827] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:48:00,734 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:48:00,735 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:48:00,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003350174]
[2023-11-03 12:48:00,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:48:00,735 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:48:00,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:00,735 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:48:00,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:48:00,955 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 176
[2023-11-03 12:48:00,956 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 108 transitions, 562 flow. Second operand  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:00,956 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:00,956 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 176
[2023-11-03 12:48:00,957 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:01,154 INFO  L130       PetriNetUnfolder]: 200/560 cut-off events.
[2023-11-03 12:48:01,154 INFO  L131       PetriNetUnfolder]: For 335/347 co-relation queries the response was YES.
[2023-11-03 12:48:01,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 560 events. 200/560 cut-off events. For 335/347 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2835 event pairs, 43 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 1725. Up to 369 conditions per place. 
[2023-11-03 12:48:01,159 INFO  L137   encePairwiseOnDemand]: 165/176 looper letters, 87 selfloop transitions, 29 changer transitions 0/142 dead transitions.
[2023-11-03 12:48:01,159 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 142 transitions, 968 flow
[2023-11-03 12:48:01,160 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:48:01,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:48:01,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions.
[2023-11-03 12:48:01,162 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4630681818181818
[2023-11-03 12:48:01,162 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 489 transitions.
[2023-11-03 12:48:01,163 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 489 transitions.
[2023-11-03 12:48:01,163 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:01,163 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 489 transitions.
[2023-11-03 12:48:01,164 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:01,166 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:01,167 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:01,167 INFO  L175             Difference]: Start difference. First operand has 58 places, 108 transitions, 562 flow. Second operand 6 states and 489 transitions.
[2023-11-03 12:48:01,167 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 142 transitions, 968 flow
[2023-11-03 12:48:01,173 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 932 flow, removed 18 selfloop flow, removed 0 redundant places.
[2023-11-03 12:48:01,175 INFO  L231             Difference]: Finished difference. Result has 67 places, 132 transitions, 808 flow
[2023-11-03 12:48:01,175 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=67, PETRI_TRANSITIONS=132}
[2023-11-03 12:48:01,175 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places.
[2023-11-03 12:48:01,176 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 132 transitions, 808 flow
[2023-11-03 12:48:01,176 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:01,176 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:01,176 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-11-03 12:48:01,176 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 12:48:01,176 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-11-03 12:48:01,177 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:01,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -2007496268, now seen corresponding path program 1 times
[2023-11-03 12:48:01,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:01,177 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135538859]
[2023-11-03 12:48:01,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:01,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:01,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 12:48:01,196 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 12:48:01,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 12:48:01,225 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 12:48:01,225 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 12:48:01,226 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-11-03 12:48:01,227 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-11-03 12:48:01,227 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-11-03 12:48:01,227 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-11-03 12:48:01,227 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-11-03 12:48:01,228 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-11-03 12:48:01,228 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-11-03 12:48:01,228 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 12:48:01,228 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-11-03 12:48:01,230 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 12:48:01,230 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 12:48:01,246 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-03 12:48:01,248 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2023-11-03 12:48:01,266 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2023-11-03 12:48:01,266 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 12:48:01,266 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2023-11-03 12:48:01,266 INFO  L82        GeneralOperation]: Start removeDead. Operand has 118 places, 118 transitions, 254 flow
[2023-11-03 12:48:01,267 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 118 places, 118 transitions, 254 flow
[2023-11-03 12:48:01,267 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 12:48:01,267 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 118 transitions, 254 flow
[2023-11-03 12:48:01,268 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 118 transitions, 254 flow
[2023-11-03 12:48:01,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2023-11-03 12:48:01,283 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2023-11-03 12:48:01,283 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 12:48:01,283 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2023-11-03 12:48:01,285 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4200
[2023-11-03 12:48:03,062 INFO  L134        LiptonReduction]: Checked pairs total: 17458
[2023-11-03 12:48:03,062 INFO  L136        LiptonReduction]: Total number of compositions: 74
[2023-11-03 12:48:03,064 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 12:48:03,065 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45ffbe33, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 12:48:03,065 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-11-03 12:48:03,067 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2023-11-03 12:48:03,067 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 12:48:03,067 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:03,067 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:03,067 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:03,067 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:03,067 INFO  L85        PathProgramCache]: Analyzing trace with hash 1843145426, now seen corresponding path program 1 times
[2023-11-03 12:48:03,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:03,068 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641633125]
[2023-11-03 12:48:03,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:03,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:03,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:03,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:03,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:03,221 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641633125]
[2023-11-03 12:48:03,221 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641633125] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:48:03,221 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:48:03,221 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:48:03,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223027550]
[2023-11-03 12:48:03,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:48:03,222 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:48:03,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:03,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:48:03,223 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:48:03,407 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 192
[2023-11-03 12:48:03,408 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 126 flow. Second operand  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:03,408 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:03,408 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 192
[2023-11-03 12:48:03,409 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:04,002 INFO  L130       PetriNetUnfolder]: 2299/4146 cut-off events.
[2023-11-03 12:48:04,002 INFO  L131       PetriNetUnfolder]: For 58/58 co-relation queries the response was YES.
[2023-11-03 12:48:04,006 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8058 conditions, 4146 events. 2299/4146 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 23085 event pairs, 1715 based on Foata normal form. 0/3930 useless extension candidates. Maximal degree in co-relation 1116. Up to 3508 conditions per place. 
[2023-11-03 12:48:04,018 INFO  L137   encePairwiseOnDemand]: 178/192 looper letters, 58 selfloop transitions, 37 changer transitions 0/106 dead transitions.
[2023-11-03 12:48:04,018 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 420 flow
[2023-11-03 12:48:04,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:48:04,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:48:04,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions.
[2023-11-03 12:48:04,020 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4947916666666667
[2023-11-03 12:48:04,020 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 570 transitions.
[2023-11-03 12:48:04,020 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions.
[2023-11-03 12:48:04,021 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:04,021 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions.
[2023-11-03 12:48:04,022 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:04,023 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:04,024 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:04,024 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 570 transitions.
[2023-11-03 12:48:04,024 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 420 flow
[2023-11-03 12:48:04,025 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:48:04,026 INFO  L231             Difference]: Finished difference. Result has 66 places, 90 transitions, 338 flow
[2023-11-03 12:48:04,026 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=66, PETRI_TRANSITIONS=90}
[2023-11-03 12:48:04,027 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2023-11-03 12:48:04,027 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 338 flow
[2023-11-03 12:48:04,027 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:04,027 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:04,027 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:04,027 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 12:48:04,027 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:04,028 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:04,028 INFO  L85        PathProgramCache]: Analyzing trace with hash 37653776, now seen corresponding path program 1 times
[2023-11-03 12:48:04,028 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:04,028 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173601133]
[2023-11-03 12:48:04,028 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:04,028 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:04,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:04,065 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:04,065 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:04,065 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173601133]
[2023-11-03 12:48:04,065 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173601133] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:48:04,065 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:48:04,066 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 12:48:04,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57275918]
[2023-11-03 12:48:04,066 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:48:04,066 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-03 12:48:04,066 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:04,067 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-03 12:48:04,067 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-03 12:48:04,150 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 192
[2023-11-03 12:48:04,151 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 338 flow. Second operand  has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:04,151 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:04,151 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 192
[2023-11-03 12:48:04,151 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:04,414 INFO  L130       PetriNetUnfolder]: 831/2045 cut-off events.
[2023-11-03 12:48:04,414 INFO  L131       PetriNetUnfolder]: For 351/391 co-relation queries the response was YES.
[2023-11-03 12:48:04,418 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4465 conditions, 2045 events. 831/2045 cut-off events. For 351/391 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13313 event pairs, 354 based on Foata normal form. 1/1904 useless extension candidates. Maximal degree in co-relation 2180. Up to 890 conditions per place. 
[2023-11-03 12:48:04,425 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 31 selfloop transitions, 2 changer transitions 2/100 dead transitions.
[2023-11-03 12:48:04,425 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 436 flow
[2023-11-03 12:48:04,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 12:48:04,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 12:48:04,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions.
[2023-11-03 12:48:04,426 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.58203125
[2023-11-03 12:48:04,426 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 447 transitions.
[2023-11-03 12:48:04,426 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions.
[2023-11-03 12:48:04,427 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:04,427 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions.
[2023-11-03 12:48:04,428 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:04,429 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:04,429 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:04,429 INFO  L175             Difference]: Start difference. First operand has 66 places, 90 transitions, 338 flow. Second operand 4 states and 447 transitions.
[2023-11-03 12:48:04,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 436 flow
[2023-11-03 12:48:04,431 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 436 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:48:04,433 INFO  L231             Difference]: Finished difference. Result has 71 places, 91 transitions, 352 flow
[2023-11-03 12:48:04,433 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=71, PETRI_TRANSITIONS=91}
[2023-11-03 12:48:04,433 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places.
[2023-11-03 12:48:04,433 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 352 flow
[2023-11-03 12:48:04,434 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:04,434 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:04,434 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:04,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-03 12:48:04,434 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:04,434 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:04,434 INFO  L85        PathProgramCache]: Analyzing trace with hash -1297270937, now seen corresponding path program 1 times
[2023-11-03 12:48:04,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:04,435 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029460714]
[2023-11-03 12:48:04,435 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:04,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:04,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:04,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:04,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:04,601 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029460714]
[2023-11-03 12:48:04,601 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029460714] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:48:04,601 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:48:04,602 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:48:04,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315787345]
[2023-11-03 12:48:04,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:48:04,602 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:48:04,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:04,602 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:48:04,602 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:48:04,756 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 192
[2023-11-03 12:48:04,757 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 352 flow. Second operand  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:04,757 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:04,757 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 192
[2023-11-03 12:48:04,757 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:05,668 INFO  L130       PetriNetUnfolder]: 3649/6392 cut-off events.
[2023-11-03 12:48:05,669 INFO  L131       PetriNetUnfolder]: For 1465/1507 co-relation queries the response was YES.
[2023-11-03 12:48:05,676 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16449 conditions, 6392 events. 3649/6392 cut-off events. For 1465/1507 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 38348 event pairs, 1337 based on Foata normal form. 0/6111 useless extension candidates. Maximal degree in co-relation 16362. Up to 4916 conditions per place. 
[2023-11-03 12:48:05,697 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 131 selfloop transitions, 89 changer transitions 0/231 dead transitions.
[2023-11-03 12:48:05,697 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 231 transitions, 1222 flow
[2023-11-03 12:48:05,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:48:05,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:48:05,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions.
[2023-11-03 12:48:05,699 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2023-11-03 12:48:05,699 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 672 transitions.
[2023-11-03 12:48:05,699 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions.
[2023-11-03 12:48:05,700 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:05,700 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions.
[2023-11-03 12:48:05,701 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:05,702 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:05,702 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:05,702 INFO  L175             Difference]: Start difference. First operand has 71 places, 91 transitions, 352 flow. Second operand 6 states and 672 transitions.
[2023-11-03 12:48:05,703 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 231 transitions, 1222 flow
[2023-11-03 12:48:05,706 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 231 transitions, 1206 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-11-03 12:48:05,708 INFO  L231             Difference]: Finished difference. Result has 77 places, 175 transitions, 910 flow
[2023-11-03 12:48:05,708 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=77, PETRI_TRANSITIONS=175}
[2023-11-03 12:48:05,709 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2023-11-03 12:48:05,709 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 175 transitions, 910 flow
[2023-11-03 12:48:05,709 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:05,710 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:05,710 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:05,710 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-03 12:48:05,710 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:05,710 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:05,710 INFO  L85        PathProgramCache]: Analyzing trace with hash 490022662, now seen corresponding path program 1 times
[2023-11-03 12:48:05,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:05,710 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643176253]
[2023-11-03 12:48:05,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:05,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:05,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:05,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 12:48:05,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:05,860 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643176253]
[2023-11-03 12:48:05,861 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643176253] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:48:05,861 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:48:05,861 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:48:05,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888230915]
[2023-11-03 12:48:05,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:48:05,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:48:05,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:05,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:48:05,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:48:06,014 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 192
[2023-11-03 12:48:06,015 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 175 transitions, 910 flow. Second operand  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:06,015 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:06,015 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 192
[2023-11-03 12:48:06,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:06,804 INFO  L130       PetriNetUnfolder]: 4197/7805 cut-off events.
[2023-11-03 12:48:06,805 INFO  L131       PetriNetUnfolder]: For 6317/6605 co-relation queries the response was YES.
[2023-11-03 12:48:06,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25509 conditions, 7805 events. 4197/7805 cut-off events. For 6317/6605 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 51218 event pairs, 1254 based on Foata normal form. 11/7497 useless extension candidates. Maximal degree in co-relation 20095. Up to 5830 conditions per place. 
[2023-11-03 12:48:06,864 INFO  L137   encePairwiseOnDemand]: 172/192 looper letters, 160 selfloop transitions, 69 changer transitions 0/258 dead transitions.
[2023-11-03 12:48:06,864 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 258 transitions, 1801 flow
[2023-11-03 12:48:06,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:48:06,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:48:06,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions.
[2023-11-03 12:48:06,866 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5243055555555556
[2023-11-03 12:48:06,866 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 604 transitions.
[2023-11-03 12:48:06,866 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions.
[2023-11-03 12:48:06,867 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:06,867 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions.
[2023-11-03 12:48:06,868 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:06,869 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:06,870 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:06,870 INFO  L175             Difference]: Start difference. First operand has 77 places, 175 transitions, 910 flow. Second operand 6 states and 604 transitions.
[2023-11-03 12:48:06,870 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 258 transitions, 1801 flow
[2023-11-03 12:48:06,898 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 258 transitions, 1701 flow, removed 50 selfloop flow, removed 0 redundant places.
[2023-11-03 12:48:06,901 INFO  L231             Difference]: Finished difference. Result has 87 places, 235 transitions, 1526 flow
[2023-11-03 12:48:06,901 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1526, PETRI_PLACES=87, PETRI_TRANSITIONS=235}
[2023-11-03 12:48:06,902 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places.
[2023-11-03 12:48:06,902 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 235 transitions, 1526 flow
[2023-11-03 12:48:06,902 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:06,902 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:06,903 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:06,903 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-03 12:48:06,903 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:06,903 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:06,903 INFO  L85        PathProgramCache]: Analyzing trace with hash -1420041874, now seen corresponding path program 1 times
[2023-11-03 12:48:06,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:06,903 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59286182]
[2023-11-03 12:48:06,903 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:06,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:06,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:07,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:07,205 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:07,205 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59286182]
[2023-11-03 12:48:07,205 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59286182] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:48:07,205 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948079724]
[2023-11-03 12:48:07,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:07,206 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:48:07,206 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:48:07,207 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:48:07,209 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-03 12:48:07,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:07,317 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-11-03 12:48:07,322 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:48:07,357 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:48:07,371 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:48:07,372 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:48:07,394 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:48:07,404 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:48:07,421 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:48:07,421 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:48:07,439 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:48:07,440 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:48:07,479 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:48:07,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:07,488 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:48:07,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:07,605 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948079724] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:48:07,605 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:48:07,605 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2023-11-03 12:48:07,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225954865]
[2023-11-03 12:48:07,606 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:48:07,606 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-11-03 12:48:07,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:07,606 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-11-03 12:48:07,606 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2023-11-03 12:48:08,133 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-11-03 12:48:08,134 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 235 transitions, 1526 flow. Second operand  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:08,134 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:08,134 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-11-03 12:48:08,134 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:09,976 INFO  L130       PetriNetUnfolder]: 4656/8478 cut-off events.
[2023-11-03 12:48:09,976 INFO  L131       PetriNetUnfolder]: For 12874/13089 co-relation queries the response was YES.
[2023-11-03 12:48:10,000 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32369 conditions, 8478 events. 4656/8478 cut-off events. For 12874/13089 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 54154 event pairs, 1418 based on Foata normal form. 0/8147 useless extension candidates. Maximal degree in co-relation 22476. Up to 6478 conditions per place. 
[2023-11-03 12:48:10,035 INFO  L137   encePairwiseOnDemand]: 172/192 looper letters, 329 selfloop transitions, 74 changer transitions 0/415 dead transitions.
[2023-11-03 12:48:10,035 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 415 transitions, 3510 flow
[2023-11-03 12:48:10,036 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-11-03 12:48:10,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-03 12:48:10,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions.
[2023-11-03 12:48:10,041 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.45928030303030304
[2023-11-03 12:48:10,041 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 970 transitions.
[2023-11-03 12:48:10,041 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions.
[2023-11-03 12:48:10,042 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:10,042 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions.
[2023-11-03 12:48:10,045 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:10,049 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:10,049 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:10,049 INFO  L175             Difference]: Start difference. First operand has 87 places, 235 transitions, 1526 flow. Second operand 11 states and 970 transitions.
[2023-11-03 12:48:10,050 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 415 transitions, 3510 flow
[2023-11-03 12:48:10,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 415 transitions, 3274 flow, removed 118 selfloop flow, removed 0 redundant places.
[2023-11-03 12:48:10,108 INFO  L231             Difference]: Finished difference. Result has 104 places, 271 transitions, 1985 flow
[2023-11-03 12:48:10,108 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1985, PETRI_PLACES=104, PETRI_TRANSITIONS=271}
[2023-11-03 12:48:10,109 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 47 predicate places.
[2023-11-03 12:48:10,109 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 271 transitions, 1985 flow
[2023-11-03 12:48:10,109 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:10,110 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:10,110 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:10,120 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-03 12:48:10,310 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-11-03 12:48:10,311 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:10,312 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:10,312 INFO  L85        PathProgramCache]: Analyzing trace with hash 668269293, now seen corresponding path program 1 times
[2023-11-03 12:48:10,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:10,312 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93969723]
[2023-11-03 12:48:10,313 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:10,313 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:10,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:10,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:10,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:10,611 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93969723]
[2023-11-03 12:48:10,611 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93969723] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:48:10,611 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986981953]
[2023-11-03 12:48:10,611 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:10,611 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:48:10,611 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:48:10,613 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:48:10,614 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-03 12:48:10,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:10,716 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-11-03 12:48:10,719 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:48:10,723 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:48:10,737 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:48:10,737 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:48:10,764 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2023-11-03 12:48:10,774 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2023-11-03 12:48:10,801 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:48:10,801 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2023-11-03 12:48:10,818 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:48:10,819 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2023-11-03 12:48:10,839 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39
[2023-11-03 12:48:10,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:10,851 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:48:10,872 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))) is different from false
[2023-11-03 12:48:10,897 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))))) is different from false
[2023-11-03 12:48:10,919 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-11-03 12:48:11,033 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-11-03 12:48:11,033 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986981953] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:48:11,034 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:48:11,034 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13
[2023-11-03 12:48:11,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67635231]
[2023-11-03 12:48:11,034 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:48:11,034 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2023-11-03 12:48:11,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:11,035 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2023-11-03 12:48:11,036 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210
[2023-11-03 12:48:11,156 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 192
[2023-11-03 12:48:11,156 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 271 transitions, 1985 flow. Second operand  has 15 states, 15 states have (on average 59.666666666666664) internal successors, (895), 15 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:11,157 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:11,157 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 192
[2023-11-03 12:48:11,157 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:14,939 INFO  L130       PetriNetUnfolder]: 9089/15228 cut-off events.
[2023-11-03 12:48:14,940 INFO  L131       PetriNetUnfolder]: For 26270/26274 co-relation queries the response was YES.
[2023-11-03 12:48:14,972 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61251 conditions, 15228 events. 9089/15228 cut-off events. For 26270/26274 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 98016 event pairs, 1448 based on Foata normal form. 4/13846 useless extension candidates. Maximal degree in co-relation 48685. Up to 7856 conditions per place. 
[2023-11-03 12:48:15,020 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 578 selfloop transitions, 532 changer transitions 9/1123 dead transitions.
[2023-11-03 12:48:15,020 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1123 transitions, 9568 flow
[2023-11-03 12:48:15,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-03 12:48:15,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-03 12:48:15,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1636 transitions.
[2023-11-03 12:48:15,024 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.44846491228070173
[2023-11-03 12:48:15,024 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1636 transitions.
[2023-11-03 12:48:15,024 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1636 transitions.
[2023-11-03 12:48:15,025 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:15,025 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1636 transitions.
[2023-11-03 12:48:15,027 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 86.10526315789474) internal successors, (1636), 19 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:15,030 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:15,031 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:15,031 INFO  L175             Difference]: Start difference. First operand has 104 places, 271 transitions, 1985 flow. Second operand 19 states and 1636 transitions.
[2023-11-03 12:48:15,031 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 1123 transitions, 9568 flow
[2023-11-03 12:48:15,197 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 1123 transitions, 9556 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-11-03 12:48:15,206 INFO  L231             Difference]: Finished difference. Result has 131 places, 771 transitions, 7820 flow
[2023-11-03 12:48:15,207 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7820, PETRI_PLACES=131, PETRI_TRANSITIONS=771}
[2023-11-03 12:48:15,207 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 74 predicate places.
[2023-11-03 12:48:15,207 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 771 transitions, 7820 flow
[2023-11-03 12:48:15,208 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 59.666666666666664) internal successors, (895), 15 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:15,208 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:15,208 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:15,216 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-03 12:48:15,408 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:48:15,409 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:15,410 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:15,410 INFO  L85        PathProgramCache]: Analyzing trace with hash -220900113, now seen corresponding path program 1 times
[2023-11-03 12:48:15,410 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:15,410 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775405811]
[2023-11-03 12:48:15,410 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:15,410 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:15,430 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:15,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:15,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:15,736 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775405811]
[2023-11-03 12:48:15,736 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775405811] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:48:15,736 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599819947]
[2023-11-03 12:48:15,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:15,737 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:48:15,737 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:48:15,738 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:48:15,740 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-03 12:48:15,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:15,846 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-11-03 12:48:15,849 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:48:15,854 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:48:15,866 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:48:15,867 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:48:15,896 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:48:15,908 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:48:15,948 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:48:15,949 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:48:15,980 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:48:15,980 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:48:16,002 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:48:16,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:16,016 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:48:16,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:16,164 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [599819947] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:48:16,164 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:48:16,164 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2023-11-03 12:48:16,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689879574]
[2023-11-03 12:48:16,164 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:48:16,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-11-03 12:48:16,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:16,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-11-03 12:48:16,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2023-11-03 12:48:16,871 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-11-03 12:48:16,872 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 771 transitions, 7820 flow. Second operand  has 12 states, 12 states have (on average 76.75) internal successors, (921), 12 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:16,872 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:16,872 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-11-03 12:48:16,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:20,026 INFO  L130       PetriNetUnfolder]: 8746/15150 cut-off events.
[2023-11-03 12:48:20,026 INFO  L131       PetriNetUnfolder]: For 62441/63984 co-relation queries the response was YES.
[2023-11-03 12:48:20,086 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88265 conditions, 15150 events. 8746/15150 cut-off events. For 62441/63984 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 104065 event pairs, 626 based on Foata normal form. 179/14802 useless extension candidates. Maximal degree in co-relation 86284. Up to 10299 conditions per place. 
[2023-11-03 12:48:20,147 INFO  L137   encePairwiseOnDemand]: 176/192 looper letters, 839 selfloop transitions, 358 changer transitions 2/1229 dead transitions.
[2023-11-03 12:48:20,147 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 1229 transitions, 15058 flow
[2023-11-03 12:48:20,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-11-03 12:48:20,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-11-03 12:48:20,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1079 transitions.
[2023-11-03 12:48:20,150 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4683159722222222
[2023-11-03 12:48:20,150 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1079 transitions.
[2023-11-03 12:48:20,150 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1079 transitions.
[2023-11-03 12:48:20,151 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:20,151 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1079 transitions.
[2023-11-03 12:48:20,152 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 89.91666666666667) internal successors, (1079), 12 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:20,154 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:20,155 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:20,155 INFO  L175             Difference]: Start difference. First operand has 131 places, 771 transitions, 7820 flow. Second operand 12 states and 1079 transitions.
[2023-11-03 12:48:20,155 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 1229 transitions, 15058 flow
[2023-11-03 12:48:21,525 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1229 transitions, 14413 flow, removed 318 selfloop flow, removed 4 redundant places.
[2023-11-03 12:48:21,539 INFO  L231             Difference]: Finished difference. Result has 143 places, 1023 transitions, 11838 flow
[2023-11-03 12:48:21,540 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=7529, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11838, PETRI_PLACES=143, PETRI_TRANSITIONS=1023}
[2023-11-03 12:48:21,541 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places.
[2023-11-03 12:48:21,541 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 1023 transitions, 11838 flow
[2023-11-03 12:48:21,541 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 76.75) internal successors, (921), 12 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:21,541 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:21,541 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:21,549 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-03 12:48:21,743 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-11-03 12:48:21,743 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:21,744 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:21,744 INFO  L85        PathProgramCache]: Analyzing trace with hash -972504981, now seen corresponding path program 2 times
[2023-11-03 12:48:21,744 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:21,745 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955093919]
[2023-11-03 12:48:21,745 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:21,745 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:21,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:22,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:22,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:22,031 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955093919]
[2023-11-03 12:48:22,031 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955093919] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:48:22,031 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832130646]
[2023-11-03 12:48:22,032 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 12:48:22,032 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:48:22,032 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:48:22,033 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:48:22,035 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-03 12:48:22,177 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 12:48:22,177 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:48:22,179 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-11-03 12:48:22,184 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:48:22,207 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:48:22,242 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:48:22,242 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:48:22,389 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:48:22,425 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:48:22,488 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:48:22,581 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 12:48:22,600 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:48:22,655 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:48:22,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:22,698 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:48:22,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:22,835 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [832130646] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:48:22,835 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:48:22,835 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20
[2023-11-03 12:48:22,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708486554]
[2023-11-03 12:48:22,835 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:48:22,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2023-11-03 12:48:22,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:22,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2023-11-03 12:48:22,836 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462
[2023-11-03 12:48:24,210 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-11-03 12:48:24,211 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 1023 transitions, 11838 flow. Second operand  has 22 states, 22 states have (on average 76.81818181818181) internal successors, (1690), 22 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:24,211 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:24,212 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-11-03 12:48:24,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:29,264 INFO  L130       PetriNetUnfolder]: 9057/15823 cut-off events.
[2023-11-03 12:48:29,264 INFO  L131       PetriNetUnfolder]: For 80875/82329 co-relation queries the response was YES.
[2023-11-03 12:48:29,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95075 conditions, 15823 events. 9057/15823 cut-off events. For 80875/82329 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 109257 event pairs, 657 based on Foata normal form. 152/15449 useless extension candidates. Maximal degree in co-relation 93109. Up to 11155 conditions per place. 
[2023-11-03 12:48:29,399 INFO  L137   encePairwiseOnDemand]: 171/192 looper letters, 1149 selfloop transitions, 376 changer transitions 16/1571 dead transitions.
[2023-11-03 12:48:29,399 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1571 transitions, 20634 flow
[2023-11-03 12:48:29,400 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-11-03 12:48:29,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-11-03 12:48:29,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1834 transitions.
[2023-11-03 12:48:29,404 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4548611111111111
[2023-11-03 12:48:29,404 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1834 transitions.
[2023-11-03 12:48:29,404 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1834 transitions.
[2023-11-03 12:48:29,405 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:29,405 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1834 transitions.
[2023-11-03 12:48:29,408 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 87.33333333333333) internal successors, (1834), 21 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:29,412 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:29,412 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:29,413 INFO  L175             Difference]: Start difference. First operand has 143 places, 1023 transitions, 11838 flow. Second operand 21 states and 1834 transitions.
[2023-11-03 12:48:29,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1571 transitions, 20634 flow
[2023-11-03 12:48:30,715 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 1571 transitions, 20199 flow, removed 205 selfloop flow, removed 5 redundant places.
[2023-11-03 12:48:30,734 INFO  L231             Difference]: Finished difference. Result has 166 places, 1174 transitions, 14603 flow
[2023-11-03 12:48:30,734 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=11423, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14603, PETRI_PLACES=166, PETRI_TRANSITIONS=1174}
[2023-11-03 12:48:30,735 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 109 predicate places.
[2023-11-03 12:48:30,735 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 1174 transitions, 14603 flow
[2023-11-03 12:48:30,736 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 76.81818181818181) internal successors, (1690), 22 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:30,736 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:30,736 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:30,745 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-03 12:48:30,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:48:30,941 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:30,942 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:30,942 INFO  L85        PathProgramCache]: Analyzing trace with hash 2049850436, now seen corresponding path program 2 times
[2023-11-03 12:48:30,942 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:30,942 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520863448]
[2023-11-03 12:48:30,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:30,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:30,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:31,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:31,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:31,256 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520863448]
[2023-11-03 12:48:31,256 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520863448] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:48:31,257 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626882448]
[2023-11-03 12:48:31,257 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 12:48:31,257 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:48:31,257 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:48:31,259 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:48:31,260 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-11-03 12:48:31,385 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 12:48:31,385 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:48:31,387 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-11-03 12:48:31,391 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:48:31,400 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:48:31,455 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:48:31,455 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:48:31,582 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:48:31,645 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:48:31,688 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:48:31,741 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:48:31,806 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:48:31,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:31,862 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:48:31,888 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2023-11-03 12:48:31,911 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-11-03 12:48:31,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-03 12:48:31,986 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [626882448] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:48:31,986 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:48:31,986 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21
[2023-11-03 12:48:31,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142275851]
[2023-11-03 12:48:31,987 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:48:31,987 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2023-11-03 12:48:31,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:31,987 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2023-11-03 12:48:31,988 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=349, Unknown=2, NotChecked=78, Total=506
[2023-11-03 12:48:32,150 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-11-03 12:48:32,152 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 1174 transitions, 14603 flow. Second operand  has 23 states, 23 states have (on average 54.69565217391305) internal successors, (1258), 23 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:32,152 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:32,152 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-11-03 12:48:32,152 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:39,339 INFO  L130       PetriNetUnfolder]: 11708/19508 cut-off events.
[2023-11-03 12:48:39,339 INFO  L131       PetriNetUnfolder]: For 124723/124729 co-relation queries the response was YES.
[2023-11-03 12:48:39,419 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127668 conditions, 19508 events. 11708/19508 cut-off events. For 124723/124729 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 131180 event pairs, 698 based on Foata normal form. 1/18175 useless extension candidates. Maximal degree in co-relation 125380. Up to 13919 conditions per place. 
[2023-11-03 12:48:39,510 INFO  L137   encePairwiseOnDemand]: 167/192 looper letters, 1349 selfloop transitions, 732 changer transitions 2/2087 dead transitions.
[2023-11-03 12:48:39,510 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 2087 transitions, 29755 flow
[2023-11-03 12:48:39,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-11-03 12:48:39,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-11-03 12:48:39,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1530 transitions.
[2023-11-03 12:48:39,514 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34646739130434784
[2023-11-03 12:48:39,514 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1530 transitions.
[2023-11-03 12:48:39,514 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1530 transitions.
[2023-11-03 12:48:39,515 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:39,515 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1530 transitions.
[2023-11-03 12:48:39,519 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 66.52173913043478) internal successors, (1530), 23 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:39,525 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:39,526 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:39,526 INFO  L175             Difference]: Start difference. First operand has 166 places, 1174 transitions, 14603 flow. Second operand 23 states and 1530 transitions.
[2023-11-03 12:48:39,526 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 2087 transitions, 29755 flow
[2023-11-03 12:48:41,686 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 2087 transitions, 29052 flow, removed 136 selfloop flow, removed 7 redundant places.
[2023-11-03 12:48:41,710 INFO  L231             Difference]: Finished difference. Result has 195 places, 1597 transitions, 22944 flow
[2023-11-03 12:48:41,711 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=13955, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=407, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=22944, PETRI_PLACES=195, PETRI_TRANSITIONS=1597}
[2023-11-03 12:48:41,711 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 138 predicate places.
[2023-11-03 12:48:41,712 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 1597 transitions, 22944 flow
[2023-11-03 12:48:41,712 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 54.69565217391305) internal successors, (1258), 23 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:41,712 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:41,712 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:41,721 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2023-11-03 12:48:41,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2023-11-03 12:48:41,914 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:41,914 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:41,914 INFO  L85        PathProgramCache]: Analyzing trace with hash -862277107, now seen corresponding path program 3 times
[2023-11-03 12:48:41,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:41,915 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502473774]
[2023-11-03 12:48:41,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:41,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:41,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:42,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:42,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:42,210 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502473774]
[2023-11-03 12:48:42,210 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502473774] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:48:42,210 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477840607]
[2023-11-03 12:48:42,210 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-03 12:48:42,210 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:48:42,210 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:48:42,212 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:48:42,214 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-11-03 12:48:42,343 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-03 12:48:42,343 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:48:42,345 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-11-03 12:48:42,348 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:48:42,356 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:48:42,393 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:48:42,393 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:48:42,519 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:48:42,558 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:48:42,643 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:48:42,683 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 12:48:42,706 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:48:42,765 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:48:42,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:42,805 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:48:42,829 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2023-11-03 12:48:42,849 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))))))) is different from false
[2023-11-03 12:48:42,872 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|))))) is different from false
[2023-11-03 12:48:42,895 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse0 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse4 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse6 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse7 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)))))))) is different from false
[2023-11-03 12:48:42,921 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse1 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse4 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse5 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse7 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false
[2023-11-03 12:48:42,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-11-03 12:48:43,000 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [477840607] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:48:43,000 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:48:43,000 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25
[2023-11-03 12:48:43,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323106318]
[2023-11-03 12:48:43,000 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:48:43,000 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-11-03 12:48:43,000 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:43,001 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-11-03 12:48:43,001 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=393, Unknown=5, NotChecked=220, Total=702
[2023-11-03 12:48:43,184 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-11-03 12:48:43,185 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 1597 transitions, 22944 flow. Second operand  has 27 states, 27 states have (on average 54.7037037037037) internal successors, (1477), 27 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:43,185 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:43,185 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-11-03 12:48:43,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:48:52,190 INFO  L130       PetriNetUnfolder]: 11553/19268 cut-off events.
[2023-11-03 12:48:52,190 INFO  L131       PetriNetUnfolder]: For 185351/185357 co-relation queries the response was YES.
[2023-11-03 12:48:52,286 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 139651 conditions, 19268 events. 11553/19268 cut-off events. For 185351/185357 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 129405 event pairs, 697 based on Foata normal form. 118/18359 useless extension candidates. Maximal degree in co-relation 137316. Up to 14904 conditions per place. 
[2023-11-03 12:48:52,372 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 1574 selfloop transitions, 601 changer transitions 2/2181 dead transitions.
[2023-11-03 12:48:52,372 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 2181 transitions, 34403 flow
[2023-11-03 12:48:52,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-11-03 12:48:52,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-11-03 12:48:52,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1635 transitions.
[2023-11-03 12:48:52,375 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.340625
[2023-11-03 12:48:52,375 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1635 transitions.
[2023-11-03 12:48:52,375 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1635 transitions.
[2023-11-03 12:48:52,376 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:48:52,376 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1635 transitions.
[2023-11-03 12:48:52,377 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 65.4) internal successors, (1635), 25 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:52,381 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:52,382 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:52,382 INFO  L175             Difference]: Start difference. First operand has 195 places, 1597 transitions, 22944 flow. Second operand 25 states and 1635 transitions.
[2023-11-03 12:48:52,382 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 2181 transitions, 34403 flow
[2023-11-03 12:48:55,350 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2181 transitions, 31812 flow, removed 1089 selfloop flow, removed 6 redundant places.
[2023-11-03 12:48:55,379 INFO  L231             Difference]: Finished difference. Result has 223 places, 1767 transitions, 25279 flow
[2023-11-03 12:48:55,381 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=20484, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=462, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=25279, PETRI_PLACES=223, PETRI_TRANSITIONS=1767}
[2023-11-03 12:48:55,381 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 166 predicate places.
[2023-11-03 12:48:55,381 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 1767 transitions, 25279 flow
[2023-11-03 12:48:55,382 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 54.7037037037037) internal successors, (1477), 27 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:55,382 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:48:55,382 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:48:55,390 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2023-11-03 12:48:55,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2023-11-03 12:48:55,584 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:48:55,584 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:48:55,585 INFO  L85        PathProgramCache]: Analyzing trace with hash 329382834, now seen corresponding path program 1 times
[2023-11-03 12:48:55,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:48:55,585 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422866948]
[2023-11-03 12:48:55,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:55,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:48:55,601 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:55,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:55,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:48:55,821 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422866948]
[2023-11-03 12:48:55,821 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422866948] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:48:55,821 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642509554]
[2023-11-03 12:48:55,821 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:48:55,821 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:48:55,821 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:48:55,822 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:48:55,824 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-11-03 12:48:55,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:48:55,946 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-11-03 12:48:55,950 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:48:55,955 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:48:55,966 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:48:55,967 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:48:55,984 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2023-11-03 12:48:56,003 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2023-11-03 12:48:56,015 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:48:56,015 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2023-11-03 12:48:56,030 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:48:56,030 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2023-11-03 12:48:56,047 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39
[2023-11-03 12:48:56,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:48:56,056 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:48:56,076 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-03 12:48:56,179 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-11-03 12:48:56,200 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 5)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-03 12:48:56,266 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:48:56,266 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53
[2023-11-03 12:48:56,275 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:48:56,275 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32
[2023-11-03 12:48:56,282 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-11-03 12:48:56,282 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2023-11-03 12:48:56,287 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-11-03 12:48:56,287 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2023-11-03 12:48:56,291 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-11-03 12:48:56,292 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2023-11-03 12:48:56,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-03 12:48:56,315 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642509554] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:48:56,315 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:48:56,315 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14
[2023-11-03 12:48:56,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925391114]
[2023-11-03 12:48:56,316 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:48:56,316 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-11-03 12:48:56,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:48:56,316 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-11-03 12:48:56,317 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=114, Unknown=9, NotChecked=72, Total=240
[2023-11-03 12:48:56,388 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 192
[2023-11-03 12:48:56,389 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1767 transitions, 25279 flow. Second operand  has 16 states, 16 states have (on average 59.8125) internal successors, (957), 16 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:48:56,389 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:48:56,389 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 192
[2023-11-03 12:48:56,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:49:05,813 INFO  L130       PetriNetUnfolder]: 12234/20378 cut-off events.
[2023-11-03 12:49:05,813 INFO  L131       PetriNetUnfolder]: For 217902/217910 co-relation queries the response was YES.
[2023-11-03 12:49:05,927 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156294 conditions, 20378 events. 12234/20378 cut-off events. For 217902/217910 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 138964 event pairs, 1327 based on Foata normal form. 65/19384 useless extension candidates. Maximal degree in co-relation 153912. Up to 10079 conditions per place. 
[2023-11-03 12:49:06,022 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 1019 selfloop transitions, 1404 changer transitions 10/2437 dead transitions.
[2023-11-03 12:49:06,022 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 2437 transitions, 38878 flow
[2023-11-03 12:49:06,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-11-03 12:49:06,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-11-03 12:49:06,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1533 transitions.
[2023-11-03 12:49:06,025 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4435763888888889
[2023-11-03 12:49:06,025 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1533 transitions.
[2023-11-03 12:49:06,025 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1533 transitions.
[2023-11-03 12:49:06,025 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:49:06,025 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1533 transitions.
[2023-11-03 12:49:06,027 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 85.16666666666667) internal successors, (1533), 18 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:06,029 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 192.0) internal successors, (3648), 19 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:06,029 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 192.0) internal successors, (3648), 19 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:06,029 INFO  L175             Difference]: Start difference. First operand has 223 places, 1767 transitions, 25279 flow. Second operand 18 states and 1533 transitions.
[2023-11-03 12:49:06,029 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 2437 transitions, 38878 flow
[2023-11-03 12:49:09,822 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2437 transitions, 37334 flow, removed 671 selfloop flow, removed 8 redundant places.
[2023-11-03 12:49:09,853 INFO  L231             Difference]: Finished difference. Result has 236 places, 1973 transitions, 30792 flow
[2023-11-03 12:49:09,854 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=24133, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=30792, PETRI_PLACES=236, PETRI_TRANSITIONS=1973}
[2023-11-03 12:49:09,854 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 179 predicate places.
[2023-11-03 12:49:09,854 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 1973 transitions, 30792 flow
[2023-11-03 12:49:09,855 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 59.8125) internal successors, (957), 16 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:09,855 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:49:09,855 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:49:09,862 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-11-03 12:49:10,055 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-11-03 12:49:10,056 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:49:10,057 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:49:10,057 INFO  L85        PathProgramCache]: Analyzing trace with hash -1883145753, now seen corresponding path program 1 times
[2023-11-03 12:49:10,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:49:10,057 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957090423]
[2023-11-03 12:49:10,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:49:10,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:49:10,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:49:10,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:49:10,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:49:10,317 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957090423]
[2023-11-03 12:49:10,318 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957090423] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:49:10,318 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483752885]
[2023-11-03 12:49:10,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:49:10,318 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:49:10,318 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:49:10,319 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:49:10,321 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-11-03 12:49:10,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:49:10,412 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 40 conjunts are in the unsatisfiable core
[2023-11-03 12:49:10,422 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:49:10,437 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:49:10,478 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:49:10,479 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:49:10,572 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:49:10,616 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:49:10,657 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:49:10,723 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:49:10,786 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:49:10,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:49:10,825 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:49:11,073 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false
[2023-11-03 12:49:11,091 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2) 0)))) (and (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2023-11-03 12:49:11,112 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:49:11,113 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2023-11-03 12:49:11,119 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:49:11,119 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2023-11-03 12:49:11,122 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2023-11-03 12:49:11,131 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-11-03 12:49:11,131 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2023-11-03 12:49:11,140 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-11-03 12:49:11,141 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2023-11-03 12:49:11,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:49:11,184 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483752885] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:49:11,184 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:49:11,184 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2023-11-03 12:49:11,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379029801]
[2023-11-03 12:49:11,184 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:49:11,184 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-03 12:49:11,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:49:11,185 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-03 12:49:11,185 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=433, Unknown=19, NotChecked=90, Total=650
[2023-11-03 12:49:11,403 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-11-03 12:49:11,405 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1973 transitions, 30792 flow. Second operand  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:11,405 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:49:11,405 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-11-03 12:49:11,405 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:49:28,513 INFO  L130       PetriNetUnfolder]: 21940/36688 cut-off events.
[2023-11-03 12:49:28,513 INFO  L131       PetriNetUnfolder]: For 426823/426905 co-relation queries the response was YES.
[2023-11-03 12:49:28,880 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 300915 conditions, 36688 events. 21940/36688 cut-off events. For 426823/426905 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 277379 event pairs, 1049 based on Foata normal form. 352/34898 useless extension candidates. Maximal degree in co-relation 294677. Up to 15484 conditions per place. 
[2023-11-03 12:49:29,064 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2770 selfloop transitions, 1147 changer transitions 2/3923 dead transitions.
[2023-11-03 12:49:29,065 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 3923 transitions, 65680 flow
[2023-11-03 12:49:29,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2023-11-03 12:49:29,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2023-11-03 12:49:29,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1986 transitions.
[2023-11-03 12:49:29,068 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34479166666666666
[2023-11-03 12:49:29,068 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1986 transitions.
[2023-11-03 12:49:29,068 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1986 transitions.
[2023-11-03 12:49:29,069 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:49:29,069 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1986 transitions.
[2023-11-03 12:49:29,071 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 66.2) internal successors, (1986), 30 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:29,074 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 192.0) internal successors, (5952), 31 states have internal predecessors, (5952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:29,075 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 192.0) internal successors, (5952), 31 states have internal predecessors, (5952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:29,075 INFO  L175             Difference]: Start difference. First operand has 236 places, 1973 transitions, 30792 flow. Second operand 30 states and 1986 transitions.
[2023-11-03 12:49:29,075 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 3923 transitions, 65680 flow
[2023-11-03 12:49:46,330 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 3923 transitions, 61915 flow, removed 686 selfloop flow, removed 10 redundant places.
[2023-11-03 12:49:46,388 INFO  L231             Difference]: Finished difference. Result has 277 places, 3020 transitions, 49672 flow
[2023-11-03 12:49:46,389 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=28910, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=49672, PETRI_PLACES=277, PETRI_TRANSITIONS=3020}
[2023-11-03 12:49:46,390 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 220 predicate places.
[2023-11-03 12:49:46,390 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 3020 transitions, 49672 flow
[2023-11-03 12:49:46,390 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:46,390 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:49:46,390 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:49:46,399 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2023-11-03 12:49:46,591 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-11-03 12:49:46,592 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:49:46,593 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:49:46,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -201168629, now seen corresponding path program 2 times
[2023-11-03 12:49:46,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:49:46,594 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850979582]
[2023-11-03 12:49:46,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:49:46,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:49:46,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:49:46,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:49:46,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:49:46,872 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850979582]
[2023-11-03 12:49:46,872 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850979582] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:49:46,872 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709994488]
[2023-11-03 12:49:46,872 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 12:49:46,873 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:49:46,873 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:49:46,874 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:49:46,876 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-03 12:49:47,016 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 12:49:47,017 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:49:47,018 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-11-03 12:49:47,021 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:49:47,026 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:49:47,057 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:49:47,057 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:49:47,137 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:49:47,175 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:49:47,223 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:49:47,319 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 12:49:47,332 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:49:47,388 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:49:47,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:49:47,429 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:49:47,455 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)))) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2023-11-03 12:49:47,574 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0))))) is different from false
[2023-11-03 12:49:47,598 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (and (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0))))) is different from false
[2023-11-03 12:49:47,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:49:47,690 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [709994488] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:49:47,690 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:49:47,690 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2023-11-03 12:49:47,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268956318]
[2023-11-03 12:49:47,691 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:49:47,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-03 12:49:47,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:49:47,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-03 12:49:47,693 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=416, Unknown=9, NotChecked=132, Total=650
[2023-11-03 12:49:47,739 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-11-03 12:49:47,740 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 3020 transitions, 49672 flow. Second operand  has 26 states, 26 states have (on average 56.80769230769231) internal successors, (1477), 26 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:49:47,740 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:49:47,740 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-11-03 12:49:47,740 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:50:14,503 INFO  L130       PetriNetUnfolder]: 25276/42687 cut-off events.
[2023-11-03 12:50:14,504 INFO  L131       PetriNetUnfolder]: For 780172/780244 co-relation queries the response was YES.
[2023-11-03 12:50:15,212 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 388629 conditions, 42687 events. 25276/42687 cut-off events. For 780172/780244 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 331992 event pairs, 1801 based on Foata normal form. 269/40371 useless extension candidates. Maximal degree in co-relation 382433. Up to 20482 conditions per place. 
[2023-11-03 12:50:15,498 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2885 selfloop transitions, 1072 changer transitions 0/3961 dead transitions.
[2023-11-03 12:50:15,499 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 3961 transitions, 72942 flow
[2023-11-03 12:50:15,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-11-03 12:50:15,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-11-03 12:50:15,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1822 transitions.
[2023-11-03 12:50:15,502 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36498397435897434
[2023-11-03 12:50:15,502 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1822 transitions.
[2023-11-03 12:50:15,502 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1822 transitions.
[2023-11-03 12:50:15,502 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:50:15,503 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1822 transitions.
[2023-11-03 12:50:15,505 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 70.07692307692308) internal successors, (1822), 26 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:50:15,508 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 192.0) internal successors, (5184), 27 states have internal predecessors, (5184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:50:15,508 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 192.0) internal successors, (5184), 27 states have internal predecessors, (5184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:50:15,508 INFO  L175             Difference]: Start difference. First operand has 277 places, 3020 transitions, 49672 flow. Second operand 26 states and 1822 transitions.
[2023-11-03 12:50:15,508 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 3961 transitions, 72942 flow
[2023-11-03 12:50:47,080 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 3961 transitions, 68771 flow, removed 2083 selfloop flow, removed 3 redundant places.
[2023-11-03 12:50:47,140 INFO  L231             Difference]: Finished difference. Result has 317 places, 3492 transitions, 58992 flow
[2023-11-03 12:50:47,142 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=46139, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=621, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=58992, PETRI_PLACES=317, PETRI_TRANSITIONS=3492}
[2023-11-03 12:50:47,142 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 260 predicate places.
[2023-11-03 12:50:47,142 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 3492 transitions, 58992 flow
[2023-11-03 12:50:47,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.80769230769231) internal successors, (1477), 26 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:50:47,143 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:50:47,143 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:50:47,152 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2023-11-03 12:50:47,344 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-11-03 12:50:47,345 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:50:47,345 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:50:47,346 INFO  L85        PathProgramCache]: Analyzing trace with hash -530869613, now seen corresponding path program 3 times
[2023-11-03 12:50:47,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:50:47,346 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002105538]
[2023-11-03 12:50:47,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:50:47,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:50:47,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:50:47,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:50:47,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:50:47,612 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002105538]
[2023-11-03 12:50:47,612 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002105538] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:50:47,612 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557536316]
[2023-11-03 12:50:47,613 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-03 12:50:47,613 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:50:47,613 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:50:47,615 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:50:47,617 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-11-03 12:50:47,767 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-03 12:50:47,767 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:50:47,768 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-11-03 12:50:47,773 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:50:47,778 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:50:47,805 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:50:47,806 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:50:47,915 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:50:47,947 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:50:47,996 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:50:48,061 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 12:50:48,091 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:50:48,153 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:50:48,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:50:48,194 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:50:48,218 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2023-11-03 12:50:48,240 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)))))) is different from false
[2023-11-03 12:50:48,269 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) 0))))) is different from false
[2023-11-03 12:50:48,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:50:48,377 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [557536316] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:50:48,377 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:50:48,378 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23
[2023-11-03 12:50:48,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944773793]
[2023-11-03 12:50:48,378 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:50:48,378 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2023-11-03 12:50:48,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:50:48,379 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-11-03 12:50:48,379 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=378, Unknown=3, NotChecked=126, Total=600
[2023-11-03 12:50:48,506 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-11-03 12:50:48,507 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 3492 transitions, 58992 flow. Second operand  has 25 states, 25 states have (on average 56.84) internal successors, (1421), 25 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:50:48,507 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:50:48,507 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-11-03 12:50:48,507 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:51:18,722 INFO  L130       PetriNetUnfolder]: 26170/44205 cut-off events.
[2023-11-03 12:51:18,723 INFO  L131       PetriNetUnfolder]: For 1031411/1031425 co-relation queries the response was YES.
[2023-11-03 12:51:19,486 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 432566 conditions, 44205 events. 26170/44205 cut-off events. For 1031411/1031425 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 345770 event pairs, 1339 based on Foata normal form. 199/41763 useless extension candidates. Maximal degree in co-relation 426112. Up to 15717 conditions per place. 
[2023-11-03 12:51:19,753 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2780 selfloop transitions, 1750 changer transitions 2/4536 dead transitions.
[2023-11-03 12:51:19,753 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 4536 transitions, 85690 flow
[2023-11-03 12:51:19,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-11-03 12:51:19,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-11-03 12:51:19,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1765 transitions.
[2023-11-03 12:51:19,756 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36770833333333336
[2023-11-03 12:51:19,756 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1765 transitions.
[2023-11-03 12:51:19,756 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1765 transitions.
[2023-11-03 12:51:19,757 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:51:19,757 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1765 transitions.
[2023-11-03 12:51:19,759 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 70.6) internal successors, (1765), 25 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:51:19,762 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:51:19,762 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:51:19,762 INFO  L175             Difference]: Start difference. First operand has 317 places, 3492 transitions, 58992 flow. Second operand 25 states and 1765 transitions.
[2023-11-03 12:51:19,763 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 4536 transitions, 85690 flow
[2023-11-03 12:51:52,416 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 4536 transitions, 83793 flow, removed 946 selfloop flow, removed 3 redundant places.
[2023-11-03 12:51:52,483 INFO  L231             Difference]: Finished difference. Result has 345 places, 3971 transitions, 71320 flow
[2023-11-03 12:51:52,485 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=57313, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=71320, PETRI_PLACES=345, PETRI_TRANSITIONS=3971}
[2023-11-03 12:51:52,485 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 288 predicate places.
[2023-11-03 12:51:52,486 INFO  L495      AbstractCegarLoop]: Abstraction has has 345 places, 3971 transitions, 71320 flow
[2023-11-03 12:51:52,486 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 56.84) internal successors, (1421), 25 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:51:52,486 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:51:52,486 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:51:52,494 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2023-11-03 12:51:52,687 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:51:52,687 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:51:52,688 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:51:52,688 INFO  L85        PathProgramCache]: Analyzing trace with hash -85817847, now seen corresponding path program 1 times
[2023-11-03 12:51:52,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:51:52,689 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127278351]
[2023-11-03 12:51:52,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:51:52,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:51:52,713 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:51:52,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:51:52,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:51:52,958 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127278351]
[2023-11-03 12:51:52,958 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127278351] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:51:52,958 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306364954]
[2023-11-03 12:51:52,958 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:51:52,958 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:51:52,958 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:51:52,959 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:51:52,961 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-11-03 12:51:53,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:51:53,089 INFO  L263         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-11-03 12:51:53,093 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:51:53,097 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:51:53,121 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:51:53,122 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:51:53,141 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:51:53,149 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-03 12:51:53,156 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:51:53,168 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:51:53,169 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:51:53,185 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:51:53,185 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:51:53,204 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:51:53,227 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:51:53,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:51:53,242 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:51:53,270 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))))) is different from false
[2023-11-03 12:51:53,391 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false
[2023-11-03 12:51:53,413 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse4 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-11-03 12:51:53,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-11-03 12:51:53,477 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [306364954] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:51:53,477 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:51:53,477 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14
[2023-11-03 12:51:53,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543674333]
[2023-11-03 12:51:53,478 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:51:53,478 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-11-03 12:51:53,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:51:53,478 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-11-03 12:51:53,478 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=9, NotChecked=72, Total=240
[2023-11-03 12:51:53,573 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-11-03 12:51:53,573 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 3971 transitions, 71320 flow. Second operand  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:51:53,573 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:51:53,574 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-11-03 12:51:53,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:52:25,721 INFO  L130       PetriNetUnfolder]: 26160/44175 cut-off events.
[2023-11-03 12:52:25,722 INFO  L131       PetriNetUnfolder]: For 1231998/1232042 co-relation queries the response was YES.
[2023-11-03 12:52:26,511 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 465723 conditions, 44175 events. 26160/44175 cut-off events. For 1231998/1232042 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 344462 event pairs, 3912 based on Foata normal form. 66/41604 useless extension candidates. Maximal degree in co-relation 461007. Up to 38536 conditions per place. 
[2023-11-03 12:52:26,841 INFO  L137   encePairwiseOnDemand]: 168/192 looper letters, 3174 selfloop transitions, 1041 changer transitions 0/4219 dead transitions.
[2023-11-03 12:52:26,841 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 4219 transitions, 84045 flow
[2023-11-03 12:52:26,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-11-03 12:52:26,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-11-03 12:52:26,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 819 transitions.
[2023-11-03 12:52:26,843 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35546875
[2023-11-03 12:52:26,844 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 819 transitions.
[2023-11-03 12:52:26,844 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 819 transitions.
[2023-11-03 12:52:26,844 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:52:26,844 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 819 transitions.
[2023-11-03 12:52:26,845 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:52:26,847 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:52:26,848 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:52:26,848 INFO  L175             Difference]: Start difference. First operand has 345 places, 3971 transitions, 71320 flow. Second operand 12 states and 819 transitions.
[2023-11-03 12:52:26,848 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 4219 transitions, 84045 flow
[2023-11-03 12:53:01,367 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4219 transitions, 82234 flow, removed 856 selfloop flow, removed 9 redundant places.
[2023-11-03 12:53:01,434 INFO  L231             Difference]: Finished difference. Result has 349 places, 4037 transitions, 72965 flow
[2023-11-03 12:53:01,437 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=69498, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=969, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=72965, PETRI_PLACES=349, PETRI_TRANSITIONS=4037}
[2023-11-03 12:53:01,437 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 292 predicate places.
[2023-11-03 12:53:01,438 INFO  L495      AbstractCegarLoop]: Abstraction has has 349 places, 4037 transitions, 72965 flow
[2023-11-03 12:53:01,438 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:53:01,438 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:53:01,438 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:53:01,446 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2023-11-03 12:53:01,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:53:01,640 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:53:01,641 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:53:01,641 INFO  L85        PathProgramCache]: Analyzing trace with hash 92273895, now seen corresponding path program 4 times
[2023-11-03 12:53:01,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:53:01,642 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989136119]
[2023-11-03 12:53:01,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:53:01,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:53:01,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:53:01,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:53:01,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:53:01,948 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989136119]
[2023-11-03 12:53:01,948 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989136119] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:53:01,948 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845278000]
[2023-11-03 12:53:01,948 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-03 12:53:01,948 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:53:01,948 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:53:01,950 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:53:01,952 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-11-03 12:53:02,182 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-03 12:53:02,183 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:53:02,185 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core
[2023-11-03 12:53:02,188 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:53:02,199 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:53:02,207 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:53:02,207 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:53:02,226 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:53:02,234 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:53:02,251 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-11-03 12:53:02,267 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:53:02,267 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:53:02,287 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:53:02,287 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:53:02,307 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:53:02,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:53:02,318 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:53:02,345 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)))) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2023-11-03 12:53:02,460 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2023-11-03 12:53:02,482 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3))) (and (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)))) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0))))) is different from false
[2023-11-03 12:53:02,504 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3))) (and (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0))))) is different from false
[2023-11-03 12:53:02,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:53:02,572 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [845278000] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:53:02,573 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:53:02,573 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 15
[2023-11-03 12:53:02,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495042194]
[2023-11-03 12:53:02,573 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:53:02,574 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2023-11-03 12:53:02,574 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:53:02,574 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2023-11-03 12:53:02,574 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=10, NotChecked=100, Total=272
[2023-11-03 12:53:02,621 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-11-03 12:53:02,622 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 4037 transitions, 72965 flow. Second operand  has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:53:02,622 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:53:02,622 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-11-03 12:53:02,622 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:53:42,395 INFO  L130       PetriNetUnfolder]: 29823/50776 cut-off events.
[2023-11-03 12:53:42,395 INFO  L131       PetriNetUnfolder]: For 1471610/1471630 co-relation queries the response was YES.
[2023-11-03 12:53:43,429 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 530969 conditions, 50776 events. 29823/50776 cut-off events. For 1471610/1471630 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 408296 event pairs, 2784 based on Foata normal form. 184/47868 useless extension candidates. Maximal degree in co-relation 525729. Up to 32484 conditions per place. 
[2023-11-03 12:53:43,752 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 3395 selfloop transitions, 1642 changer transitions 0/5041 dead transitions.
[2023-11-03 12:53:43,752 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 5041 transitions, 102378 flow
[2023-11-03 12:53:43,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-11-03 12:53:43,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2023-11-03 12:53:43,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1702 transitions.
[2023-11-03 12:53:43,755 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3693576388888889
[2023-11-03 12:53:43,755 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1702 transitions.
[2023-11-03 12:53:43,755 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1702 transitions.
[2023-11-03 12:53:43,756 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:53:43,756 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1702 transitions.
[2023-11-03 12:53:43,758 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 70.91666666666667) internal successors, (1702), 24 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:53:43,761 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:53:43,761 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:53:43,762 INFO  L175             Difference]: Start difference. First operand has 349 places, 4037 transitions, 72965 flow. Second operand 24 states and 1702 transitions.
[2023-11-03 12:53:43,762 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 5041 transitions, 102378 flow
[2023-11-03 12:54:21,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 5041 transitions, 100501 flow, removed 117 selfloop flow, removed 7 redundant places.
[2023-11-03 12:54:21,943 INFO  L231             Difference]: Finished difference. Result has 385 places, 4635 transitions, 91290 flow
[2023-11-03 12:54:21,946 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=71127, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4037, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=91290, PETRI_PLACES=385, PETRI_TRANSITIONS=4635}
[2023-11-03 12:54:21,946 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 328 predicate places.
[2023-11-03 12:54:21,946 INFO  L495      AbstractCegarLoop]: Abstraction has has 385 places, 4635 transitions, 91290 flow
[2023-11-03 12:54:21,947 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:54:21,947 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:54:21,947 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:54:21,956 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2023-11-03 12:54:22,147 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-11-03 12:54:22,148 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:54:22,149 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:54:22,149 INFO  L85        PathProgramCache]: Analyzing trace with hash -1956895420, now seen corresponding path program 1 times
[2023-11-03 12:54:22,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:54:22,150 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288146696]
[2023-11-03 12:54:22,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:54:22,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:54:22,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:54:22,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:54:22,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:54:22,397 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288146696]
[2023-11-03 12:54:22,397 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288146696] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:54:22,397 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978535043]
[2023-11-03 12:54:22,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:54:22,398 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:54:22,398 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:54:22,399 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:54:22,401 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2023-11-03 12:54:22,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:54:22,552 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-11-03 12:54:22,554 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:54:22,567 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:54:22,591 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:54:22,591 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:54:22,687 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:54:22,718 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:54:22,759 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:54:22,808 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:54:22,880 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:54:22,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:54:22,920 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:54:22,940 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)))) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2023-11-03 12:54:23,076 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2023-11-03 12:54:23,093 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2) 0)))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2023-11-03 12:54:23,111 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:54:23,111 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2023-11-03 12:54:23,117 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:54:23,117 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2023-11-03 12:54:23,121 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2023-11-03 12:54:23,130 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-11-03 12:54:23,131 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2023-11-03 12:54:23,136 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-11-03 12:54:23,136 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2023-11-03 12:54:23,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:54:23,173 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [978535043] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:54:23,173 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:54:23,173 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2023-11-03 12:54:23,174 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816688805]
[2023-11-03 12:54:23,174 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:54:23,174 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-03 12:54:23,174 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:54:23,174 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-03 12:54:23,175 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=404, Unknown=14, NotChecked=132, Total=650
[2023-11-03 12:54:23,394 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-11-03 12:54:23,395 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 4635 transitions, 91290 flow. Second operand  has 26 states, 26 states have (on average 49.73076923076923) internal successors, (1293), 26 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:54:23,396 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:54:23,396 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-11-03 12:54:23,396 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:55:12,324 INFO  L130       PetriNetUnfolder]: 30142/51413 cut-off events.
[2023-11-03 12:55:12,324 INFO  L131       PetriNetUnfolder]: For 1854577/1854615 co-relation queries the response was YES.
[2023-11-03 12:55:13,420 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 574702 conditions, 51413 events. 30142/51413 cut-off events. For 1854577/1854615 co-relation queries the response was YES. Maximal size of possible extension queue 1555. Compared 415600 event pairs, 2004 based on Foata normal form. 114/48419 useless extension candidates. Maximal degree in co-relation 568834. Up to 18452 conditions per place. 
[2023-11-03 12:55:13,759 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 3219 selfloop transitions, 2253 changer transitions 4/5480 dead transitions.
[2023-11-03 12:55:13,759 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 5480 transitions, 118395 flow
[2023-11-03 12:55:13,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2023-11-03 12:55:13,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2023-11-03 12:55:13,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2123 transitions.
[2023-11-03 12:55:13,762 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3252144607843137
[2023-11-03 12:55:13,763 INFO  L72            ComplementDD]: Start complementDD. Operand 34 states and 2123 transitions.
[2023-11-03 12:55:13,763 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 34 states and 2123 transitions.
[2023-11-03 12:55:13,763 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:55:13,763 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2123 transitions.
[2023-11-03 12:55:13,766 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 35 states, 34 states have (on average 62.44117647058823) internal successors, (2123), 34 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:55:13,773 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 35 states, 35 states have (on average 192.0) internal successors, (6720), 35 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:55:13,774 INFO  L81            ComplementDD]: Finished complementDD. Result  has 35 states, 35 states have (on average 192.0) internal successors, (6720), 35 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:55:13,775 INFO  L175             Difference]: Start difference. First operand has 385 places, 4635 transitions, 91290 flow. Second operand 34 states and 2123 transitions.
[2023-11-03 12:55:13,775 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 5480 transitions, 118395 flow
[2023-11-03 12:56:00,443 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 5480 transitions, 115212 flow, removed 1585 selfloop flow, removed 4 redundant places.
[2023-11-03 12:56:00,528 INFO  L231             Difference]: Finished difference. Result has 422 places, 4840 transitions, 99613 flow
[2023-11-03 12:56:00,531 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=88151, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2041, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=99613, PETRI_PLACES=422, PETRI_TRANSITIONS=4840}
[2023-11-03 12:56:00,531 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 365 predicate places.
[2023-11-03 12:56:00,531 INFO  L495      AbstractCegarLoop]: Abstraction has has 422 places, 4840 transitions, 99613 flow
[2023-11-03 12:56:00,532 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.73076923076923) internal successors, (1293), 26 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:56:00,532 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:56:00,532 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:56:00,539 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2023-11-03 12:56:00,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2023-11-03 12:56:00,734 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:56:00,734 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:56:00,735 INFO  L85        PathProgramCache]: Analyzing trace with hash 736991051, now seen corresponding path program 5 times
[2023-11-03 12:56:00,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:56:00,735 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997358222]
[2023-11-03 12:56:00,735 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:56:00,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:56:00,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:56:00,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:56:00,991 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:56:00,991 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997358222]
[2023-11-03 12:56:00,991 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997358222] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:56:00,991 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051571462]
[2023-11-03 12:56:00,992 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-11-03 12:56:00,992 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:56:00,992 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:56:00,993 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:56:00,995 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2023-11-03 12:56:01,145 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 12:56:01,146 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:56:01,147 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 42 conjunts are in the unsatisfiable core
[2023-11-03 12:56:01,151 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:56:01,163 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:56:01,191 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:56:01,191 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:56:01,270 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:56:01,331 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-03 12:56:01,347 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:56:01,393 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:56:01,435 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:56:01,488 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:56:01,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:56:01,530 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:56:01,552 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false
[2023-11-03 12:56:01,735 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false
[2023-11-03 12:56:01,761 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2023-11-03 12:56:01,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:56:01,857 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051571462] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:56:01,858 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:56:01,858 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2023-11-03 12:56:01,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944567396]
[2023-11-03 12:56:01,858 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:56:01,859 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-03 12:56:01,859 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:56:01,859 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-03 12:56:01,860 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=414, Unknown=13, NotChecked=132, Total=650
[2023-11-03 12:56:01,991 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-11-03 12:56:01,992 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 4840 transitions, 99613 flow. Second operand  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:56:01,992 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:56:01,992 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-11-03 12:56:01,993 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:56:58,179 INFO  L130       PetriNetUnfolder]: 33457/57317 cut-off events.
[2023-11-03 12:56:58,179 INFO  L131       PetriNetUnfolder]: For 2928608/2928634 co-relation queries the response was YES.
[2023-11-03 12:56:59,473 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 675531 conditions, 57317 events. 33457/57317 cut-off events. For 2928608/2928634 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 472331 event pairs, 2420 based on Foata normal form. 184/55469 useless extension candidates. Maximal degree in co-relation 669066. Up to 22990 conditions per place. 
[2023-11-03 12:56:59,906 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 3860 selfloop transitions, 2116 changer transitions 0/5980 dead transitions.
[2023-11-03 12:56:59,906 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 5980 transitions, 136763 flow
[2023-11-03 12:56:59,908 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-11-03 12:56:59,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-11-03 12:56:59,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1588 transitions.
[2023-11-03 12:56:59,910 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3308333333333333
[2023-11-03 12:56:59,910 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1588 transitions.
[2023-11-03 12:56:59,910 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1588 transitions.
[2023-11-03 12:56:59,910 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:56:59,910 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1588 transitions.
[2023-11-03 12:56:59,912 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 63.52) internal successors, (1588), 25 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:56:59,915 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:56:59,915 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:56:59,915 INFO  L175             Difference]: Start difference. First operand has 422 places, 4840 transitions, 99613 flow. Second operand 25 states and 1588 transitions.
[2023-11-03 12:56:59,915 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 5980 transitions, 136763 flow
[2023-11-03 12:58:04,576 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 5980 transitions, 134508 flow, removed 720 selfloop flow, removed 13 redundant places.
[2023-11-03 12:58:04,678 INFO  L231             Difference]: Finished difference. Result has 451 places, 5469 transitions, 123099 flow
[2023-11-03 12:58:04,682 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=97634, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1597, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=123099, PETRI_PLACES=451, PETRI_TRANSITIONS=5469}
[2023-11-03 12:58:04,682 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 394 predicate places.
[2023-11-03 12:58:04,682 INFO  L495      AbstractCegarLoop]: Abstraction has has 451 places, 5469 transitions, 123099 flow
[2023-11-03 12:58:04,683 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:58:04,683 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:58:04,683 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:58:04,689 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2023-11-03 12:58:04,883 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:58:04,884 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 12:58:04,885 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:58:04,885 INFO  L85        PathProgramCache]: Analyzing trace with hash -159175320, now seen corresponding path program 1 times
[2023-11-03 12:58:04,886 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:58:04,886 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893792876]
[2023-11-03 12:58:04,886 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:58:04,886 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:58:04,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:58:05,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:58:05,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:58:05,216 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893792876]
[2023-11-03 12:58:05,216 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893792876] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:58:05,217 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584918987]
[2023-11-03 12:58:05,217 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:58:05,217 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:58:05,217 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:58:05,219 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:58:05,220 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2023-11-03 12:58:05,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:58:05,373 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-11-03 12:58:05,376 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:58:05,380 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 12:58:05,404 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 12:58:05,404 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 12:58:05,423 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 12:58:05,434 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-03 12:58:05,442 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-03 12:58:05,449 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-03 12:58:05,458 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 12:58:05,471 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:58:05,471 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 12:58:05,489 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:58:05,490 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 12:58:05,510 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 12:58:05,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:58:05,521 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:58:05,547 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))))) is different from false
[2023-11-03 12:58:05,659 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3) |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-11-03 12:58:05,679 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3) |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-11-03 12:58:05,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-11-03 12:58:05,759 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [584918987] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:58:05,760 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:58:05,760 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14
[2023-11-03 12:58:05,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133347076]
[2023-11-03 12:58:05,760 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:58:05,760 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-11-03 12:58:05,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:58:05,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-11-03 12:58:05,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=9, NotChecked=72, Total=240
[2023-11-03 12:58:05,865 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-11-03 12:58:05,867 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 5469 transitions, 123099 flow. Second operand  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:58:05,867 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:58:05,867 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-11-03 12:58:05,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:59:07,010 INFO  L130       PetriNetUnfolder]: 33456/57201 cut-off events.
[2023-11-03 12:59:07,011 INFO  L131       PetriNetUnfolder]: For 3318944/3318972 co-relation queries the response was YES.
[2023-11-03 12:59:08,503 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 704513 conditions, 57201 events. 33456/57201 cut-off events. For 3318944/3318972 co-relation queries the response was YES. Maximal size of possible extension queue 1718. Compared 469188 event pairs, 5576 based on Foata normal form. 2/55170 useless extension candidates. Maximal degree in co-relation 703678. Up to 50485 conditions per place. 
[2023-11-03 12:59:08,894 INFO  L137   encePairwiseOnDemand]: 168/192 looper letters, 4522 selfloop transitions, 1107 changer transitions 0/5633 dead transitions.
[2023-11-03 12:59:08,894 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 5633 transitions, 137877 flow
[2023-11-03 12:59:08,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-11-03 12:59:08,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-11-03 12:59:08,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 816 transitions.
[2023-11-03 12:59:08,896 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3541666666666667
[2023-11-03 12:59:08,897 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 816 transitions.
[2023-11-03 12:59:08,897 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 816 transitions.
[2023-11-03 12:59:08,897 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:59:08,897 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 816 transitions.
[2023-11-03 12:59:08,898 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 68.0) internal successors, (816), 12 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:59:08,899 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:59:08,899 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:59:08,900 INFO  L175             Difference]: Start difference. First operand has 451 places, 5469 transitions, 123099 flow. Second operand 12 states and 816 transitions.
[2023-11-03 12:59:08,900 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 5633 transitions, 137877 flow
[2023-11-03 13:00:14,852 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 5633 transitions, 133616 flow, removed 2125 selfloop flow, removed 4 redundant places.
[2023-11-03 13:00:14,953 INFO  L231             Difference]: Finished difference. Result has 460 places, 5470 transitions, 121337 flow
[2023-11-03 13:00:14,957 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=118838, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=121337, PETRI_PLACES=460, PETRI_TRANSITIONS=5470}
[2023-11-03 13:00:14,957 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 403 predicate places.
[2023-11-03 13:00:14,958 INFO  L495      AbstractCegarLoop]: Abstraction has has 460 places, 5470 transitions, 121337 flow
[2023-11-03 13:00:14,958 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:00:14,958 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:00:14,958 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:00:14,966 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2023-11-03 13:00:15,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:00:15,160 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 13:00:15,160 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:00:15,161 INFO  L85        PathProgramCache]: Analyzing trace with hash 818731398, now seen corresponding path program 1 times
[2023-11-03 13:00:15,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:00:15,161 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330312220]
[2023-11-03 13:00:15,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:00:15,162 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:00:15,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:00:15,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:00:15,467 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:00:15,467 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330312220]
[2023-11-03 13:00:15,467 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330312220] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:00:15,468 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476781741]
[2023-11-03 13:00:15,468 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:00:15,468 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:00:15,468 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:00:15,469 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:00:15,471 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2023-11-03 13:00:15,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:00:15,619 INFO  L263         TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-11-03 13:00:15,622 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:00:15,631 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-11-03 13:00:15,672 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 13:00:15,672 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-03 13:00:15,752 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 13:00:15,785 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 13:00:15,859 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-11-03 13:00:15,875 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-11-03 13:00:15,891 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-11-03 13:00:15,908 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 13:00:15,951 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 13:00:16,008 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 13:00:16,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:00:16,052 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:00:16,076 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2023-11-03 13:00:16,096 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false
[2023-11-03 13:00:16,117 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2023-11-03 13:00:16,136 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse6 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0))))) is different from false
[2023-11-03 13:00:16,187 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= 0 (select (select (store (let ((.cse6 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2)))))) is different from false
[2023-11-03 13:00:16,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:00:16,269 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [476781741] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:00:16,270 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:00:16,270 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25
[2023-11-03 13:00:16,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029269361]
[2023-11-03 13:00:16,270 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:00:16,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-11-03 13:00:16,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:00:16,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-11-03 13:00:16,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=390, Unknown=5, NotChecked=220, Total=702
[2023-11-03 13:00:16,374 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-11-03 13:00:16,375 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 5470 transitions, 121337 flow. Second operand  has 27 states, 27 states have (on average 50.0) internal successors, (1350), 27 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:00:16,375 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:00:16,375 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-11-03 13:00:16,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
