./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-in-array-race.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --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 44aeaf855edc431e525116b12fa66fa37a231a2b904458be73e2cabf32a3a1d4
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-02-28 20:36:36,190 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 20:36:36,347 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 20:36:36,353 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-28 20:36:36,353 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-28 20:36:36,370 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 20:36:36,371 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 20:36:36,371 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 20:36:36,372 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 20:36:36,372 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 20:36:36,372 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 20:36:36,373 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 20:36:36,373 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-28 20:36:36,373 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 20:36:36,374 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 20:36:36,374 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-28 20:36:36,374 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 20:36:36,374 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 20:36:36,375 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 20:36:36,375 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 20:36:36,375 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 20:36:36,376 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 20:36:36,376 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 20:36:36,376 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-28 20:36:36,376 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-28 20:36:36,377 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 20:36:36,377 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-28 20:36:36,377 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 20:36:36,377 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 20:36:36,377 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 20:36:36,378 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 20:36:36,378 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 20:36:36,378 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 20:36:36,379 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-02-28 20:36:36,379 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 20:36:36,379 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 20:36:36,379 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-28 20:36:36,379 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 20:36:36,379 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 20:36:36,380 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 20:36:36,380 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 20:36:36,380 INFO  L153        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-pldi24/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-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> 44aeaf855edc431e525116b12fa66fa37a231a2b904458be73e2cabf32a3a1d4
[2024-02-28 20:36:36,789 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 20:36:36,839 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 20:36:36,841 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 20:36:36,842 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-02-28 20:36:36,843 INFO  L274        PluginConnector]: CDTParser initialized
[2024-02-28 20:36:36,844 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array-race.i
[2024-02-28 20:36:38,731 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 20:36:38,901 INFO  L384              CDTParser]: Found 1 translation units.
[2024-02-28 20:36:38,901 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array-race.i
[2024-02-28 20:36:38,914 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/290287adb/da3b989536574dfc9578af1ddf323f6b/FLAG4960b2a6b
[2024-02-28 20:36:38,925 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/290287adb/da3b989536574dfc9578af1ddf323f6b
[2024-02-28 20:36:38,927 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 20:36:38,928 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 20:36:38,929 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 20:36:38,929 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 20:36:38,933 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 20:36:38,934 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 08:36:38" (1/1) ...
[2024-02-28 20:36:38,935 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a588d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:38, skipping insertion in model container
[2024-02-28 20:36:38,935 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 08:36:38" (1/1) ...
[2024-02-28 20:36:39,022 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-02-28 20:36:39,313 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 20:36:39,320 INFO  L202         MainTranslator]: Completed pre-run
[2024-02-28 20:36:39,373 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 20:36:39,408 INFO  L206         MainTranslator]: Completed translation
[2024-02-28 20:36:39,408 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39 WrapperNode
[2024-02-28 20:36:39,408 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 20:36:39,409 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 20:36:39,409 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 20:36:39,410 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 20:36:39,414 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,427 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,450 INFO  L138                Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99
[2024-02-28 20:36:39,450 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 20:36:39,451 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 20:36:39,451 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 20:36:39,451 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 20:36:39,459 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,460 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,463 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,463 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,474 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,477 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,478 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,479 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,481 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 20:36:39,482 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 20:36:39,482 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 20:36:39,482 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-28 20:36:39,483 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (1/1) ...
[2024-02-28 20:36:39,488 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 20:36:39,516 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:36:39,529 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-02-28 20:36:39,536 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-02-28 20:36:39,725 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 20:36:39,725 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 20:36:39,725 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 20:36:39,726 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 20:36:39,726 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 20:36:39,726 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 20:36:39,727 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 20:36:39,727 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 20:36:39,728 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 20:36:39,728 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 20:36:39,728 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 20:36:39,776 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-02-28 20:36:40,088 INFO  L241             CfgBuilder]: Building ICFG
[2024-02-28 20:36:40,090 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 20:36:40,256 INFO  L282             CfgBuilder]: Performing block encoding
[2024-02-28 20:36:40,279 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 20:36:40,279 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 20:36:40,282 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 08:36:40 BoogieIcfgContainer
[2024-02-28 20:36:40,283 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 20:36:40,287 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 20:36:40,287 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 20:36:40,355 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-02-28 20:36:40,355 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 08:36:38" (1/3) ...
[2024-02-28 20:36:40,357 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e21b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 08:36:40, skipping insertion in model container
[2024-02-28 20:36:40,357 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:36:39" (2/3) ...
[2024-02-28 20:36:40,358 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e21b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 08:36:40, skipping insertion in model container
[2024-02-28 20:36:40,358 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 08:36:40" (3/3) ...
[2024-02-28 20:36:40,360 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array-race.i
[2024-02-28 20:36:40,368 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 20:36:40,375 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 20:36:40,375 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-02-28 20:36:40,375 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 20:36:40,439 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 20:36:40,498 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow
[2024-02-28 20:36:40,577 INFO  L124   PetriNetUnfolderBase]: 6/188 cut-off events.
[2024-02-28 20:36:40,577 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-02-28 20:36:40,581 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 193 conditions, 188 events. 6/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. 
[2024-02-28 20:36:40,581 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow
[2024-02-28 20:36:40,585 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow
[2024-02-28 20:36:40,594 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 20:36:40,600 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=LoopHeads, 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;@6bb9015c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 20:36:40,600 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-02-28 20:36:40,608 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 20:36:40,608 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-02-28 20:36:40,608 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 20:36:40,608 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:40,609 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:40,609 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 20:36:40,614 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:40,614 INFO  L85        PathProgramCache]: Analyzing trace with hash 2007966820, now seen corresponding path program 1 times
[2024-02-28 20:36:40,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:40,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253185646]
[2024-02-28 20:36:40,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:40,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:40,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:41,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:41,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:41,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253185646]
[2024-02-28 20:36:41,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253185646] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:36:41,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:36:41,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:36:41,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075627678]
[2024-02-28 20:36:41,297 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:36:41,303 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:36:41,307 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:41,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:36:41,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:36:41,657 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122
[2024-02-28 20:36:41,661 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 251 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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)
[2024-02-28 20:36:41,661 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:41,661 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122
[2024-02-28 20:36:41,662 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:41,817 INFO  L124   PetriNetUnfolderBase]: 81/497 cut-off events.
[2024-02-28 20:36:41,818 INFO  L125   PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES.
[2024-02-28 20:36:41,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 711 conditions, 497 events. 81/497 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2313 event pairs, 6 based on Foata normal form. 12/466 useless extension candidates. Maximal degree in co-relation 591. Up to 140 conditions per place. 
[2024-02-28 20:36:41,822 INFO  L140   encePairwiseOnDemand]: 102/122 looper letters, 28 selfloop transitions, 24 changer transitions 1/149 dead transitions.
[2024-02-28 20:36:41,822 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 409 flow
[2024-02-28 20:36:41,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:36:41,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:36:41,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-02-28 20:36:41,834 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-02-28 20:36:41,835 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-02-28 20:36:41,835 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-02-28 20:36:41,837 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:41,839 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-02-28 20:36:41,843 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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)
[2024-02-28 20:36:41,848 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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)
[2024-02-28 20:36:41,849 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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)
[2024-02-28 20:36:41,850 INFO  L175             Difference]: Start difference. First operand has 121 places, 122 transitions, 251 flow. Second operand 6 states and 641 transitions.
[2024-02-28 20:36:41,851 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 409 flow
[2024-02-28 20:36:41,854 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 149 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:36:41,857 INFO  L231             Difference]: Finished difference. Result has 131 places, 142 transitions, 421 flow
[2024-02-28 20:36:41,858 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=131, PETRI_TRANSITIONS=142}
[2024-02-28 20:36:41,861 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2024-02-28 20:36:41,861 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 421 flow
[2024-02-28 20:36:41,862 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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)
[2024-02-28 20:36:41,862 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:41,862 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:41,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 20:36:41,863 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 20:36:41,863 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:41,863 INFO  L85        PathProgramCache]: Analyzing trace with hash -1503278341, now seen corresponding path program 1 times
[2024-02-28 20:36:41,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:41,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103276694]
[2024-02-28 20:36:41,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:41,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:41,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:41,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:41,932 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:41,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103276694]
[2024-02-28 20:36:41,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103276694] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:36:41,933 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:36:41,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:36:41,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761028218]
[2024-02-28 20:36:41,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:36:41,934 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 20:36:41,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:41,935 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 20:36:41,935 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-02-28 20:36:41,987 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 122
[2024-02-28 20:36:41,987 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 421 flow. Second operand  has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 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)
[2024-02-28 20:36:41,988 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:41,988 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 122
[2024-02-28 20:36:41,988 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:42,069 INFO  L124   PetriNetUnfolderBase]: 59/485 cut-off events.
[2024-02-28 20:36:42,070 INFO  L125   PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES.
[2024-02-28 20:36:42,071 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 788 conditions, 485 events. 59/485 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2131 event pairs, 3 based on Foata normal form. 1/457 useless extension candidates. Maximal degree in co-relation 609. Up to 73 conditions per place. 
[2024-02-28 20:36:42,073 INFO  L140   encePairwiseOnDemand]: 114/122 looper letters, 11 selfloop transitions, 6 changer transitions 1/147 dead transitions.
[2024-02-28 20:36:42,073 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 467 flow
[2024-02-28 20:36:42,076 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:36:42,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:36:42,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions.
[2024-02-28 20:36:42,079 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.894808743169399
[2024-02-28 20:36:42,079 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 655 transitions.
[2024-02-28 20:36:42,079 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions.
[2024-02-28 20:36:42,080 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:42,080 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions.
[2024-02-28 20:36:42,083 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 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)
[2024-02-28 20:36:42,085 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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)
[2024-02-28 20:36:42,086 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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)
[2024-02-28 20:36:42,086 INFO  L175             Difference]: Start difference. First operand has 131 places, 142 transitions, 421 flow. Second operand 6 states and 655 transitions.
[2024-02-28 20:36:42,086 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 467 flow
[2024-02-28 20:36:42,090 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:36:42,092 INFO  L231             Difference]: Finished difference. Result has 139 places, 146 transitions, 463 flow
[2024-02-28 20:36:42,092 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=139, PETRI_TRANSITIONS=146}
[2024-02-28 20:36:42,093 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2024-02-28 20:36:42,093 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 146 transitions, 463 flow
[2024-02-28 20:36:42,093 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 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)
[2024-02-28 20:36:42,094 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:42,094 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:42,094 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 20:36:42,094 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 20:36:42,095 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:42,095 INFO  L85        PathProgramCache]: Analyzing trace with hash -1909485205, now seen corresponding path program 1 times
[2024-02-28 20:36:42,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:42,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714416874]
[2024-02-28 20:36:42,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:42,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:42,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:42,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:42,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:42,326 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714416874]
[2024-02-28 20:36:42,326 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714416874] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:36:42,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:36:42,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:36:42,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107925905]
[2024-02-28 20:36:42,328 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:36:42,328 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:36:42,329 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:42,329 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:36:42,330 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:36:42,531 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122
[2024-02-28 20:36:42,532 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 146 transitions, 463 flow. Second operand  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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)
[2024-02-28 20:36:42,532 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:42,532 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122
[2024-02-28 20:36:42,532 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:42,727 INFO  L124   PetriNetUnfolderBase]: 207/965 cut-off events.
[2024-02-28 20:36:42,727 INFO  L125   PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES.
[2024-02-28 20:36:42,730 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1948 conditions, 965 events. 207/965 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6039 event pairs, 9 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1815. Up to 294 conditions per place. 
[2024-02-28 20:36:42,733 INFO  L140   encePairwiseOnDemand]: 99/122 looper letters, 51 selfloop transitions, 50 changer transitions 4/206 dead transitions.
[2024-02-28 20:36:42,733 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 206 transitions, 900 flow
[2024-02-28 20:36:42,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:36:42,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:36:42,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions.
[2024-02-28 20:36:42,735 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8415300546448088
[2024-02-28 20:36:42,735 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 616 transitions.
[2024-02-28 20:36:42,735 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions.
[2024-02-28 20:36:42,736 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:42,736 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions.
[2024-02-28 20:36:42,737 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 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)
[2024-02-28 20:36:42,738 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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)
[2024-02-28 20:36:42,739 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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)
[2024-02-28 20:36:42,739 INFO  L175             Difference]: Start difference. First operand has 139 places, 146 transitions, 463 flow. Second operand 6 states and 616 transitions.
[2024-02-28 20:36:42,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 206 transitions, 900 flow
[2024-02-28 20:36:42,742 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 206 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 20:36:42,745 INFO  L231             Difference]: Finished difference. Result has 148 places, 192 transitions, 919 flow
[2024-02-28 20:36:42,745 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=148, PETRI_TRANSITIONS=192}
[2024-02-28 20:36:42,746 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places.
[2024-02-28 20:36:42,746 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 192 transitions, 919 flow
[2024-02-28 20:36:42,746 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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)
[2024-02-28 20:36:42,746 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:42,747 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:42,747 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 20:36:42,747 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 20:36:42,747 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:42,748 INFO  L85        PathProgramCache]: Analyzing trace with hash 922691411, now seen corresponding path program 1 times
[2024-02-28 20:36:42,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:42,748 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320199897]
[2024-02-28 20:36:42,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:42,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:42,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:43,036 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:43,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:43,036 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320199897]
[2024-02-28 20:36:43,037 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320199897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:36:43,037 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:36:43,037 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:36:43,037 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543976439]
[2024-02-28 20:36:43,037 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:36:43,038 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:36:43,038 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:43,039 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:36:43,039 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:36:43,124 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 122
[2024-02-28 20:36:43,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 192 transitions, 919 flow. Second operand  has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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)
[2024-02-28 20:36:43,126 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:43,126 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 122
[2024-02-28 20:36:43,126 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:43,496 INFO  L124   PetriNetUnfolderBase]: 584/1933 cut-off events.
[2024-02-28 20:36:43,496 INFO  L125   PetriNetUnfolderBase]: For 1466/1587 co-relation queries the response was YES.
[2024-02-28 20:36:43,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5118 conditions, 1933 events. 584/1933 cut-off events. For 1466/1587 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14338 event pairs, 94 based on Foata normal form. 19/1848 useless extension candidates. Maximal degree in co-relation 4876. Up to 1013 conditions per place. 
[2024-02-28 20:36:43,506 INFO  L140   encePairwiseOnDemand]: 91/122 looper letters, 98 selfloop transitions, 123 changer transitions 3/314 dead transitions.
[2024-02-28 20:36:43,506 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 314 transitions, 1919 flow
[2024-02-28 20:36:43,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:36:43,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:36:43,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-02-28 20:36:43,508 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-02-28 20:36:43,509 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-02-28 20:36:43,509 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-02-28 20:36:43,509 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:43,509 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-02-28 20:36:43,511 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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)
[2024-02-28 20:36:43,512 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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)
[2024-02-28 20:36:43,512 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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)
[2024-02-28 20:36:43,512 INFO  L175             Difference]: Start difference. First operand has 148 places, 192 transitions, 919 flow. Second operand 6 states and 641 transitions.
[2024-02-28 20:36:43,512 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 314 transitions, 1919 flow
[2024-02-28 20:36:43,521 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 314 transitions, 1907 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-02-28 20:36:43,525 INFO  L231             Difference]: Finished difference. Result has 151 places, 311 transitions, 2033 flow
[2024-02-28 20:36:43,525 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2033, PETRI_PLACES=151, PETRI_TRANSITIONS=311}
[2024-02-28 20:36:43,526 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 30 predicate places.
[2024-02-28 20:36:43,526 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 311 transitions, 2033 flow
[2024-02-28 20:36:43,526 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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)
[2024-02-28 20:36:43,526 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:43,526 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:43,527 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 20:36:43,527 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 20:36:43,527 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:43,527 INFO  L85        PathProgramCache]: Analyzing trace with hash 1414557403, now seen corresponding path program 1 times
[2024-02-28 20:36:43,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:43,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676592812]
[2024-02-28 20:36:43,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:43,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:43,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:43,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:43,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:43,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676592812]
[2024-02-28 20:36:43,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676592812] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:36:43,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091624264]
[2024-02-28 20:36:43,963 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:43,963 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:36:43,963 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:36:43,964 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:36:43,972 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-02-28 20:36:44,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:44,097 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-02-28 20:36:44,105 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:36:44,139 INFO  L378             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
[2024-02-28 20:36:44,171 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 20:36:44,172 INFO  L378             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
[2024-02-28 20:36:44,236 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8
[2024-02-28 20:36:44,241 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3
[2024-02-28 20:36:44,465 INFO  L378             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 11 treesize of output 7
[2024-02-28 20:36:44,497 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:36:44,536 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:36:44,577 INFO  L378             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 33 treesize of output 38
[2024-02-28 20:36:44,632 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:36:44,661 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:44,662 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:36:44,700 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-02-28 20:36:44,753 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 20:36:44,773 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 20:36:44,890 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9
[2024-02-28 20:36:44,895 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 4
[2024-02-28 20:36:44,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 20:36:44,899 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091624264] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:36:44,899 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:36:44,899 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 29
[2024-02-28 20:36:44,899 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405236274]
[2024-02-28 20:36:44,900 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:36:44,900 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-02-28 20:36:44,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:44,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-02-28 20:36:44,902 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=607, Unknown=3, NotChecked=156, Total=870
[2024-02-28 20:36:44,984 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 42 out of 122
[2024-02-28 20:36:44,985 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 311 transitions, 2033 flow. Second operand  has 30 states, 30 states have (on average 44.63333333333333) internal successors, (1339), 30 states have internal predecessors, (1339), 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)
[2024-02-28 20:36:44,985 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:44,985 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 122
[2024-02-28 20:36:44,986 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:47,634 INFO  L124   PetriNetUnfolderBase]: 1195/3066 cut-off events.
[2024-02-28 20:36:47,634 INFO  L125   PetriNetUnfolderBase]: For 4438/4440 co-relation queries the response was YES.
[2024-02-28 20:36:47,639 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10674 conditions, 3066 events. 1195/3066 cut-off events. For 4438/4440 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 21622 event pairs, 166 based on Foata normal form. 41/3070 useless extension candidates. Maximal degree in co-relation 10386. Up to 1033 conditions per place. 
[2024-02-28 20:36:47,649 INFO  L140   encePairwiseOnDemand]: 86/122 looper letters, 430 selfloop transitions, 177 changer transitions 54/703 dead transitions.
[2024-02-28 20:36:47,649 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 703 transitions, 5377 flow
[2024-02-28 20:36:47,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 
[2024-02-28 20:36:47,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2024-02-28 20:36:47,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1792 transitions.
[2024-02-28 20:36:47,654 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45901639344262296
[2024-02-28 20:36:47,654 INFO  L72            ComplementDD]: Start complementDD. Operand 32 states and 1792 transitions.
[2024-02-28 20:36:47,654 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 32 states and 1792 transitions.
[2024-02-28 20:36:47,655 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:47,655 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 1792 transitions.
[2024-02-28 20:36:47,659 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 33 states, 32 states have (on average 56.0) internal successors, (1792), 32 states have internal predecessors, (1792), 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)
[2024-02-28 20:36:47,665 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 33 states, 33 states have (on average 122.0) internal successors, (4026), 33 states have internal predecessors, (4026), 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)
[2024-02-28 20:36:47,666 INFO  L81            ComplementDD]: Finished complementDD. Result  has 33 states, 33 states have (on average 122.0) internal successors, (4026), 33 states have internal predecessors, (4026), 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)
[2024-02-28 20:36:47,666 INFO  L175             Difference]: Start difference. First operand has 151 places, 311 transitions, 2033 flow. Second operand 32 states and 1792 transitions.
[2024-02-28 20:36:47,666 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 703 transitions, 5377 flow
[2024-02-28 20:36:47,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 703 transitions, 5287 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-02-28 20:36:47,701 INFO  L231             Difference]: Finished difference. Result has 196 places, 386 transitions, 3207 flow
[2024-02-28 20:36:47,702 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=3207, PETRI_PLACES=196, PETRI_TRANSITIONS=386}
[2024-02-28 20:36:47,702 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 75 predicate places.
[2024-02-28 20:36:47,702 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 386 transitions, 3207 flow
[2024-02-28 20:36:47,703 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 44.63333333333333) internal successors, (1339), 30 states have internal predecessors, (1339), 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)
[2024-02-28 20:36:47,703 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:47,703 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:47,711 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-02-28 20:36:47,905 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:36:47,905 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 20:36:47,906 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:47,906 INFO  L85        PathProgramCache]: Analyzing trace with hash -122782317, now seen corresponding path program 1 times
[2024-02-28 20:36:47,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:47,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225999637]
[2024-02-28 20:36:47,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:47,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:47,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:48,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:48,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:48,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225999637]
[2024-02-28 20:36:48,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225999637] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:36:48,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934448658]
[2024-02-28 20:36:48,329 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:48,329 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:36:48,330 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:36:48,330 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:36:48,334 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-02-28 20:36:48,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:48,434 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-02-28 20:36:48,439 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:36:48,445 INFO  L378             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
[2024-02-28 20:36:48,464 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 20:36:48,465 INFO  L378             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
[2024-02-28 20:36:48,491 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8
[2024-02-28 20:36:48,600 INFO  L378             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 11 treesize of output 7
[2024-02-28 20:36:48,620 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:36:48,643 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:36:48,678 INFO  L378             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 33 treesize of output 38
[2024-02-28 20:36:48,719 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:36:48,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:48,751 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:36:48,781 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)))) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2024-02-28 20:36:48,809 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (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_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0))))) is different from false
[2024-02-28 20:36:48,833 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (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) .cse1 0)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false
[2024-02-28 20:36:48,918 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9
[2024-02-28 20:36:48,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-02-28 20:36:48,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [934448658] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:36:48,933 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:36:48,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29
[2024-02-28 20:36:48,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858816683]
[2024-02-28 20:36:48,933 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:36:48,934 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-02-28 20:36:48,934 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:48,935 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-02-28 20:36:48,935 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=607, Unknown=3, NotChecked=156, Total=870
[2024-02-28 20:36:49,031 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 122
[2024-02-28 20:36:49,033 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 386 transitions, 3207 flow. Second operand  has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 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)
[2024-02-28 20:36:49,033 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:49,033 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 122
[2024-02-28 20:36:49,033 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:50,427 INFO  L124   PetriNetUnfolderBase]: 934/2724 cut-off events.
[2024-02-28 20:36:50,428 INFO  L125   PetriNetUnfolderBase]: For 8900/8903 co-relation queries the response was YES.
[2024-02-28 20:36:50,453 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11209 conditions, 2724 events. 934/2724 cut-off events. For 8900/8903 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20165 event pairs, 111 based on Foata normal form. 25/2694 useless extension candidates. Maximal degree in co-relation 10896. Up to 1242 conditions per place. 
[2024-02-28 20:36:50,463 INFO  L140   encePairwiseOnDemand]: 107/122 looper letters, 378 selfloop transitions, 34 changer transitions 28/493 dead transitions.
[2024-02-28 20:36:50,463 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 493 transitions, 4661 flow
[2024-02-28 20:36:50,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-02-28 20:36:50,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-02-28 20:36:50,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1088 transitions.
[2024-02-28 20:36:50,466 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49544626593806923
[2024-02-28 20:36:50,466 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1088 transitions.
[2024-02-28 20:36:50,466 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1088 transitions.
[2024-02-28 20:36:50,467 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:50,467 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1088 transitions.
[2024-02-28 20:36:50,469 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 60.44444444444444) internal successors, (1088), 18 states have internal predecessors, (1088), 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)
[2024-02-28 20:36:50,471 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 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)
[2024-02-28 20:36:50,472 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 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)
[2024-02-28 20:36:50,472 INFO  L175             Difference]: Start difference. First operand has 196 places, 386 transitions, 3207 flow. Second operand 18 states and 1088 transitions.
[2024-02-28 20:36:50,472 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 493 transitions, 4661 flow
[2024-02-28 20:36:50,514 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 493 transitions, 4607 flow, removed 9 selfloop flow, removed 10 redundant places.
[2024-02-28 20:36:50,519 INFO  L231             Difference]: Finished difference. Result has 200 places, 370 transitions, 3051 flow
[2024-02-28 20:36:50,519 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3149, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3051, PETRI_PLACES=200, PETRI_TRANSITIONS=370}
[2024-02-28 20:36:50,522 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 79 predicate places.
[2024-02-28 20:36:50,524 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 370 transitions, 3051 flow
[2024-02-28 20:36:50,525 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 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)
[2024-02-28 20:36:50,526 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:50,526 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:50,530 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-02-28 20:36:50,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2024-02-28 20:36:50,731 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 20:36:50,731 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:50,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -1245590554, now seen corresponding path program 1 times
[2024-02-28 20:36:50,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:50,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585930618]
[2024-02-28 20:36:50,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:50,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:50,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:50,985 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:36:50,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:50,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585930618]
[2024-02-28 20:36:50,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585930618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:36:50,986 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:36:50,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:36:50,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926787342]
[2024-02-28 20:36:50,986 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:36:50,987 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:36:50,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:50,987 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:36:50,988 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:36:51,262 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122
[2024-02-28 20:36:51,263 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 370 transitions, 3051 flow. Second operand  has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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)
[2024-02-28 20:36:51,263 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:51,263 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122
[2024-02-28 20:36:51,263 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:51,609 INFO  L124   PetriNetUnfolderBase]: 523/1940 cut-off events.
[2024-02-28 20:36:51,609 INFO  L125   PetriNetUnfolderBase]: For 6340/6393 co-relation queries the response was YES.
[2024-02-28 20:36:51,614 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7432 conditions, 1940 events. 523/1940 cut-off events. For 6340/6393 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14900 event pairs, 42 based on Foata normal form. 5/1922 useless extension candidates. Maximal degree in co-relation 7265. Up to 477 conditions per place. 
[2024-02-28 20:36:51,621 INFO  L140   encePairwiseOnDemand]: 111/122 looper letters, 120 selfloop transitions, 37 changer transitions 15/410 dead transitions.
[2024-02-28 20:36:51,621 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 410 transitions, 3815 flow
[2024-02-28 20:36:51,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:36:51,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:36:51,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions.
[2024-02-28 20:36:51,623 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8770491803278688
[2024-02-28 20:36:51,623 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 642 transitions.
[2024-02-28 20:36:51,623 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions.
[2024-02-28 20:36:51,623 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:51,623 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions.
[2024-02-28 20:36:51,624 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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)
[2024-02-28 20:36:51,625 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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)
[2024-02-28 20:36:51,626 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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)
[2024-02-28 20:36:51,626 INFO  L175             Difference]: Start difference. First operand has 200 places, 370 transitions, 3051 flow. Second operand 6 states and 642 transitions.
[2024-02-28 20:36:51,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 410 transitions, 3815 flow
[2024-02-28 20:36:51,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 410 transitions, 3748 flow, removed 1 selfloop flow, removed 16 redundant places.
[2024-02-28 20:36:51,657 INFO  L231             Difference]: Finished difference. Result has 194 places, 395 transitions, 3496 flow
[2024-02-28 20:36:51,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=2984, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3496, PETRI_PLACES=194, PETRI_TRANSITIONS=395}
[2024-02-28 20:36:51,658 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 73 predicate places.
[2024-02-28 20:36:51,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 395 transitions, 3496 flow
[2024-02-28 20:36:51,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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)
[2024-02-28 20:36:51,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:51,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:51,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 20:36:51,659 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 20:36:51,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:51,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -2088780519, now seen corresponding path program 1 times
[2024-02-28 20:36:51,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:51,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388353614]
[2024-02-28 20:36:51,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:51,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:51,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 20:36:51,687 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 20:36:51,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 20:36:51,718 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 20:36:51,719 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 20:36:51,719 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-02-28 20:36:51,721 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-02-28 20:36:51,721 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-02-28 20:36:51,721 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-02-28 20:36:51,722 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-02-28 20:36:51,722 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-02-28 20:36:51,722 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-02-28 20:36:51,722 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-02-28 20:36:51,722 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-02-28 20:36:51,722 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 20:36:51,722 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:51,724 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 20:36:51,724 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 20:36:51,740 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 20:36:51,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow
[2024-02-28 20:36:51,761 INFO  L124   PetriNetUnfolderBase]: 11/335 cut-off events.
[2024-02-28 20:36:51,761 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-02-28 20:36:51,762 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 347 conditions, 335 events. 11/335 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 762 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 190. Up to 8 conditions per place. 
[2024-02-28 20:36:51,762 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 140 transitions, 296 flow
[2024-02-28 20:36:51,767 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 140 places, 140 transitions, 296 flow
[2024-02-28 20:36:51,768 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 20:36:51,769 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=LoopHeads, 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;@6bb9015c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 20:36:51,769 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-02-28 20:36:51,771 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 20:36:51,771 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-02-28 20:36:51,771 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 20:36:51,771 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:51,771 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:51,771 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:36:51,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:51,772 INFO  L85        PathProgramCache]: Analyzing trace with hash -649934108, now seen corresponding path program 1 times
[2024-02-28 20:36:51,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:51,772 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363337541]
[2024-02-28 20:36:51,772 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:51,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:51,779 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:51,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:51,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:51,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363337541]
[2024-02-28 20:36:51,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363337541] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:36:51,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:36:51,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:36:51,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346980680]
[2024-02-28 20:36:51,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:36:51,902 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:36:51,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:51,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:36:51,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:36:52,092 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140
[2024-02-28 20:36:52,092 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 296 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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)
[2024-02-28 20:36:52,092 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:52,092 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140
[2024-02-28 20:36:52,092 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:52,485 INFO  L124   PetriNetUnfolderBase]: 1139/4013 cut-off events.
[2024-02-28 20:36:52,485 INFO  L125   PetriNetUnfolderBase]: For 112/200 co-relation queries the response was YES.
[2024-02-28 20:36:52,489 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 4013 events. 1139/4013 cut-off events. For 112/200 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 31841 event pairs, 192 based on Foata normal form. 74/3754 useless extension candidates. Maximal degree in co-relation 2969. Up to 1538 conditions per place. 
[2024-02-28 20:36:52,499 INFO  L140   encePairwiseOnDemand]: 116/140 looper letters, 36 selfloop transitions, 43 changer transitions 1/188 dead transitions.
[2024-02-28 20:36:52,499 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 188 transitions, 558 flow
[2024-02-28 20:36:52,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:36:52,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:36:52,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions.
[2024-02-28 20:36:52,501 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8809523809523809
[2024-02-28 20:36:52,501 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 740 transitions.
[2024-02-28 20:36:52,501 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions.
[2024-02-28 20:36:52,501 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:52,501 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions.
[2024-02-28 20:36:52,502 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 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)
[2024-02-28 20:36:52,503 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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)
[2024-02-28 20:36:52,503 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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)
[2024-02-28 20:36:52,503 INFO  L175             Difference]: Start difference. First operand has 140 places, 140 transitions, 296 flow. Second operand 6 states and 740 transitions.
[2024-02-28 20:36:52,504 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 188 transitions, 558 flow
[2024-02-28 20:36:52,504 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 188 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:36:52,506 INFO  L231             Difference]: Finished difference. Result has 150 places, 179 transitions, 588 flow
[2024-02-28 20:36:52,506 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=150, PETRI_TRANSITIONS=179}
[2024-02-28 20:36:52,507 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places.
[2024-02-28 20:36:52,507 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 179 transitions, 588 flow
[2024-02-28 20:36:52,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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)
[2024-02-28 20:36:52,507 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:52,507 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:52,507 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 20:36:52,507 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:36:52,508 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:52,508 INFO  L85        PathProgramCache]: Analyzing trace with hash -1012616313, now seen corresponding path program 1 times
[2024-02-28 20:36:52,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:52,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795201976]
[2024-02-28 20:36:52,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:52,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:52,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:52,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:52,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:52,551 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795201976]
[2024-02-28 20:36:52,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795201976] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:36:52,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:36:52,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:36:52,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308988206]
[2024-02-28 20:36:52,552 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:36:52,552 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 20:36:52,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:52,552 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 20:36:52,552 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-02-28 20:36:52,614 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140
[2024-02-28 20:36:52,614 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 179 transitions, 588 flow. Second operand  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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)
[2024-02-28 20:36:52,615 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:52,615 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140
[2024-02-28 20:36:52,615 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:52,907 INFO  L124   PetriNetUnfolderBase]: 890/3527 cut-off events.
[2024-02-28 20:36:52,907 INFO  L125   PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES.
[2024-02-28 20:36:52,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6149 conditions, 3527 events. 890/3527 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28396 event pairs, 150 based on Foata normal form. 1/3305 useless extension candidates. Maximal degree in co-relation 3349. Up to 983 conditions per place. 
[2024-02-28 20:36:52,920 INFO  L140   encePairwiseOnDemand]: 132/140 looper letters, 14 selfloop transitions, 6 changer transitions 1/185 dead transitions.
[2024-02-28 20:36:52,921 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 642 flow
[2024-02-28 20:36:52,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:36:52,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:36:52,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions.
[2024-02-28 20:36:52,922 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8976190476190476
[2024-02-28 20:36:52,922 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 754 transitions.
[2024-02-28 20:36:52,923 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions.
[2024-02-28 20:36:52,923 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:52,923 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions.
[2024-02-28 20:36:52,924 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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)
[2024-02-28 20:36:52,925 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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)
[2024-02-28 20:36:52,926 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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)
[2024-02-28 20:36:52,926 INFO  L175             Difference]: Start difference. First operand has 150 places, 179 transitions, 588 flow. Second operand 6 states and 754 transitions.
[2024-02-28 20:36:52,926 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 642 flow
[2024-02-28 20:36:52,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:36:52,930 INFO  L231             Difference]: Finished difference. Result has 158 places, 184 transitions, 634 flow
[2024-02-28 20:36:52,930 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=158, PETRI_TRANSITIONS=184}
[2024-02-28 20:36:52,931 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 18 predicate places.
[2024-02-28 20:36:52,931 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 184 transitions, 634 flow
[2024-02-28 20:36:52,931 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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)
[2024-02-28 20:36:52,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:52,931 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:52,931 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 20:36:52,931 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:36:52,932 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:52,932 INFO  L85        PathProgramCache]: Analyzing trace with hash 416135915, now seen corresponding path program 1 times
[2024-02-28 20:36:52,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:52,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646762772]
[2024-02-28 20:36:52,932 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:52,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:52,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:53,069 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:53,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:53,070 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646762772]
[2024-02-28 20:36:53,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646762772] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:36:53,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:36:53,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:36:53,071 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944170230]
[2024-02-28 20:36:53,071 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:36:53,071 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:36:53,071 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:53,072 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:36:53,072 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:36:53,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140
[2024-02-28 20:36:53,284 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 184 transitions, 634 flow. Second operand  has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 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)
[2024-02-28 20:36:53,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:53,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140
[2024-02-28 20:36:53,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:54,249 INFO  L124   PetriNetUnfolderBase]: 3173/8714 cut-off events.
[2024-02-28 20:36:54,249 INFO  L125   PetriNetUnfolderBase]: For 4364/4375 co-relation queries the response was YES.
[2024-02-28 20:36:54,262 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19459 conditions, 8714 events. 3173/8714 cut-off events. For 4364/4375 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 76187 event pairs, 410 based on Foata normal form. 7/8209 useless extension candidates. Maximal degree in co-relation 19325. Up to 3775 conditions per place. 
[2024-02-28 20:36:54,284 INFO  L140   encePairwiseOnDemand]: 113/140 looper letters, 78 selfloop transitions, 104 changer transitions 4/300 dead transitions.
[2024-02-28 20:36:54,284 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 300 transitions, 1529 flow
[2024-02-28 20:36:54,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:36:54,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:36:54,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions.
[2024-02-28 20:36:54,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8511904761904762
[2024-02-28 20:36:54,286 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 715 transitions.
[2024-02-28 20:36:54,286 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions.
[2024-02-28 20:36:54,286 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:54,286 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions.
[2024-02-28 20:36:54,287 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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)
[2024-02-28 20:36:54,288 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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)
[2024-02-28 20:36:54,288 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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)
[2024-02-28 20:36:54,289 INFO  L175             Difference]: Start difference. First operand has 158 places, 184 transitions, 634 flow. Second operand 6 states and 715 transitions.
[2024-02-28 20:36:54,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 300 transitions, 1529 flow
[2024-02-28 20:36:54,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 300 transitions, 1527 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 20:36:54,297 INFO  L231             Difference]: Finished difference. Result has 167 places, 284 transitions, 1638 flow
[2024-02-28 20:36:54,298 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1638, PETRI_PLACES=167, PETRI_TRANSITIONS=284}
[2024-02-28 20:36:54,298 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 27 predicate places.
[2024-02-28 20:36:54,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 284 transitions, 1638 flow
[2024-02-28 20:36:54,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 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)
[2024-02-28 20:36:54,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:54,299 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:54,299 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 20:36:54,299 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:36:54,299 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:54,299 INFO  L85        PathProgramCache]: Analyzing trace with hash 850851919, now seen corresponding path program 1 times
[2024-02-28 20:36:54,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:54,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794200042]
[2024-02-28 20:36:54,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:54,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:54,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:54,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:54,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:54,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794200042]
[2024-02-28 20:36:54,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794200042] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:36:54,479 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:36:54,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:36:54,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085703626]
[2024-02-28 20:36:54,479 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:36:54,479 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:36:54,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:54,480 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:36:54,480 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:36:54,601 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140
[2024-02-28 20:36:54,602 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 284 transitions, 1638 flow. Second operand  has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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)
[2024-02-28 20:36:54,602 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:54,602 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140
[2024-02-28 20:36:54,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:36:56,952 INFO  L124   PetriNetUnfolderBase]: 8686/19910 cut-off events.
[2024-02-28 20:36:56,952 INFO  L125   PetriNetUnfolderBase]: For 23225/25729 co-relation queries the response was YES.
[2024-02-28 20:36:56,992 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59158 conditions, 19910 events. 8686/19910 cut-off events. For 23225/25729 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 185435 event pairs, 1598 based on Foata normal form. 69/18930 useless extension candidates. Maximal degree in co-relation 20664. Up to 11909 conditions per place. 
[2024-02-28 20:36:57,061 INFO  L140   encePairwiseOnDemand]: 105/140 looper letters, 173 selfloop transitions, 249 changer transitions 0/525 dead transitions.
[2024-02-28 20:36:57,061 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 525 transitions, 3950 flow
[2024-02-28 20:36:57,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:36:57,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:36:57,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions.
[2024-02-28 20:36:57,063 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8845238095238095
[2024-02-28 20:36:57,063 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 743 transitions.
[2024-02-28 20:36:57,063 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions.
[2024-02-28 20:36:57,064 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:36:57,064 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions.
[2024-02-28 20:36:57,065 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 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)
[2024-02-28 20:36:57,066 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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)
[2024-02-28 20:36:57,067 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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)
[2024-02-28 20:36:57,067 INFO  L175             Difference]: Start difference. First operand has 167 places, 284 transitions, 1638 flow. Second operand 6 states and 743 transitions.
[2024-02-28 20:36:57,067 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 525 transitions, 3950 flow
[2024-02-28 20:36:57,097 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 525 transitions, 3940 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-02-28 20:36:57,102 INFO  L231             Difference]: Finished difference. Result has 171 places, 517 transitions, 4284 flow
[2024-02-28 20:36:57,103 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4284, PETRI_PLACES=171, PETRI_TRANSITIONS=517}
[2024-02-28 20:36:57,103 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 31 predicate places.
[2024-02-28 20:36:57,103 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 517 transitions, 4284 flow
[2024-02-28 20:36:57,104 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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)
[2024-02-28 20:36:57,104 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:36:57,104 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:36:57,104 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-02-28 20:36:57,104 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:36:57,105 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:36:57,105 INFO  L85        PathProgramCache]: Analyzing trace with hash 455364819, now seen corresponding path program 1 times
[2024-02-28 20:36:57,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:36:57,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101285444]
[2024-02-28 20:36:57,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:57,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:36:57,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:57,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:57,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:36:57,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101285444]
[2024-02-28 20:36:57,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101285444] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:36:57,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740151549]
[2024-02-28 20:36:57,496 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:36:57,497 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:36:57,497 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:36:57,498 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:36:57,501 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-02-28 20:36:57,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:36:57,594 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjunts are in the unsatisfiable core
[2024-02-28 20:36:57,599 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:36:57,605 INFO  L378             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
[2024-02-28 20:36:57,619 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 20:36:57,619 INFO  L378             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
[2024-02-28 20:36:57,693 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8
[2024-02-28 20:36:57,697 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3
[2024-02-28 20:36:57,897 INFO  L378             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 11 treesize of output 7
[2024-02-28 20:36:57,926 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:36:57,965 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:36:58,014 INFO  L378             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 21
[2024-02-28 20:36:58,049 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:36:58,049 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:36:58,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:58,092 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:36:58,188 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (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_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-02-28 20:36:58,290 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9
[2024-02-28 20:36:58,294 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 4
[2024-02-28 20:36:58,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:36:58,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740151549] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:36:58,311 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:36:58,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 28
[2024-02-28 20:36:58,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035370923]
[2024-02-28 20:36:58,312 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:36:58,312 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-02-28 20:36:58,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:36:58,313 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-02-28 20:36:58,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=658, Unknown=6, NotChecked=52, Total=812
[2024-02-28 20:36:58,460 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 140
[2024-02-28 20:36:58,461 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 517 transitions, 4284 flow. Second operand  has 29 states, 29 states have (on average 53.724137931034484) internal successors, (1558), 29 states have internal predecessors, (1558), 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)
[2024-02-28 20:36:58,461 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:36:58,461 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 140
[2024-02-28 20:36:58,461 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:37:08,364 INFO  L124   PetriNetUnfolderBase]: 28923/54636 cut-off events.
[2024-02-28 20:37:08,364 INFO  L125   PetriNetUnfolderBase]: For 97612/97623 co-relation queries the response was YES.
[2024-02-28 20:37:08,505 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 191090 conditions, 54636 events. 28923/54636 cut-off events. For 97612/97623 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 513099 event pairs, 3533 based on Foata normal form. 365/52465 useless extension candidates. Maximal degree in co-relation 154238. Up to 22273 conditions per place. 
[2024-02-28 20:37:08,684 INFO  L140   encePairwiseOnDemand]: 100/140 looper letters, 894 selfloop transitions, 672 changer transitions 3/1620 dead transitions.
[2024-02-28 20:37:08,684 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1620 transitions, 16072 flow
[2024-02-28 20:37:08,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2024-02-28 20:37:08,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2024-02-28 20:37:08,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2291 transitions.
[2024-02-28 20:37:08,689 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4958874458874459
[2024-02-28 20:37:08,689 INFO  L72            ComplementDD]: Start complementDD. Operand 33 states and 2291 transitions.
[2024-02-28 20:37:08,689 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 33 states and 2291 transitions.
[2024-02-28 20:37:08,689 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:37:08,689 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2291 transitions.
[2024-02-28 20:37:08,692 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 34 states, 33 states have (on average 69.42424242424242) internal successors, (2291), 33 states have internal predecessors, (2291), 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)
[2024-02-28 20:37:08,696 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 34 states, 34 states have (on average 140.0) internal successors, (4760), 34 states have internal predecessors, (4760), 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)
[2024-02-28 20:37:08,697 INFO  L81            ComplementDD]: Finished complementDD. Result  has 34 states, 34 states have (on average 140.0) internal successors, (4760), 34 states have internal predecessors, (4760), 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)
[2024-02-28 20:37:08,697 INFO  L175             Difference]: Start difference. First operand has 171 places, 517 transitions, 4284 flow. Second operand 33 states and 2291 transitions.
[2024-02-28 20:37:08,697 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1620 transitions, 16072 flow
[2024-02-28 20:37:10,067 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 1620 transitions, 15982 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-02-28 20:37:10,084 INFO  L231             Difference]: Finished difference. Result has 225 places, 1106 transitions, 13135 flow
[2024-02-28 20:37:10,085 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=4194, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=13135, PETRI_PLACES=225, PETRI_TRANSITIONS=1106}
[2024-02-28 20:37:10,085 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 85 predicate places.
[2024-02-28 20:37:10,085 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 1106 transitions, 13135 flow
[2024-02-28 20:37:10,086 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 53.724137931034484) internal successors, (1558), 29 states have internal predecessors, (1558), 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)
[2024-02-28 20:37:10,086 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:37:10,086 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:37:10,092 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-02-28 20:37:10,287 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:37:10,288 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:37:10,288 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:37:10,289 INFO  L85        PathProgramCache]: Analyzing trace with hash -610760275, now seen corresponding path program 1 times
[2024-02-28 20:37:10,289 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:37:10,289 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691886889]
[2024-02-28 20:37:10,289 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:37:10,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:37:10,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:37:10,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:37:10,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:37:10,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691886889]
[2024-02-28 20:37:10,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691886889] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:37:10,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306587320]
[2024-02-28 20:37:10,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:37:10,698 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:37:10,698 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:37:10,700 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:37:10,700 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-02-28 20:37:10,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:37:10,857 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-02-28 20:37:10,860 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:37:10,865 INFO  L378             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
[2024-02-28 20:37:10,908 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 20:37:10,908 INFO  L378             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
[2024-02-28 20:37:10,981 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8
[2024-02-28 20:37:11,120 INFO  L378             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 11 treesize of output 7
[2024-02-28 20:37:11,151 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:37:11,186 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:37:11,236 INFO  L378             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 33 treesize of output 38
[2024-02-28 20:37:11,387 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:37:11,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:37:11,425 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:37:11,447 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0))) is different from false
[2024-02-28 20:37:11,594 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (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_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)))) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0))))) is different from false
[2024-02-28 20:37:11,615 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (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) .cse1 0)))) (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))))) is different from false
[2024-02-28 20:37:11,706 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9
[2024-02-28 20:37:11,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-02-28 20:37:11,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [306587320] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:37:11,730 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:37:11,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30
[2024-02-28 20:37:11,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137871151]
[2024-02-28 20:37:11,730 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:37:11,730 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-02-28 20:37:11,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:37:11,731 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-02-28 20:37:11,731 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=643, Unknown=13, NotChecked=162, Total=930
[2024-02-28 20:37:11,740 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 140
[2024-02-28 20:37:11,742 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 1106 transitions, 13135 flow. Second operand  has 31 states, 31 states have (on average 61.29032258064516) internal successors, (1900), 31 states have internal predecessors, (1900), 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)
[2024-02-28 20:37:11,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:37:11,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 140
[2024-02-28 20:37:11,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:37:25,229 INFO  L124   PetriNetUnfolderBase]: 28658/54880 cut-off events.
[2024-02-28 20:37:25,229 INFO  L125   PetriNetUnfolderBase]: For 221805/221875 co-relation queries the response was YES.
[2024-02-28 20:37:25,554 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 241407 conditions, 54880 events. 28658/54880 cut-off events. For 221805/221875 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 515398 event pairs, 3485 based on Foata normal form. 164/52343 useless extension candidates. Maximal degree in co-relation 236195. Up to 17686 conditions per place. 
[2024-02-28 20:37:25,774 INFO  L140   encePairwiseOnDemand]: 108/140 looper letters, 1158 selfloop transitions, 777 changer transitions 0/2003 dead transitions.
[2024-02-28 20:37:25,774 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2003 transitions, 25951 flow
[2024-02-28 20:37:25,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2024-02-28 20:37:25,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2024-02-28 20:37:25,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2136 transitions.
[2024-02-28 20:37:25,777 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5448979591836735
[2024-02-28 20:37:25,777 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 2136 transitions.
[2024-02-28 20:37:25,777 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 2136 transitions.
[2024-02-28 20:37:25,778 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:37:25,778 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2136 transitions.
[2024-02-28 20:37:25,780 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 29 states, 28 states have (on average 76.28571428571429) internal successors, (2136), 28 states have internal predecessors, (2136), 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)
[2024-02-28 20:37:25,783 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 29 states, 29 states have (on average 140.0) internal successors, (4060), 29 states have internal predecessors, (4060), 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)
[2024-02-28 20:37:25,784 INFO  L81            ComplementDD]: Finished complementDD. Result  has 29 states, 29 states have (on average 140.0) internal successors, (4060), 29 states have internal predecessors, (4060), 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)
[2024-02-28 20:37:25,784 INFO  L175             Difference]: Start difference. First operand has 225 places, 1106 transitions, 13135 flow. Second operand 28 states and 2136 transitions.
[2024-02-28 20:37:25,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2003 transitions, 25951 flow
[2024-02-28 20:37:31,236 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 2003 transitions, 25840 flow, removed 50 selfloop flow, removed 5 redundant places.
[2024-02-28 20:37:31,258 INFO  L231             Difference]: Finished difference. Result has 264 places, 1478 transitions, 21494 flow
[2024-02-28 20:37:31,259 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=13025, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=420, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=21494, PETRI_PLACES=264, PETRI_TRANSITIONS=1478}
[2024-02-28 20:37:31,259 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 124 predicate places.
[2024-02-28 20:37:31,260 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 1478 transitions, 21494 flow
[2024-02-28 20:37:31,261 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 61.29032258064516) internal successors, (1900), 31 states have internal predecessors, (1900), 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)
[2024-02-28 20:37:31,261 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:37:31,261 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:37:31,274 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-02-28 20:37:31,461 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-02-28 20:37:31,462 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:37:31,462 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:37:31,463 INFO  L85        PathProgramCache]: Analyzing trace with hash 418696162, now seen corresponding path program 1 times
[2024-02-28 20:37:31,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:37:31,463 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048784796]
[2024-02-28 20:37:31,463 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:37:31,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:37:31,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:37:31,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:37:31,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:37:31,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048784796]
[2024-02-28 20:37:31,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048784796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:37:31,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:37:31,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:37:31,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455348812]
[2024-02-28 20:37:31,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:37:31,685 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:37:31,685 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:37:31,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:37:31,686 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:37:31,963 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140
[2024-02-28 20:37:31,965 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1478 transitions, 21494 flow. Second operand  has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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)
[2024-02-28 20:37:31,965 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:37:31,965 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140
[2024-02-28 20:37:31,965 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:37:37,825 INFO  L124   PetriNetUnfolderBase]: 11914/27955 cut-off events.
[2024-02-28 20:37:37,825 INFO  L125   PetriNetUnfolderBase]: For 174992/176734 co-relation queries the response was YES.
[2024-02-28 20:37:37,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 136626 conditions, 27955 events. 11914/27955 cut-off events. For 174992/176734 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 273963 event pairs, 933 based on Foata normal form. 245/27280 useless extension candidates. Maximal degree in co-relation 135212. Up to 10864 conditions per place. 
[2024-02-28 20:37:38,068 INFO  L140   encePairwiseOnDemand]: 125/140 looper letters, 1122 selfloop transitions, 180 changer transitions 0/1655 dead transitions.
[2024-02-28 20:37:38,068 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1655 transitions, 26585 flow
[2024-02-28 20:37:38,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:37:38,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:37:38,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions.
[2024-02-28 20:37:38,070 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8773809523809524
[2024-02-28 20:37:38,070 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 737 transitions.
[2024-02-28 20:37:38,070 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions.
[2024-02-28 20:37:38,070 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:37:38,070 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions.
[2024-02-28 20:37:38,071 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 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)
[2024-02-28 20:37:38,072 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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)
[2024-02-28 20:37:38,072 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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)
[2024-02-28 20:37:38,072 INFO  L175             Difference]: Start difference. First operand has 264 places, 1478 transitions, 21494 flow. Second operand 6 states and 737 transitions.
[2024-02-28 20:37:38,072 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1655 transitions, 26585 flow
[2024-02-28 20:37:40,187 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1655 transitions, 26190 flow, removed 173 selfloop flow, removed 10 redundant places.
[2024-02-28 20:37:40,209 INFO  L231             Difference]: Finished difference. Result has 264 places, 1653 transitions, 24421 flow
[2024-02-28 20:37:40,210 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=21099, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24421, PETRI_PLACES=264, PETRI_TRANSITIONS=1653}
[2024-02-28 20:37:40,211 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 124 predicate places.
[2024-02-28 20:37:40,211 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 1653 transitions, 24421 flow
[2024-02-28 20:37:40,211 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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)
[2024-02-28 20:37:40,211 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:37:40,211 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:37:40,211 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-02-28 20:37:40,211 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:37:40,212 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:37:40,212 INFO  L85        PathProgramCache]: Analyzing trace with hash 1842651146, now seen corresponding path program 1 times
[2024-02-28 20:37:40,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:37:40,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428112509]
[2024-02-28 20:37:40,212 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:37:40,212 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:37:40,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:37:40,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:37:40,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:37:40,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428112509]
[2024-02-28 20:37:40,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428112509] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:37:40,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61730123]
[2024-02-28 20:37:40,637 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:37:40,637 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:37:40,638 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:37:40,639 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:37:40,640 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-02-28 20:37:40,774 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:37:40,775 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 37 conjunts are in the unsatisfiable core
[2024-02-28 20:37:40,782 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:37:41,030 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9
[2024-02-28 20:37:41,192 INFO  L378             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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:37:41,225 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:37:41,261 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:37:41,306 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:37:41,414 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:37:41,415 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:37:41,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:37:41,470 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:37:41,490 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-02-28 20:37:41,509 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (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_823 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-02-28 20:37:41,528 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (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_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 20:37:41,777 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7
[2024-02-28 20:37:41,781 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 4
[2024-02-28 20:37:41,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:37:41,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [61730123] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:37:41,851 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:37:41,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 15] total 41
[2024-02-28 20:37:41,852 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111125993]
[2024-02-28 20:37:41,852 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:37:41,852 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-02-28 20:37:41,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:37:41,853 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-02-28 20:37:41,853 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1337, Unknown=3, NotChecked=228, Total=1722
[2024-02-28 20:37:41,958 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 42 out of 140
[2024-02-28 20:37:41,959 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1653 transitions, 24421 flow. Second operand  has 42 states, 42 states have (on average 44.976190476190474) internal successors, (1889), 42 states have internal predecessors, (1889), 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)
[2024-02-28 20:37:41,959 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:37:41,959 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 140
[2024-02-28 20:37:41,959 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:38:05,913 INFO  L124   PetriNetUnfolderBase]: 37784/70498 cut-off events.
[2024-02-28 20:38:05,913 INFO  L125   PetriNetUnfolderBase]: For 431873/432125 co-relation queries the response was YES.
[2024-02-28 20:38:06,535 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 350215 conditions, 70498 events. 37784/70498 cut-off events. For 431873/432125 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 669354 event pairs, 8746 based on Foata normal form. 715/68111 useless extension candidates. Maximal degree in co-relation 346405. Up to 36035 conditions per place. 
[2024-02-28 20:38:06,837 INFO  L140   encePairwiseOnDemand]: 95/140 looper letters, 1849 selfloop transitions, 980 changer transitions 4/2889 dead transitions.
[2024-02-28 20:38:06,837 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 2889 transitions, 43546 flow
[2024-02-28 20:38:06,838 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2024-02-28 20:38:06,838 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2024-02-28 20:38:06,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2284 transitions.
[2024-02-28 20:38:06,840 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4183150183150183
[2024-02-28 20:38:06,840 INFO  L72            ComplementDD]: Start complementDD. Operand 39 states and 2284 transitions.
[2024-02-28 20:38:06,840 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 39 states and 2284 transitions.
[2024-02-28 20:38:06,841 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:38:06,841 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2284 transitions.
[2024-02-28 20:38:06,844 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 40 states, 39 states have (on average 58.56410256410256) internal successors, (2284), 39 states have internal predecessors, (2284), 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)
[2024-02-28 20:38:06,847 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 40 states, 40 states have (on average 140.0) internal successors, (5600), 40 states have internal predecessors, (5600), 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)
[2024-02-28 20:38:06,848 INFO  L81            ComplementDD]: Finished complementDD. Result  has 40 states, 40 states have (on average 140.0) internal successors, (5600), 40 states have internal predecessors, (5600), 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)
[2024-02-28 20:38:06,848 INFO  L175             Difference]: Start difference. First operand has 264 places, 1653 transitions, 24421 flow. Second operand 39 states and 2284 transitions.
[2024-02-28 20:38:06,848 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 2889 transitions, 43546 flow
[2024-02-28 20:38:18,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 2889 transitions, 43394 flow, removed 76 selfloop flow, removed 0 redundant places.
[2024-02-28 20:38:18,559 INFO  L231             Difference]: Finished difference. Result has 318 places, 2261 transitions, 37160 flow
[2024-02-28 20:38:18,559 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=24269, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1031, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=37160, PETRI_PLACES=318, PETRI_TRANSITIONS=2261}
[2024-02-28 20:38:18,560 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 178 predicate places.
[2024-02-28 20:38:18,560 INFO  L495      AbstractCegarLoop]: Abstraction has has 318 places, 2261 transitions, 37160 flow
[2024-02-28 20:38:18,560 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 44.976190476190474) internal successors, (1889), 42 states have internal predecessors, (1889), 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)
[2024-02-28 20:38:18,560 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:38:18,560 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:38:18,564 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-02-28 20:38:18,761 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:38:18,762 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:38:18,762 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:38:18,763 INFO  L85        PathProgramCache]: Analyzing trace with hash -230525786, now seen corresponding path program 1 times
[2024-02-28 20:38:18,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:38:18,763 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9650317]
[2024-02-28 20:38:18,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:38:18,763 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:38:18,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:38:19,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:38:19,112 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:38:19,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9650317]
[2024-02-28 20:38:19,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9650317] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:38:19,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12713929]
[2024-02-28 20:38:19,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:38:19,112 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:38:19,112 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:38:19,113 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:38:19,115 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-02-28 20:38:19,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:38:19,233 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-02-28 20:38:19,237 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:38:19,328 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9
[2024-02-28 20:38:19,512 INFO  L378             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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:38:19,538 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:38:19,583 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:38:19,632 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:38:19,676 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:38:19,677 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:38:19,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:38:19,710 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:38:19,729 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-02-28 20:38:19,745 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2024-02-28 20:38:19,762 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-02-28 20:38:19,928 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7
[2024-02-28 20:38:19,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:38:19,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [12713929] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:38:19,974 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:38:19,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34
[2024-02-28 20:38:19,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924290425]
[2024-02-28 20:38:19,974 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:38:19,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-02-28 20:38:19,975 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:38:19,975 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-02-28 20:38:19,975 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=877, Unknown=3, NotChecked=186, Total=1190
[2024-02-28 20:38:20,100 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 140
[2024-02-28 20:38:20,101 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 2261 transitions, 37160 flow. Second operand  has 35 states, 35 states have (on average 62.68571428571428) internal successors, (2194), 35 states have internal predecessors, (2194), 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)
[2024-02-28 20:38:20,101 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:38:20,101 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 140
[2024-02-28 20:38:20,101 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:38:48,976 INFO  L124   PetriNetUnfolderBase]: 38868/73375 cut-off events.
[2024-02-28 20:38:48,976 INFO  L125   PetriNetUnfolderBase]: For 705149/706209 co-relation queries the response was YES.
[2024-02-28 20:38:49,796 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 440260 conditions, 73375 events. 38868/73375 cut-off events. For 705149/706209 co-relation queries the response was YES. Maximal size of possible extension queue 1969. Compared 704842 event pairs, 6209 based on Foata normal form. 540/70334 useless extension candidates. Maximal degree in co-relation 436126. Up to 24634 conditions per place. 
[2024-02-28 20:38:50,127 INFO  L140   encePairwiseOnDemand]: 107/140 looper letters, 2026 selfloop transitions, 1307 changer transitions 0/3437 dead transitions.
[2024-02-28 20:38:50,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 3437 transitions, 60110 flow
[2024-02-28 20:38:50,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-02-28 20:38:50,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-02-28 20:38:50,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1680 transitions.
[2024-02-28 20:38:50,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-02-28 20:38:50,130 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1680 transitions.
[2024-02-28 20:38:50,130 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1680 transitions.
[2024-02-28 20:38:50,130 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:38:50,130 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1680 transitions.
[2024-02-28 20:38:50,132 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 80.0) internal successors, (1680), 21 states have internal predecessors, (1680), 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)
[2024-02-28 20:38:50,135 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 140.0) internal successors, (3080), 22 states have internal predecessors, (3080), 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)
[2024-02-28 20:38:50,135 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 140.0) internal successors, (3080), 22 states have internal predecessors, (3080), 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)
[2024-02-28 20:38:50,135 INFO  L175             Difference]: Start difference. First operand has 318 places, 2261 transitions, 37160 flow. Second operand 21 states and 1680 transitions.
[2024-02-28 20:38:50,135 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 3437 transitions, 60110 flow
[2024-02-28 20:39:15,522 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 3437 transitions, 59764 flow, removed 152 selfloop flow, removed 17 redundant places.
[2024-02-28 20:39:15,567 INFO  L231             Difference]: Finished difference. Result has 330 places, 2841 transitions, 52704 flow
[2024-02-28 20:39:15,569 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=36830, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=796, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=52704, PETRI_PLACES=330, PETRI_TRANSITIONS=2841}
[2024-02-28 20:39:15,569 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 190 predicate places.
[2024-02-28 20:39:15,569 INFO  L495      AbstractCegarLoop]: Abstraction has has 330 places, 2841 transitions, 52704 flow
[2024-02-28 20:39:15,569 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 62.68571428571428) internal successors, (2194), 35 states have internal predecessors, (2194), 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)
[2024-02-28 20:39:15,570 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:39:15,570 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:39:15,574 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-02-28 20:39:15,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-02-28 20:39:15,771 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:39:15,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:39:15,772 INFO  L85        PathProgramCache]: Analyzing trace with hash -1762074654, now seen corresponding path program 2 times
[2024-02-28 20:39:15,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:39:15,772 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643941629]
[2024-02-28 20:39:15,772 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:39:15,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:39:15,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:39:16,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:39:16,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:39:16,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643941629]
[2024-02-28 20:39:16,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643941629] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:39:16,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200527124]
[2024-02-28 20:39:16,207 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 20:39:16,207 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:39:16,208 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:39:16,209 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:39:16,209 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-02-28 20:39:16,361 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:39:16,361 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:39:16,362 INFO  L262         TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core
[2024-02-28 20:39:16,365 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:39:16,446 INFO  L378             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
[2024-02-28 20:39:16,482 INFO  L349             Elim1Store]: treesize reduction 20, result has 33.3 percent of original size
[2024-02-28 20:39:16,482 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16
[2024-02-28 20:39:16,504 INFO  L349             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 20:39:16,504 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14
[2024-02-28 20:39:16,546 INFO  L349             Elim1Store]: treesize reduction 16, result has 36.0 percent of original size
[2024-02-28 20:39:16,546 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18
[2024-02-28 20:39:16,642 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2024-02-28 20:39:16,936 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:39:16,943 INFO  L378             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 21 treesize of output 20
[2024-02-28 20:39:16,958 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:39:16,958 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 20:39:16,974 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:39:16,974 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 20:39:16,995 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:39:17,044 INFO  L378             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 32
[2024-02-28 20:39:17,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:39:17,053 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:39:17,221 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-02-28 20:39:17,243 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (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_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 20:39:17,263 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (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_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 20:39:17,768 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 14
[2024-02-28 20:39:17,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 20:39:17,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [200527124] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:39:17,974 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:39:17,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 19] total 42
[2024-02-28 20:39:17,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924149946]
[2024-02-28 20:39:17,974 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:39:17,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2024-02-28 20:39:17,975 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:39:17,975 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2024-02-28 20:39:17,976 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1402, Unknown=21, NotChecked=234, Total=1806
[2024-02-28 20:39:18,257 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 140
[2024-02-28 20:39:18,258 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 2841 transitions, 52704 flow. Second operand  has 43 states, 43 states have (on average 40.97674418604651) internal successors, (1762), 43 states have internal predecessors, (1762), 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)
[2024-02-28 20:39:18,258 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:39:18,258 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 140
[2024-02-28 20:39:18,258 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:40:23,715 INFO  L124   PetriNetUnfolderBase]: 63859/115055 cut-off events.
[2024-02-28 20:40:23,715 INFO  L125   PetriNetUnfolderBase]: For 1386942/1387315 co-relation queries the response was YES.
[2024-02-28 20:40:25,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 747749 conditions, 115055 events. 63859/115055 cut-off events. For 1386942/1387315 co-relation queries the response was YES. Maximal size of possible extension queue 2800. Compared 1120178 event pairs, 7461 based on Foata normal form. 1023/110835 useless extension candidates. Maximal degree in co-relation 742648. Up to 34909 conditions per place. 
[2024-02-28 20:40:25,733 INFO  L140   encePairwiseOnDemand]: 99/140 looper letters, 2689 selfloop transitions, 3564 changer transitions 2/6294 dead transitions.
[2024-02-28 20:40:25,733 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 6294 transitions, 121201 flow
[2024-02-28 20:40:25,734 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. 
[2024-02-28 20:40:25,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2024-02-28 20:40:25,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 4567 transitions.
[2024-02-28 20:40:25,738 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36653290529695026
[2024-02-28 20:40:25,738 INFO  L72            ComplementDD]: Start complementDD. Operand 89 states and 4567 transitions.
[2024-02-28 20:40:25,738 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 89 states and 4567 transitions.
[2024-02-28 20:40:25,739 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:40:25,739 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 89 states and 4567 transitions.
[2024-02-28 20:40:25,744 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 90 states, 89 states have (on average 51.31460674157304) internal successors, (4567), 89 states have internal predecessors, (4567), 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)
[2024-02-28 20:40:25,752 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 90 states, 90 states have (on average 140.0) internal successors, (12600), 90 states have internal predecessors, (12600), 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)
[2024-02-28 20:40:25,753 INFO  L81            ComplementDD]: Finished complementDD. Result  has 90 states, 90 states have (on average 140.0) internal successors, (12600), 90 states have internal predecessors, (12600), 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)
[2024-02-28 20:40:25,753 INFO  L175             Difference]: Start difference. First operand has 330 places, 2841 transitions, 52704 flow. Second operand 89 states and 4567 transitions.
[2024-02-28 20:40:25,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 6294 transitions, 121201 flow
[2024-02-28 20:41:14,548 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 6294 transitions, 121010 flow, removed 69 selfloop flow, removed 10 redundant places.
[2024-02-28 20:41:14,689 INFO  L231             Difference]: Finished difference. Result has 447 places, 4906 transitions, 107282 flow
[2024-02-28 20:41:14,691 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=52549, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1687, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1064, PETRI_DIFFERENCE_SUBTRAHEND_STATES=89, PETRI_FLOW=107282, PETRI_PLACES=447, PETRI_TRANSITIONS=4906}
[2024-02-28 20:41:14,691 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 307 predicate places.
[2024-02-28 20:41:14,691 INFO  L495      AbstractCegarLoop]: Abstraction has has 447 places, 4906 transitions, 107282 flow
[2024-02-28 20:41:14,692 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 43 states, 43 states have (on average 40.97674418604651) internal successors, (1762), 43 states have internal predecessors, (1762), 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)
[2024-02-28 20:41:14,692 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:41:14,692 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:41:14,696 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-02-28 20:41:14,896 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-02-28 20:41:14,897 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:41:14,897 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:41:14,898 INFO  L85        PathProgramCache]: Analyzing trace with hash 814328730, now seen corresponding path program 1 times
[2024-02-28 20:41:14,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:41:14,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946091248]
[2024-02-28 20:41:14,898 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:41:14,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:41:14,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:41:16,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:41:16,023 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:41:16,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946091248]
[2024-02-28 20:41:16,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946091248] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:41:16,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136007718]
[2024-02-28 20:41:16,024 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:41:16,024 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:41:16,024 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:41:16,025 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:41:16,026 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-02-28 20:41:16,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:41:16,176 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 56 conjunts are in the unsatisfiable core
[2024-02-28 20:41:16,181 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:41:16,185 INFO  L378             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
[2024-02-28 20:41:16,222 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-02-28 20:41:16,222 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-02-28 20:41:16,307 INFO  L349             Elim1Store]: treesize reduction 32, result has 45.8 percent of original size
[2024-02-28 20:41:16,307 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 33
[2024-02-28 20:41:16,362 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:41:16,368 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:41:16,369 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30
[2024-02-28 20:41:16,508 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3
[2024-02-28 20:41:16,824 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-02-28 20:41:16,824 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 62
[2024-02-28 20:41:16,851 INFO  L378             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 24 treesize of output 18
[2024-02-28 20:41:17,243 INFO  L349             Elim1Store]: treesize reduction 36, result has 29.4 percent of original size
[2024-02-28 20:41:17,244 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 63
[2024-02-28 20:41:17,520 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:41:17,520 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 50
[2024-02-28 20:41:17,576 INFO  L378             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 11 treesize of output 7
[2024-02-28 20:41:17,613 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:41:17,669 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:41:17,729 INFO  L378             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 33 treesize of output 38
[2024-02-28 20:41:17,787 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:41:17,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:41:17,831 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:41:17,848 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1158 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1158 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-02-28 20:41:17,872 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (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_1158 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-02-28 20:41:17,886 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (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_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 20:41:17,993 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) is different from false
[2024-02-28 20:41:18,000 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (not (= c_threadThread1of2ForFork0_~arg.base (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-02-28 20:41:18,003 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-02-28 20:41:18,065 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1152) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-02-28 20:41:18,084 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1152) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2024-02-28 20:41:18,185 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 4
[2024-02-28 20:41:18,457 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:41:18,458 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 241 treesize of output 144
[2024-02-28 20:41:18,468 INFO  L378             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 52 treesize of output 50
[2024-02-28 20:41:18,474 INFO  L378             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 50 treesize of output 46
[2024-02-28 20:41:18,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:41:18,755 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [136007718] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:41:18,755 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:41:18,755 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 56
[2024-02-28 20:41:18,756 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699230783]
[2024-02-28 20:41:18,756 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:41:18,756 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 57 states
[2024-02-28 20:41:18,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:41:18,758 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants.
[2024-02-28 20:41:18,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2171, Unknown=16, NotChecked=808, Total=3192
[2024-02-28 20:41:19,015 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 140
[2024-02-28 20:41:19,017 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 4906 transitions, 107282 flow. Second operand  has 57 states, 57 states have (on average 47.49122807017544) internal successors, (2707), 57 states have internal predecessors, (2707), 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)
[2024-02-28 20:41:19,017 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:41:19,018 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 140
[2024-02-28 20:41:19,018 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:43:04,444 INFO  L124   PetriNetUnfolderBase]: 65573/118257 cut-off events.
[2024-02-28 20:43:04,445 INFO  L125   PetriNetUnfolderBase]: For 2685674/2685701 co-relation queries the response was YES.
[2024-02-28 20:43:06,613 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 910800 conditions, 118257 events. 65573/118257 cut-off events. For 2685674/2685701 co-relation queries the response was YES. Maximal size of possible extension queue 2750. Compared 1139836 event pairs, 14526 based on Foata normal form. 24/112662 useless extension candidates. Maximal degree in co-relation 908006. Up to 70234 conditions per place. 
[2024-02-28 20:43:07,278 INFO  L140   encePairwiseOnDemand]: 82/140 looper letters, 5550 selfloop transitions, 861 changer transitions 221/6682 dead transitions.
[2024-02-28 20:43:07,279 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 6682 transitions, 148369 flow
[2024-02-28 20:43:07,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. 
[2024-02-28 20:43:07,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2024-02-28 20:43:07,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 3256 transitions.
[2024-02-28 20:43:07,282 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4080200501253133
[2024-02-28 20:43:07,282 INFO  L72            ComplementDD]: Start complementDD. Operand 57 states and 3256 transitions.
[2024-02-28 20:43:07,282 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 57 states and 3256 transitions.
[2024-02-28 20:43:07,283 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:43:07,283 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 3256 transitions.
[2024-02-28 20:43:07,287 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 58 states, 57 states have (on average 57.12280701754386) internal successors, (3256), 57 states have internal predecessors, (3256), 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)
[2024-02-28 20:43:07,292 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 58 states, 58 states have (on average 140.0) internal successors, (8120), 58 states have internal predecessors, (8120), 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)
[2024-02-28 20:43:07,293 INFO  L81            ComplementDD]: Finished complementDD. Result  has 58 states, 58 states have (on average 140.0) internal successors, (8120), 58 states have internal predecessors, (8120), 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)
[2024-02-28 20:43:07,293 INFO  L175             Difference]: Start difference. First operand has 447 places, 4906 transitions, 107282 flow. Second operand 57 states and 3256 transitions.
[2024-02-28 20:43:07,293 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 6682 transitions, 148369 flow
[2024-02-28 20:44:53,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 6682 transitions, 145095 flow, removed 1528 selfloop flow, removed 23 redundant places.
[2024-02-28 20:44:54,065 INFO  L231             Difference]: Finished difference. Result has 503 places, 5358 transitions, 117497 flow
[2024-02-28 20:44:54,068 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=104816, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=444, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=117497, PETRI_PLACES=503, PETRI_TRANSITIONS=5358}
[2024-02-28 20:44:54,069 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 363 predicate places.
[2024-02-28 20:44:54,069 INFO  L495      AbstractCegarLoop]: Abstraction has has 503 places, 5358 transitions, 117497 flow
[2024-02-28 20:44:54,070 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 57 states, 57 states have (on average 47.49122807017544) internal successors, (2707), 57 states have internal predecessors, (2707), 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)
[2024-02-28 20:44:54,070 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:44:54,070 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:44:54,075 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-02-28 20:44:54,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:44:54,275 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:44:54,275 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:44:54,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -1382939366, now seen corresponding path program 2 times
[2024-02-28 20:44:54,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:44:54,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619960092]
[2024-02-28 20:44:54,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:44:54,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:44:54,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:44:55,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:44:55,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:44:55,027 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619960092]
[2024-02-28 20:44:55,027 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619960092] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:44:55,027 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973009857]
[2024-02-28 20:44:55,027 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 20:44:55,027 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:44:55,027 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:44:55,028 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:44:55,030 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-02-28 20:44:55,182 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:44:55,182 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:44:55,184 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 64 conjunts are in the unsatisfiable core
[2024-02-28 20:44:55,189 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:44:55,307 INFO  L378             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
[2024-02-28 20:44:55,406 INFO  L349             Elim1Store]: treesize reduction 27, result has 25.0 percent of original size
[2024-02-28 20:44:55,407 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18
[2024-02-28 20:44:55,475 INFO  L349             Elim1Store]: treesize reduction 20, result has 39.4 percent of original size
[2024-02-28 20:44:55,475 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 20:44:55,671 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3
[2024-02-28 20:44:56,147 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-02-28 20:44:56,147 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 62
[2024-02-28 20:44:56,161 INFO  L378             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 23 treesize of output 17
[2024-02-28 20:44:56,444 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:44:56,445 INFO  L378             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 26 treesize of output 19
[2024-02-28 20:44:56,474 INFO  L378             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 11 treesize of output 7
[2024-02-28 20:44:56,543 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:44:56,620 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:44:56,700 INFO  L378             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 33 treesize of output 38
[2024-02-28 20:44:57,046 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13
[2024-02-28 20:44:57,134 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:44:57,135 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:44:57,161 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:44:57,162 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:44:57,189 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:44:57,189 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:44:57,207 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:44:57,208 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:44:57,286 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:44:57,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:44:57,334 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:44:57,355 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1279 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1279) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1279 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1279) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1279 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1279) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1279 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1279) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2024-02-28 20:45:05,985 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1278 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1278) .cse0 v_ArrVal_1279) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1278 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1278) .cse0 v_ArrVal_1279) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1278 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1278) .cse0 v_ArrVal_1279) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1278 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1278) .cse0 v_ArrVal_1279) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))))) is different from false
[2024-02-28 20:45:06,739 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:45:06,740 INFO  L378             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 42 treesize of output 58
[2024-02-28 20:45:06,747 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:45:06,747 INFO  L378             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 146 treesize of output 82
[2024-02-28 20:45:06,752 INFO  L378             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 36 treesize of output 32
[2024-02-28 20:45:06,756 INFO  L378             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 54 treesize of output 46
[2024-02-28 20:45:06,783 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 20:45:06,784 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 20:45:06,790 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 20:45:06,791 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 20:45:06,798 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 20:45:06,798 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2024-02-28 20:45:07,523 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 4
[2024-02-28 20:45:07,941 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:45:07,941 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 93
[2024-02-28 20:45:07,948 INFO  L378             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 55 treesize of output 53
[2024-02-28 20:45:08,153 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:45:08,153 INFO  L378             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 41 treesize of output 46
[2024-02-28 20:45:08,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:45:08,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [973009857] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:45:08,259 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:45:08,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26, 22] total 65
[2024-02-28 20:45:08,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981801032]
[2024-02-28 20:45:08,259 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:45:08,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 66 states
[2024-02-28 20:45:08,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:45:08,260 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants.
[2024-02-28 20:45:08,261 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=3665, Unknown=34, NotChecked=250, Total=4290
[2024-02-28 20:45:08,808 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 31 out of 140
[2024-02-28 20:45:08,809 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 5358 transitions, 117497 flow. Second operand  has 66 states, 66 states have (on average 33.45454545454545) internal successors, (2208), 66 states have internal predecessors, (2208), 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)
[2024-02-28 20:45:08,809 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:45:08,809 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 140
[2024-02-28 20:45:08,809 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:47:14,872 INFO  L124   PetriNetUnfolderBase]: 67965/121565 cut-off events.
[2024-02-28 20:47:14,872 INFO  L125   PetriNetUnfolderBase]: For 3076824/3077248 co-relation queries the response was YES.
[2024-02-28 20:47:17,546 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 974856 conditions, 121565 events. 67965/121565 cut-off events. For 3076824/3077248 co-relation queries the response was YES. Maximal size of possible extension queue 2750. Compared 1163255 event pairs, 17289 based on Foata normal form. 24/115781 useless extension candidates. Maximal degree in co-relation 974129. Up to 90782 conditions per place. 
[2024-02-28 20:47:18,269 INFO  L140   encePairwiseOnDemand]: 74/140 looper letters, 5176 selfloop transitions, 1175 changer transitions 151/6539 dead transitions.
[2024-02-28 20:47:18,269 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 6539 transitions, 147461 flow
[2024-02-28 20:47:18,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. 
[2024-02-28 20:47:18,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2024-02-28 20:47:18,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 2484 transitions.
[2024-02-28 20:47:18,273 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3168367346938776
[2024-02-28 20:47:18,273 INFO  L72            ComplementDD]: Start complementDD. Operand 56 states and 2484 transitions.
[2024-02-28 20:47:18,273 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 56 states and 2484 transitions.
[2024-02-28 20:47:18,273 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:47:18,273 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 2484 transitions.
[2024-02-28 20:47:18,276 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 57 states, 56 states have (on average 44.357142857142854) internal successors, (2484), 56 states have internal predecessors, (2484), 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)
[2024-02-28 20:47:18,280 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 57 states, 57 states have (on average 140.0) internal successors, (7980), 57 states have internal predecessors, (7980), 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)
[2024-02-28 20:47:18,281 INFO  L81            ComplementDD]: Finished complementDD. Result  has 57 states, 57 states have (on average 140.0) internal successors, (7980), 57 states have internal predecessors, (7980), 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)
[2024-02-28 20:47:18,281 INFO  L175             Difference]: Start difference. First operand has 503 places, 5358 transitions, 117497 flow. Second operand 56 states and 2484 transitions.
[2024-02-28 20:47:18,281 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 6539 transitions, 147461 flow
[2024-02-28 20:49:17,712 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 6539 transitions, 147026 flow, removed 199 selfloop flow, removed 16 redundant places.
[2024-02-28 20:49:17,817 INFO  L231             Difference]: Finished difference. Result has 559 places, 5732 transitions, 129597 flow
[2024-02-28 20:49:17,820 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=117116, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=828, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=129597, PETRI_PLACES=559, PETRI_TRANSITIONS=5732}
[2024-02-28 20:49:17,821 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 419 predicate places.
[2024-02-28 20:49:17,821 INFO  L495      AbstractCegarLoop]: Abstraction has has 559 places, 5732 transitions, 129597 flow
[2024-02-28 20:49:17,821 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 66 states, 66 states have (on average 33.45454545454545) internal successors, (2208), 66 states have internal predecessors, (2208), 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)
[2024-02-28 20:49:17,821 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:49:17,821 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:49:17,826 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-02-28 20:49:18,025 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:49:18,026 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 20:49:18,027 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:49:18,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 1058052528, now seen corresponding path program 3 times
[2024-02-28 20:49:18,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:49:18,028 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2586955]
[2024-02-28 20:49:18,028 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:49:18,028 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:49:18,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15
