./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-array-ptr.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-array-ptr.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 a71dfffe88818d957c94424c1019cae6101cc8a5c2773d983a9c3a7b7fffd642
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 05:24:10,543 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 05:24:10,583 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 05:24:10,586 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 05:24:10,587 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 05:24:10,602 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 05:24:10,602 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 05:24:10,603 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 05:24:10,603 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 05:24:10,603 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 05:24:10,604 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 05:24:10,604 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 05:24:10,604 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 05:24:10,605 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 05:24:10,605 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 05:24:10,605 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 05:24:10,605 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 05:24:10,606 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 05:24:10,606 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 05:24:10,606 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 05:24:10,606 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 05:24:10,607 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 05:24:10,607 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 05:24:10,607 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 05:24:10,608 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 05:24:10,608 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 05:24:10,608 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 05:24:10,608 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 05:24:10,608 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 05:24:10,609 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 05:24:10,609 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:24:10,609 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 05:24:10,609 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 05:24:10,609 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 05:24:10,610 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 05:24:10,610 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 05:24:10,610 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 05:24:10,610 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 05:24:10,610 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 05:24:10,610 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 05:24:10,611 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 05:24:10,611 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 -> a71dfffe88818d957c94424c1019cae6101cc8a5c2773d983a9c3a7b7fffd642
[2024-03-09 05:24:10,780 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 05:24:10,800 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 05:24:10,802 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 05:24:10,802 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 05:24:10,804 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 05:24:10,805 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2024-03-09 05:24:11,809 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 05:24:12,014 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 05:24:12,014 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2024-03-09 05:24:12,026 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/7f81f9b44/c6196739763d4857bb6f711259f428e3/FLAGaefbb3637
[2024-03-09 05:24:12,036 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/7f81f9b44/c6196739763d4857bb6f711259f428e3
[2024-03-09 05:24:12,037 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 05:24:12,038 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 05:24:12,039 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 05:24:12,039 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 05:24:12,043 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 05:24:12,044 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,044 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a333a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12, skipping insertion in model container
[2024-03-09 05:24:12,044 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,082 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 05:24:12,335 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:24:12,341 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 05:24:12,372 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:24:12,407 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 05:24:12,408 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12 WrapperNode
[2024-03-09 05:24:12,408 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 05:24:12,409 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 05:24:12,409 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 05:24:12,409 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 05:24:12,414 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,428 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,448 INFO  L138                Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99
[2024-03-09 05:24:12,448 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 05:24:12,449 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 05:24:12,449 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 05:24:12,449 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 05:24:12,475 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,478 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,483 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,484 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,493 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,495 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,496 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,497 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,499 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 05:24:12,500 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 05:24:12,500 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 05:24:12,500 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 05:24:12,501 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (1/1) ...
[2024-03-09 05:24:12,513 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:24:12,521 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:24:12,532 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-03-09 05:24:12,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-03-09 05:24:12,560 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 05:24:12,560 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 05:24:12,560 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 05:24:12,560 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 05:24:12,560 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 05:24:12,560 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 05:24:12,560 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 05:24:12,561 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 05:24:12,561 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 05:24:12,561 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 05:24:12,561 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 05:24:12,562 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 05:24:12,677 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 05:24:12,679 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 05:24:12,864 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 05:24:12,873 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 05:24:12,874 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 05:24:12,876 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:24:12 BoogieIcfgContainer
[2024-03-09 05:24:12,876 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 05:24:12,880 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 05:24:12,880 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 05:24:12,882 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 05:24:12,882 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:24:12" (1/3) ...
[2024-03-09 05:24:12,883 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2948ac19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:24:12, skipping insertion in model container
[2024-03-09 05:24:12,883 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:12" (2/3) ...
[2024-03-09 05:24:12,883 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2948ac19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:24:12, skipping insertion in model container
[2024-03-09 05:24:12,883 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:24:12" (3/3) ...
[2024-03-09 05:24:12,884 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i
[2024-03-09 05:24:12,890 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 05:24:12,897 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 05:24:12,897 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-03-09 05:24:12,897 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 05:24:12,940 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 05:24:12,964 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow
[2024-03-09 05:24:13,013 INFO  L124   PetriNetUnfolderBase]: 6/188 cut-off events.
[2024-03-09 05:24:13,013 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 05:24:13,018 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 378 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-03-09 05:24:13,018 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow
[2024-03-09 05:24:13,021 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow
[2024-03-09 05:24:13,032 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:24:13,040 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;@33e1994, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:24:13,041 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-09 05:24:13,048 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:24:13,048 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-09 05:24:13,048 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:24:13,048 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:13,049 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-03-09 05:24:13,049 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-03-09 05:24:13,053 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:13,053 INFO  L85        PathProgramCache]: Analyzing trace with hash -1959977170, now seen corresponding path program 1 times
[2024-03-09 05:24:13,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:13,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239073591]
[2024-03-09 05:24:13,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:13,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:13,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:13,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:13,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:13,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239073591]
[2024-03-09 05:24:13,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239073591] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:24:13,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:24:13,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:24:13,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179846567]
[2024-03-09 05:24:13,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:24:13,529 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:24:13,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:13,551 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:24:13,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:24:13,874 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122
[2024-03-09 05:24:13,878 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-03-09 05:24:13,878 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:13,878 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122
[2024-03-09 05:24:13,878 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:14,014 INFO  L124   PetriNetUnfolderBase]: 81/497 cut-off events.
[2024-03-09 05:24:14,015 INFO  L125   PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES.
[2024-03-09 05:24:14,016 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 2315 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-03-09 05:24:14,018 INFO  L140   encePairwiseOnDemand]: 102/122 looper letters, 28 selfloop transitions, 24 changer transitions 1/149 dead transitions.
[2024-03-09 05:24:14,019 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 409 flow
[2024-03-09 05:24:14,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:24:14,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:24:14,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-09 05:24:14,030 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-03-09 05:24:14,031 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-09 05:24:14,031 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-09 05:24:14,033 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:14,035 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-09 05:24:14,039 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-03-09 05:24:14,043 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-03-09 05:24:14,044 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-03-09 05:24:14,045 INFO  L175             Difference]: Start difference. First operand has 121 places, 122 transitions, 251 flow. Second operand 6 states and 641 transitions.
[2024-03-09 05:24:14,046 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 409 flow
[2024-03-09 05:24:14,048 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 149 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:24:14,051 INFO  L231             Difference]: Finished difference. Result has 131 places, 142 transitions, 421 flow
[2024-03-09 05:24:14,053 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-03-09 05:24:14,056 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2024-03-09 05:24:14,056 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 421 flow
[2024-03-09 05:24:14,057 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-03-09 05:24:14,057 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:14,057 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-03-09 05:24:14,057 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 05:24:14,057 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-03-09 05:24:14,058 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:14,058 INFO  L85        PathProgramCache]: Analyzing trace with hash -1181633295, now seen corresponding path program 1 times
[2024-03-09 05:24:14,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:14,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407328329]
[2024-03-09 05:24:14,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:14,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:14,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:14,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:14,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:14,125 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407328329]
[2024-03-09 05:24:14,125 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407328329] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:24:14,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:24:14,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:24:14,126 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144092679]
[2024-03-09 05:24:14,126 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:24:14,127 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:24:14,127 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:14,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:24:14,128 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:24:14,184 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 122
[2024-03-09 05:24:14,185 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-03-09 05:24:14,185 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:14,185 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 122
[2024-03-09 05:24:14,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:14,243 INFO  L124   PetriNetUnfolderBase]: 59/485 cut-off events.
[2024-03-09 05:24:14,243 INFO  L125   PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES.
[2024-03-09 05:24:14,244 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 2140 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-03-09 05:24:14,246 INFO  L140   encePairwiseOnDemand]: 114/122 looper letters, 11 selfloop transitions, 6 changer transitions 1/147 dead transitions.
[2024-03-09 05:24:14,246 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 467 flow
[2024-03-09 05:24:14,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:24:14,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:24:14,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions.
[2024-03-09 05:24:14,248 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.894808743169399
[2024-03-09 05:24:14,248 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 655 transitions.
[2024-03-09 05:24:14,248 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions.
[2024-03-09 05:24:14,248 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:14,248 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions.
[2024-03-09 05:24:14,250 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-03-09 05:24:14,251 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-03-09 05:24:14,252 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-03-09 05:24:14,252 INFO  L175             Difference]: Start difference. First operand has 131 places, 142 transitions, 421 flow. Second operand 6 states and 655 transitions.
[2024-03-09 05:24:14,252 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 467 flow
[2024-03-09 05:24:14,255 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:24:14,257 INFO  L231             Difference]: Finished difference. Result has 139 places, 146 transitions, 463 flow
[2024-03-09 05:24:14,257 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-03-09 05:24:14,258 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2024-03-09 05:24:14,258 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 146 transitions, 463 flow
[2024-03-09 05:24:14,259 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-03-09 05:24:14,259 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:14,259 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-03-09 05:24:14,259 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 05:24:14,259 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-03-09 05:24:14,260 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:14,260 INFO  L85        PathProgramCache]: Analyzing trace with hash -1309427349, now seen corresponding path program 1 times
[2024-03-09 05:24:14,260 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:14,260 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671544995]
[2024-03-09 05:24:14,260 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:14,260 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:14,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:14,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:14,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:14,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671544995]
[2024-03-09 05:24:14,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671544995] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:24:14,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:24:14,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:24:14,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44437492]
[2024-03-09 05:24:14,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:24:14,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:24:14,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:14,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:24:14,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:24:14,777 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122
[2024-03-09 05:24:14,778 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-03-09 05:24:14,778 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:14,778 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122
[2024-03-09 05:24:14,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:14,955 INFO  L124   PetriNetUnfolderBase]: 207/964 cut-off events.
[2024-03-09 05:24:14,956 INFO  L125   PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES.
[2024-03-09 05:24:14,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1947 conditions, 964 events. 207/964 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5981 event pairs, 9 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1814. Up to 294 conditions per place. 
[2024-03-09 05:24:14,961 INFO  L140   encePairwiseOnDemand]: 99/122 looper letters, 51 selfloop transitions, 50 changer transitions 4/206 dead transitions.
[2024-03-09 05:24:14,961 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 206 transitions, 900 flow
[2024-03-09 05:24:14,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:24:14,961 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:24:14,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions.
[2024-03-09 05:24:14,963 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8415300546448088
[2024-03-09 05:24:14,963 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 616 transitions.
[2024-03-09 05:24:14,963 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions.
[2024-03-09 05:24:14,963 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:14,963 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions.
[2024-03-09 05:24:14,965 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-03-09 05:24:14,966 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-03-09 05:24:14,966 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-03-09 05:24:14,967 INFO  L175             Difference]: Start difference. First operand has 139 places, 146 transitions, 463 flow. Second operand 6 states and 616 transitions.
[2024-03-09 05:24:14,967 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 206 transitions, 900 flow
[2024-03-09 05:24:14,969 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 206 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:24:14,971 INFO  L231             Difference]: Finished difference. Result has 148 places, 192 transitions, 919 flow
[2024-03-09 05:24:14,972 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-03-09 05:24:14,972 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places.
[2024-03-09 05:24:14,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 192 transitions, 919 flow
[2024-03-09 05:24:14,973 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-03-09 05:24:14,973 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:14,973 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-03-09 05:24:14,973 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 05:24:14,973 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-03-09 05:24:14,974 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:14,974 INFO  L85        PathProgramCache]: Analyzing trace with hash 892950531, now seen corresponding path program 1 times
[2024-03-09 05:24:14,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:14,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115070953]
[2024-03-09 05:24:14,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:14,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:14,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:15,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:15,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:15,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115070953]
[2024-03-09 05:24:15,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115070953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:24:15,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:24:15,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:24:15,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871596332]
[2024-03-09 05:24:15,282 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:24:15,282 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:24:15,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:15,283 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:24:15,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:24:15,388 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 122
[2024-03-09 05:24:15,389 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-03-09 05:24:15,389 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:15,389 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 122
[2024-03-09 05:24:15,389 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:15,729 INFO  L124   PetriNetUnfolderBase]: 589/1947 cut-off events.
[2024-03-09 05:24:15,730 INFO  L125   PetriNetUnfolderBase]: For 1481/1602 co-relation queries the response was YES.
[2024-03-09 05:24:15,734 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5156 conditions, 1947 events. 589/1947 cut-off events. For 1481/1602 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 14403 event pairs, 94 based on Foata normal form. 19/1861 useless extension candidates. Maximal degree in co-relation 4914. Up to 1020 conditions per place. 
[2024-03-09 05:24:15,740 INFO  L140   encePairwiseOnDemand]: 91/122 looper letters, 98 selfloop transitions, 120 changer transitions 6/314 dead transitions.
[2024-03-09 05:24:15,740 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 314 transitions, 1919 flow
[2024-03-09 05:24:15,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:24:15,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:24:15,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-09 05:24:15,742 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-03-09 05:24:15,742 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-09 05:24:15,742 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-09 05:24:15,742 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:15,742 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-09 05:24:15,744 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-03-09 05:24:15,745 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-03-09 05:24:15,745 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-03-09 05:24:15,745 INFO  L175             Difference]: Start difference. First operand has 148 places, 192 transitions, 919 flow. Second operand 6 states and 641 transitions.
[2024-03-09 05:24:15,745 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 314 transitions, 1919 flow
[2024-03-09 05:24:15,753 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 314 transitions, 1907 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 05:24:15,757 INFO  L231             Difference]: Finished difference. Result has 151 places, 308 transitions, 2003 flow
[2024-03-09 05:24:15,757 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=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2003, PETRI_PLACES=151, PETRI_TRANSITIONS=308}
[2024-03-09 05:24:15,757 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 30 predicate places.
[2024-03-09 05:24:15,758 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 308 transitions, 2003 flow
[2024-03-09 05:24:15,758 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-03-09 05:24:15,758 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:15,758 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-03-09 05:24:15,758 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 05:24:15,758 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-03-09 05:24:15,759 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:15,759 INFO  L85        PathProgramCache]: Analyzing trace with hash -1455306383, now seen corresponding path program 1 times
[2024-03-09 05:24:15,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:15,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509921822]
[2024-03-09 05:24:15,759 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:15,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:15,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:16,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:16,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:16,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509921822]
[2024-03-09 05:24:16,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509921822] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:24:16,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014645883]
[2024-03-09 05:24:16,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:16,193 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:24:16,193 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:24:16,194 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-03-09 05:24:16,198 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-03-09 05:24:16,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:16,327 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-09 05:24:16,333 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:24:16,369 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-03-09 05:24:16,386 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:24:16,387 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-03-09 05:24:16,399 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-03-09 05:24:16,433 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-03-09 05:24:16,443 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 21 treesize of output 20
[2024-03-09 05:24:16,457 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:24:16,457 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 05:24:16,550 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 34 treesize of output 25
[2024-03-09 05:24:16,564 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:24:16,564 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44
[2024-03-09 05:24:16,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:16,572 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:24:16,600 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-09 05:24:16,690 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_191 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-09 05:24:16,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 17 treesize of output 9
[2024-03-09 05:24:16,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-09 05:24:16,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014645883] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:24:16,785 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:24:16,785 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 16
[2024-03-09 05:24:16,785 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552199874]
[2024-03-09 05:24:16,785 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:24:16,785 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-03-09 05:24:16,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:16,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-03-09 05:24:16,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=176, Unknown=2, NotChecked=54, Total=272
[2024-03-09 05:24:16,787 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 122
[2024-03-09 05:24:16,788 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 308 transitions, 2003 flow. Second operand  has 17 states, 17 states have (on average 50.470588235294116) internal successors, (858), 17 states have internal predecessors, (858), 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-03-09 05:24:16,789 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:16,789 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 122
[2024-03-09 05:24:16,789 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:18,857 INFO  L124   PetriNetUnfolderBase]: 1143/2957 cut-off events.
[2024-03-09 05:24:18,857 INFO  L125   PetriNetUnfolderBase]: For 4323/4325 co-relation queries the response was YES.
[2024-03-09 05:24:18,862 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10336 conditions, 2957 events. 1143/2957 cut-off events. For 4323/4325 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20974 event pairs, 152 based on Foata normal form. 41/2956 useless extension candidates. Maximal degree in co-relation 10050. Up to 990 conditions per place. 
[2024-03-09 05:24:18,871 INFO  L140   encePairwiseOnDemand]: 87/122 looper letters, 389 selfloop transitions, 174 changer transitions 59/670 dead transitions.
[2024-03-09 05:24:18,871 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 670 transitions, 5201 flow
[2024-03-09 05:24:18,872 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-03-09 05:24:18,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-03-09 05:24:18,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1899 transitions.
[2024-03-09 05:24:18,876 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5021152829190905
[2024-03-09 05:24:18,876 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 1899 transitions.
[2024-03-09 05:24:18,876 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 1899 transitions.
[2024-03-09 05:24:18,877 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:18,877 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 1899 transitions.
[2024-03-09 05:24:18,881 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 61.25806451612903) internal successors, (1899), 31 states have internal predecessors, (1899), 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-03-09 05:24:18,885 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 122.0) internal successors, (3904), 32 states have internal predecessors, (3904), 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-03-09 05:24:18,886 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 122.0) internal successors, (3904), 32 states have internal predecessors, (3904), 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-03-09 05:24:18,886 INFO  L175             Difference]: Start difference. First operand has 151 places, 308 transitions, 2003 flow. Second operand 31 states and 1899 transitions.
[2024-03-09 05:24:18,886 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 670 transitions, 5201 flow
[2024-03-09 05:24:18,912 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 670 transitions, 5111 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-03-09 05:24:18,919 INFO  L231             Difference]: Finished difference. Result has 196 places, 384 transitions, 3189 flow
[2024-03-09 05:24:18,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3189, PETRI_PLACES=196, PETRI_TRANSITIONS=384}
[2024-03-09 05:24:18,920 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 75 predicate places.
[2024-03-09 05:24:18,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 384 transitions, 3189 flow
[2024-03-09 05:24:18,921 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 50.470588235294116) internal successors, (858), 17 states have internal predecessors, (858), 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-03-09 05:24:18,921 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:18,921 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-03-09 05:24:18,930 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-03-09 05:24:19,122 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-03-09 05:24:19,123 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-03-09 05:24:19,123 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:19,123 INFO  L85        PathProgramCache]: Analyzing trace with hash -2103578972, now seen corresponding path program 1 times
[2024-03-09 05:24:19,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:19,124 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264200436]
[2024-03-09 05:24:19,124 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:19,124 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:19,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:19,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:19,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:19,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264200436]
[2024-03-09 05:24:19,508 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264200436] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:24:19,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454243528]
[2024-03-09 05:24:19,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:19,508 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:24:19,508 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:24:19,509 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-03-09 05:24:19,512 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-03-09 05:24:19,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:19,636 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-03-09 05:24:19,642 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:24:19,650 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-03-09 05:24:19,673 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:24:19,674 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-03-09 05:24:19,715 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-03-09 05:24:19,847 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-03-09 05:24:19,873 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-03-09 05:24:19,911 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-03-09 05:24:19,956 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-03-09 05:24:19,999 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-03-09 05:24:20,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:20,026 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:24:20,044 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))) is different from false
[2024-03-09 05:24:20,070 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0))))) is different from false
[2024-03-09 05:24:20,087 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))))) is different from false
[2024-03-09 05:24:20,202 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-03-09 05:24:20,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-09 05:24:20,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454243528] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:24:20,220 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:24:20,221 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29
[2024-03-09 05:24:20,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668289488]
[2024-03-09 05:24:20,221 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:24:20,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-09 05:24:20,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:20,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-09 05:24:20,223 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=607, Unknown=3, NotChecked=156, Total=870
[2024-03-09 05:24:20,327 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 122
[2024-03-09 05:24:20,328 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 384 transitions, 3189 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-03-09 05:24:20,328 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:20,328 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 122
[2024-03-09 05:24:20,328 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:21,672 INFO  L124   PetriNetUnfolderBase]: 931/2717 cut-off events.
[2024-03-09 05:24:21,673 INFO  L125   PetriNetUnfolderBase]: For 9053/9056 co-relation queries the response was YES.
[2024-03-09 05:24:21,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11221 conditions, 2717 events. 931/2717 cut-off events. For 9053/9056 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20081 event pairs, 111 based on Foata normal form. 25/2687 useless extension candidates. Maximal degree in co-relation 10908. Up to 1242 conditions per place. 
[2024-03-09 05:24:21,688 INFO  L140   encePairwiseOnDemand]: 107/122 looper letters, 363 selfloop transitions, 31 changer transitions 44/491 dead transitions.
[2024-03-09 05:24:21,688 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 491 transitions, 4643 flow
[2024-03-09 05:24:21,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-09 05:24:21,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-09 05:24:21,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1088 transitions.
[2024-03-09 05:24:21,691 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49544626593806923
[2024-03-09 05:24:21,691 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1088 transitions.
[2024-03-09 05:24:21,691 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1088 transitions.
[2024-03-09 05:24:21,692 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:21,692 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1088 transitions.
[2024-03-09 05:24:21,694 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-03-09 05:24:21,696 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-03-09 05:24:21,696 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-03-09 05:24:21,696 INFO  L175             Difference]: Start difference. First operand has 196 places, 384 transitions, 3189 flow. Second operand 18 states and 1088 transitions.
[2024-03-09 05:24:21,697 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 491 transitions, 4643 flow
[2024-03-09 05:24:21,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 491 transitions, 4587 flow, removed 12 selfloop flow, removed 10 redundant places.
[2024-03-09 05:24:21,739 INFO  L231             Difference]: Finished difference. Result has 200 places, 352 transitions, 2847 flow
[2024-03-09 05:24:21,739 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3133, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2847, PETRI_PLACES=200, PETRI_TRANSITIONS=352}
[2024-03-09 05:24:21,740 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 79 predicate places.
[2024-03-09 05:24:21,740 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 352 transitions, 2847 flow
[2024-03-09 05:24:21,741 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-03-09 05:24:21,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:21,741 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-03-09 05:24:21,750 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-03-09 05:24:21,941 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-03-09 05:24:21,942 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-03-09 05:24:21,943 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:21,943 INFO  L85        PathProgramCache]: Analyzing trace with hash -1004989113, now seen corresponding path program 1 times
[2024-03-09 05:24:21,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:21,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624367283]
[2024-03-09 05:24:21,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:21,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:21,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:22,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 05:24:22,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:22,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624367283]
[2024-03-09 05:24:22,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624367283] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:24:22,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:24:22,197 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:24:22,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792485573]
[2024-03-09 05:24:22,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:24:22,197 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:24:22,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:22,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:24:22,198 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:24:22,454 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122
[2024-03-09 05:24:22,455 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 352 transitions, 2847 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-03-09 05:24:22,455 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:22,455 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122
[2024-03-09 05:24:22,455 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:22,693 INFO  L124   PetriNetUnfolderBase]: 503/1873 cut-off events.
[2024-03-09 05:24:22,693 INFO  L125   PetriNetUnfolderBase]: For 6030/6078 co-relation queries the response was YES.
[2024-03-09 05:24:22,698 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7167 conditions, 1873 events. 503/1873 cut-off events. For 6030/6078 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 14301 event pairs, 42 based on Foata normal form. 3/1853 useless extension candidates. Maximal degree in co-relation 7000. Up to 457 conditions per place. 
[2024-03-09 05:24:22,705 INFO  L140   encePairwiseOnDemand]: 111/122 looper letters, 109 selfloop transitions, 37 changer transitions 15/392 dead transitions.
[2024-03-09 05:24:22,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 392 transitions, 3589 flow
[2024-03-09 05:24:22,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:24:22,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:24:22,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions.
[2024-03-09 05:24:22,707 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8770491803278688
[2024-03-09 05:24:22,707 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 642 transitions.
[2024-03-09 05:24:22,707 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions.
[2024-03-09 05:24:22,708 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:22,708 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions.
[2024-03-09 05:24:22,709 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-03-09 05:24:22,710 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-03-09 05:24:22,710 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-03-09 05:24:22,710 INFO  L175             Difference]: Start difference. First operand has 200 places, 352 transitions, 2847 flow. Second operand 6 states and 642 transitions.
[2024-03-09 05:24:22,710 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 392 transitions, 3589 flow
[2024-03-09 05:24:22,739 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 392 transitions, 3510 flow, removed 10 selfloop flow, removed 17 redundant places.
[2024-03-09 05:24:22,743 INFO  L231             Difference]: Finished difference. Result has 192 places, 377 transitions, 3280 flow
[2024-03-09 05:24:22,743 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=2776, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3280, PETRI_PLACES=192, PETRI_TRANSITIONS=377}
[2024-03-09 05:24:22,744 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 71 predicate places.
[2024-03-09 05:24:22,745 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 377 transitions, 3280 flow
[2024-03-09 05:24:22,745 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-03-09 05:24:22,745 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:22,745 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-03-09 05:24:22,745 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 05:24:22,745 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-03-09 05:24:22,746 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:22,746 INFO  L85        PathProgramCache]: Analyzing trace with hash 218317082, now seen corresponding path program 1 times
[2024-03-09 05:24:22,746 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:22,746 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760404363]
[2024-03-09 05:24:22,746 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:22,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:22,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:24:22,795 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 05:24:22,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:24:22,823 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 05:24:22,823 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 05:24:22,824 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-09 05:24:22,825 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-09 05:24:22,825 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-09 05:24:22,825 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-09 05:24:22,825 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-09 05:24:22,826 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-09 05:24:22,826 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-09 05:24:22,826 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-09 05:24:22,826 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-09 05:24:22,826 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 05:24:22,826 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:24:22,828 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 05:24:22,828 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 05:24:22,841 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 05:24:22,843 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow
[2024-03-09 05:24:22,861 INFO  L124   PetriNetUnfolderBase]: 11/335 cut-off events.
[2024-03-09 05:24:22,861 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 05:24:22,862 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 756 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-03-09 05:24:22,862 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 140 transitions, 296 flow
[2024-03-09 05:24:22,863 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 140 places, 140 transitions, 296 flow
[2024-03-09 05:24:22,864 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:24:22,864 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;@33e1994, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:24:22,864 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-09 05:24:22,866 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:24:22,866 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-09 05:24:22,866 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:24:22,866 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:22,866 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-03-09 05:24:22,867 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-03-09 05:24:22,867 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:22,867 INFO  L85        PathProgramCache]: Analyzing trace with hash -322910802, now seen corresponding path program 1 times
[2024-03-09 05:24:22,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:22,867 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886556061]
[2024-03-09 05:24:22,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:22,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:22,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:22,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:22,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:22,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886556061]
[2024-03-09 05:24:22,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886556061] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:24:22,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:24:22,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:24:22,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001134368]
[2024-03-09 05:24:22,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:24:22,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:24:22,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:22,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:24:22,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:24:23,207 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140
[2024-03-09 05:24:23,208 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-03-09 05:24:23,208 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:23,208 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140
[2024-03-09 05:24:23,208 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:23,559 INFO  L124   PetriNetUnfolderBase]: 1139/4013 cut-off events.
[2024-03-09 05:24:23,560 INFO  L125   PetriNetUnfolderBase]: For 132/220 co-relation queries the response was YES.
[2024-03-09 05:24:23,563 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 4013 events. 1139/4013 cut-off events. For 132/220 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 31865 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-03-09 05:24:23,572 INFO  L140   encePairwiseOnDemand]: 116/140 looper letters, 36 selfloop transitions, 43 changer transitions 1/188 dead transitions.
[2024-03-09 05:24:23,572 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 188 transitions, 558 flow
[2024-03-09 05:24:23,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:24:23,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:24:23,573 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions.
[2024-03-09 05:24:23,574 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8809523809523809
[2024-03-09 05:24:23,574 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 740 transitions.
[2024-03-09 05:24:23,574 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions.
[2024-03-09 05:24:23,574 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:23,574 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions.
[2024-03-09 05:24:23,575 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-03-09 05:24:23,576 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-03-09 05:24:23,577 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-03-09 05:24:23,577 INFO  L175             Difference]: Start difference. First operand has 140 places, 140 transitions, 296 flow. Second operand 6 states and 740 transitions.
[2024-03-09 05:24:23,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 188 transitions, 558 flow
[2024-03-09 05:24:23,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 188 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:24:23,579 INFO  L231             Difference]: Finished difference. Result has 150 places, 179 transitions, 588 flow
[2024-03-09 05:24:23,579 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-03-09 05:24:23,580 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places.
[2024-03-09 05:24:23,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 179 transitions, 588 flow
[2024-03-09 05:24:23,580 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-03-09 05:24:23,580 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:23,580 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-03-09 05:24:23,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 05:24:23,580 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-03-09 05:24:23,580 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:23,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -690971267, now seen corresponding path program 1 times
[2024-03-09 05:24:23,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:23,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451916196]
[2024-03-09 05:24:23,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:23,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:23,588 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:23,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:23,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:23,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451916196]
[2024-03-09 05:24:23,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451916196] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:24:23,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:24:23,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:24:23,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756364773]
[2024-03-09 05:24:23,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:24:23,616 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:24:23,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:23,617 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:24:23,617 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:24:23,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140
[2024-03-09 05:24:23,669 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-03-09 05:24:23,669 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:23,669 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140
[2024-03-09 05:24:23,669 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:23,954 INFO  L124   PetriNetUnfolderBase]: 890/3527 cut-off events.
[2024-03-09 05:24:23,954 INFO  L125   PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES.
[2024-03-09 05:24:23,960 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 28451 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-03-09 05:24:23,968 INFO  L140   encePairwiseOnDemand]: 132/140 looper letters, 14 selfloop transitions, 6 changer transitions 1/185 dead transitions.
[2024-03-09 05:24:23,968 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 642 flow
[2024-03-09 05:24:23,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:24:23,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:24:23,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions.
[2024-03-09 05:24:23,970 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8976190476190476
[2024-03-09 05:24:23,970 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 754 transitions.
[2024-03-09 05:24:23,970 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions.
[2024-03-09 05:24:23,971 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:23,971 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions.
[2024-03-09 05:24:23,972 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-03-09 05:24:23,973 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-03-09 05:24:23,973 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-03-09 05:24:23,973 INFO  L175             Difference]: Start difference. First operand has 150 places, 179 transitions, 588 flow. Second operand 6 states and 754 transitions.
[2024-03-09 05:24:23,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 642 flow
[2024-03-09 05:24:23,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:24:23,978 INFO  L231             Difference]: Finished difference. Result has 158 places, 184 transitions, 634 flow
[2024-03-09 05:24:23,978 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-03-09 05:24:23,979 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 18 predicate places.
[2024-03-09 05:24:23,979 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 184 transitions, 634 flow
[2024-03-09 05:24:23,979 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-03-09 05:24:23,979 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:23,979 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-03-09 05:24:23,979 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 05:24:23,980 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-03-09 05:24:23,980 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:23,980 INFO  L85        PathProgramCache]: Analyzing trace with hash 1016193771, now seen corresponding path program 1 times
[2024-03-09 05:24:23,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:23,980 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022698930]
[2024-03-09 05:24:23,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:23,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:23,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:24,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:24,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:24,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022698930]
[2024-03-09 05:24:24,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022698930] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:24:24,112 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:24:24,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:24:24,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566749026]
[2024-03-09 05:24:24,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:24:24,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:24:24,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:24,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:24:24,113 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:24:24,310 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140
[2024-03-09 05:24:24,311 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-03-09 05:24:24,311 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:24,311 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140
[2024-03-09 05:24:24,311 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:25,171 INFO  L124   PetriNetUnfolderBase]: 3173/8712 cut-off events.
[2024-03-09 05:24:25,171 INFO  L125   PetriNetUnfolderBase]: For 4361/4372 co-relation queries the response was YES.
[2024-03-09 05:24:25,184 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19457 conditions, 8712 events. 3173/8712 cut-off events. For 4361/4372 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 76078 event pairs, 410 based on Foata normal form. 7/8207 useless extension candidates. Maximal degree in co-relation 19323. Up to 3775 conditions per place. 
[2024-03-09 05:24:25,204 INFO  L140   encePairwiseOnDemand]: 113/140 looper letters, 78 selfloop transitions, 104 changer transitions 4/300 dead transitions.
[2024-03-09 05:24:25,204 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 300 transitions, 1529 flow
[2024-03-09 05:24:25,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:24:25,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:24:25,205 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions.
[2024-03-09 05:24:25,206 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8511904761904762
[2024-03-09 05:24:25,206 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 715 transitions.
[2024-03-09 05:24:25,206 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions.
[2024-03-09 05:24:25,206 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:25,206 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions.
[2024-03-09 05:24:25,207 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-03-09 05:24:25,208 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-03-09 05:24:25,209 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-03-09 05:24:25,209 INFO  L175             Difference]: Start difference. First operand has 158 places, 184 transitions, 634 flow. Second operand 6 states and 715 transitions.
[2024-03-09 05:24:25,209 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 300 transitions, 1529 flow
[2024-03-09 05:24:25,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 300 transitions, 1527 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:24:25,217 INFO  L231             Difference]: Finished difference. Result has 167 places, 284 transitions, 1638 flow
[2024-03-09 05:24:25,217 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-03-09 05:24:25,218 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 27 predicate places.
[2024-03-09 05:24:25,218 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 284 transitions, 1638 flow
[2024-03-09 05:24:25,218 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-03-09 05:24:25,218 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:25,218 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-03-09 05:24:25,218 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 05:24:25,218 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-03-09 05:24:25,219 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:25,219 INFO  L85        PathProgramCache]: Analyzing trace with hash 821111039, now seen corresponding path program 1 times
[2024-03-09 05:24:25,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:25,219 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428671200]
[2024-03-09 05:24:25,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:25,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:25,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:25,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:25,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:25,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428671200]
[2024-03-09 05:24:25,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428671200] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:24:25,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:24:25,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:24:25,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865431528]
[2024-03-09 05:24:25,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:24:25,432 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:24:25,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:25,432 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:24:25,432 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:24:25,554 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140
[2024-03-09 05:24:25,554 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-03-09 05:24:25,555 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:25,555 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140
[2024-03-09 05:24:25,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:27,844 INFO  L124   PetriNetUnfolderBase]: 8683/19946 cut-off events.
[2024-03-09 05:24:27,845 INFO  L125   PetriNetUnfolderBase]: For 22993/25165 co-relation queries the response was YES.
[2024-03-09 05:24:27,885 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59186 conditions, 19946 events. 8683/19946 cut-off events. For 22993/25165 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 186144 event pairs, 1558 based on Foata normal form. 67/18966 useless extension candidates. Maximal degree in co-relation 20685. Up to 11899 conditions per place. 
[2024-03-09 05:24:27,947 INFO  L140   encePairwiseOnDemand]: 105/140 looper letters, 173 selfloop transitions, 249 changer transitions 0/525 dead transitions.
[2024-03-09 05:24:27,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 525 transitions, 3950 flow
[2024-03-09 05:24:27,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:24:27,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:24:27,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions.
[2024-03-09 05:24:27,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8845238095238095
[2024-03-09 05:24:27,950 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 743 transitions.
[2024-03-09 05:24:27,950 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions.
[2024-03-09 05:24:27,950 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:27,950 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions.
[2024-03-09 05:24:27,951 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-03-09 05:24:27,952 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-03-09 05:24:27,953 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-03-09 05:24:27,953 INFO  L175             Difference]: Start difference. First operand has 167 places, 284 transitions, 1638 flow. Second operand 6 states and 743 transitions.
[2024-03-09 05:24:27,953 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 525 transitions, 3950 flow
[2024-03-09 05:24:27,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 525 transitions, 3940 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-09 05:24:27,982 INFO  L231             Difference]: Finished difference. Result has 171 places, 517 transitions, 4284 flow
[2024-03-09 05:24:27,983 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-03-09 05:24:27,983 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 31 predicate places.
[2024-03-09 05:24:27,983 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 517 transitions, 4284 flow
[2024-03-09 05:24:27,983 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-03-09 05:24:27,983 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:27,984 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-03-09 05:24:27,984 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 05:24:27,984 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-03-09 05:24:27,984 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:27,984 INFO  L85        PathProgramCache]: Analyzing trace with hash -1141486319, now seen corresponding path program 1 times
[2024-03-09 05:24:27,984 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:27,984 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426010592]
[2024-03-09 05:24:27,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:27,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:27,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:28,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:28,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:28,335 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426010592]
[2024-03-09 05:24:28,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426010592] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:24:28,335 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720961054]
[2024-03-09 05:24:28,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:28,335 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:24:28,335 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:24:28,336 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-03-09 05:24:28,341 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-03-09 05:24:28,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:28,436 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-03-09 05:24:28,440 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:24:28,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-03-09 05:24:28,454 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:24:28,454 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-03-09 05:24:28,464 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-03-09 05:24:28,494 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-03-09 05:24:28,501 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 21 treesize of output 20
[2024-03-09 05:24:28,511 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:24:28,511 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 05:24:28,525 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:24:28,525 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 05:24:28,710 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-03-09 05:24:28,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:28,717 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:24:28,867 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_581 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_581 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-03-09 05:24:28,879 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-09 05:24:28,945 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-03-09 05:24:28,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-03-09 05:24:28,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720961054] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:24:28,961 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:24:28,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17
[2024-03-09 05:24:28,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084696136]
[2024-03-09 05:24:28,961 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:24:28,961 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-03-09 05:24:28,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:28,962 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-03-09 05:24:28,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=194, Unknown=7, NotChecked=58, Total=306
[2024-03-09 05:24:29,042 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 140
[2024-03-09 05:24:29,043 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 517 transitions, 4284 flow. Second operand  has 18 states, 18 states have (on average 59.388888888888886) internal successors, (1069), 18 states have internal predecessors, (1069), 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-03-09 05:24:29,043 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:29,043 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 140
[2024-03-09 05:24:29,043 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:38,070 INFO  L124   PetriNetUnfolderBase]: 27228/52265 cut-off events.
[2024-03-09 05:24:38,070 INFO  L125   PetriNetUnfolderBase]: For 91085/91123 co-relation queries the response was YES.
[2024-03-09 05:24:38,227 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 182131 conditions, 52265 events. 27228/52265 cut-off events. For 91085/91123 co-relation queries the response was YES. Maximal size of possible extension queue 1529. Compared 494039 event pairs, 5283 based on Foata normal form. 385/50017 useless extension candidates. Maximal degree in co-relation 112119. Up to 20651 conditions per place. 
[2024-03-09 05:24:38,413 INFO  L140   encePairwiseOnDemand]: 101/140 looper letters, 845 selfloop transitions, 656 changer transitions 1/1560 dead transitions.
[2024-03-09 05:24:38,413 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 1560 transitions, 15676 flow
[2024-03-09 05:24:38,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-09 05:24:38,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-09 05:24:38,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2263 transitions.
[2024-03-09 05:24:38,418 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5388095238095238
[2024-03-09 05:24:38,418 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 2263 transitions.
[2024-03-09 05:24:38,418 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 2263 transitions.
[2024-03-09 05:24:38,419 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:38,419 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2263 transitions.
[2024-03-09 05:24:38,422 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 75.43333333333334) internal successors, (2263), 30 states have internal predecessors, (2263), 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-03-09 05:24:38,426 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 states have internal predecessors, (4340), 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-03-09 05:24:38,427 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 states have internal predecessors, (4340), 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-03-09 05:24:38,427 INFO  L175             Difference]: Start difference. First operand has 171 places, 517 transitions, 4284 flow. Second operand 30 states and 2263 transitions.
[2024-03-09 05:24:38,427 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 1560 transitions, 15676 flow
[2024-03-09 05:24:39,383 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 1560 transitions, 15586 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-03-09 05:24:39,398 INFO  L231             Difference]: Finished difference. Result has 221 places, 1091 transitions, 12942 flow
[2024-03-09 05:24:39,398 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=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=12942, PETRI_PLACES=221, PETRI_TRANSITIONS=1091}
[2024-03-09 05:24:39,399 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 81 predicate places.
[2024-03-09 05:24:39,399 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 1091 transitions, 12942 flow
[2024-03-09 05:24:39,399 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 59.388888888888886) internal successors, (1069), 18 states have internal predecessors, (1069), 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-03-09 05:24:39,399 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:39,400 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-03-09 05:24:39,406 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-03-09 05:24:39,600 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-03-09 05:24:39,601 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-03-09 05:24:39,601 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:24:39,602 INFO  L85        PathProgramCache]: Analyzing trace with hash 1815561820, now seen corresponding path program 1 times
[2024-03-09 05:24:39,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:24:39,602 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948671727]
[2024-03-09 05:24:39,602 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:39,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:24:39,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:40,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:40,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:24:40,036 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948671727]
[2024-03-09 05:24:40,036 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948671727] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:24:40,036 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803307140]
[2024-03-09 05:24:40,036 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:24:40,036 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:24:40,036 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:24:40,038 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-03-09 05:24:40,039 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-03-09 05:24:40,179 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:24:40,181 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-03-09 05:24:40,184 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:24:40,188 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-03-09 05:24:40,215 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:24:40,215 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-03-09 05:24:40,261 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-03-09 05:24:40,420 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-03-09 05:24:40,454 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-03-09 05:24:40,495 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-03-09 05:24:40,539 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-03-09 05:24:40,593 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-03-09 05:24:40,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:24:40,635 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:24:40,662 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)))) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))) is different from false
[2024-03-09 05:24:40,683 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0))))) is different from false
[2024-03-09 05:24:40,705 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))) is different from false
[2024-03-09 05:24:40,725 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse3 0) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse3) 0))))) is different from false
[2024-03-09 05:24:40,748 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:24:40,749 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 35 treesize of output 51
[2024-03-09 05:24:40,756 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:24:40,756 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 64 treesize of output 36
[2024-03-09 05:24:40,761 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 7 treesize of output 3
[2024-03-09 05:24:40,771 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:24:40,771 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-09 05:24:40,787 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:24:40,788 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 05:24:40,794 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:24:40,794 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 05:24:40,861 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-03-09 05:24:40,884 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-09 05:24:40,884 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [803307140] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:24:40,885 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:24:40,885 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30
[2024-03-09 05:24:40,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203321404]
[2024-03-09 05:24:40,885 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:24:40,885 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-03-09 05:24:40,885 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:24:40,886 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-03-09 05:24:40,886 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=608, Unknown=4, NotChecked=212, Total=930
[2024-03-09 05:24:40,887 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 140
[2024-03-09 05:24:40,888 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 1091 transitions, 12942 flow. Second operand  has 31 states, 31 states have (on average 61.25806451612903) internal successors, (1899), 31 states have internal predecessors, (1899), 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-03-09 05:24:40,888 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:24:40,888 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 140
[2024-03-09 05:24:40,888 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:24:54,508 INFO  L124   PetriNetUnfolderBase]: 28476/54140 cut-off events.
[2024-03-09 05:24:54,508 INFO  L125   PetriNetUnfolderBase]: For 207290/207330 co-relation queries the response was YES.
[2024-03-09 05:24:54,849 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 237951 conditions, 54140 events. 28476/54140 cut-off events. For 207290/207330 co-relation queries the response was YES. Maximal size of possible extension queue 1514. Compared 506020 event pairs, 3724 based on Foata normal form. 254/51628 useless extension candidates. Maximal degree in co-relation 218428. Up to 15909 conditions per place. 
[2024-03-09 05:24:55,066 INFO  L140   encePairwiseOnDemand]: 112/140 looper letters, 1315 selfloop transitions, 813 changer transitions 0/2195 dead transitions.
[2024-03-09 05:24:55,066 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 2195 transitions, 27897 flow
[2024-03-09 05:24:55,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-09 05:24:55,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-09 05:24:55,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2293 transitions.
[2024-03-09 05:24:55,069 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.545952380952381
[2024-03-09 05:24:55,070 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 2293 transitions.
[2024-03-09 05:24:55,070 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 2293 transitions.
[2024-03-09 05:24:55,070 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:24:55,070 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2293 transitions.
[2024-03-09 05:24:55,073 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 76.43333333333334) internal successors, (2293), 30 states have internal predecessors, (2293), 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-03-09 05:24:55,076 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 states have internal predecessors, (4340), 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-03-09 05:24:55,077 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 states have internal predecessors, (4340), 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-03-09 05:24:55,077 INFO  L175             Difference]: Start difference. First operand has 221 places, 1091 transitions, 12942 flow. Second operand 30 states and 2293 transitions.
[2024-03-09 05:24:55,077 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 2195 transitions, 27897 flow
[2024-03-09 05:24:59,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 2195 transitions, 27844 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-03-09 05:24:59,867 INFO  L231             Difference]: Finished difference. Result has 262 places, 1505 transitions, 21409 flow
[2024-03-09 05:24:59,868 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=12890, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1091, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=467, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=21409, PETRI_PLACES=262, PETRI_TRANSITIONS=1505}
[2024-03-09 05:24:59,868 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 122 predicate places.
[2024-03-09 05:24:59,868 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 1505 transitions, 21409 flow
[2024-03-09 05:24:59,869 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 61.25806451612903) internal successors, (1899), 31 states have internal predecessors, (1899), 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-03-09 05:24:59,869 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:24:59,869 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-03-09 05:24:59,877 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-09 05:25:00,070 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-03-09 05:25:00,071 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-03-09 05:25:00,071 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:25:00,071 INFO  L85        PathProgramCache]: Analyzing trace with hash 659297603, now seen corresponding path program 1 times
[2024-03-09 05:25:00,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:25:00,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262898760]
[2024-03-09 05:25:00,072 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:25:00,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:25:00,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:25:00,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 05:25:00,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:25:00,247 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262898760]
[2024-03-09 05:25:00,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262898760] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:25:00,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:25:00,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:25:00,247 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360511507]
[2024-03-09 05:25:00,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:25:00,248 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:25:00,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:25:00,248 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:25:00,248 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:25:00,517 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140
[2024-03-09 05:25:00,517 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 1505 transitions, 21409 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-03-09 05:25:00,517 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:25:00,517 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140
[2024-03-09 05:25:00,517 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:25:06,276 INFO  L124   PetriNetUnfolderBase]: 11991/27683 cut-off events.
[2024-03-09 05:25:06,276 INFO  L125   PetriNetUnfolderBase]: For 159275/161056 co-relation queries the response was YES.
[2024-03-09 05:25:06,522 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 135197 conditions, 27683 events. 11991/27683 cut-off events. For 159275/161056 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 268530 event pairs, 909 based on Foata normal form. 202/26990 useless extension candidates. Maximal degree in co-relation 134196. Up to 10801 conditions per place. 
[2024-03-09 05:25:06,648 INFO  L140   encePairwiseOnDemand]: 125/140 looper letters, 1119 selfloop transitions, 180 changer transitions 0/1682 dead transitions.
[2024-03-09 05:25:06,648 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1682 transitions, 26422 flow
[2024-03-09 05:25:06,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:25:06,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:25:06,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions.
[2024-03-09 05:25:06,650 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8773809523809524
[2024-03-09 05:25:06,650 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 737 transitions.
[2024-03-09 05:25:06,650 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions.
[2024-03-09 05:25:06,650 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:25:06,650 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions.
[2024-03-09 05:25:06,651 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-03-09 05:25:06,652 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-03-09 05:25:06,652 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-03-09 05:25:06,652 INFO  L175             Difference]: Start difference. First operand has 262 places, 1505 transitions, 21409 flow. Second operand 6 states and 737 transitions.
[2024-03-09 05:25:06,652 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 1682 transitions, 26422 flow
[2024-03-09 05:25:08,515 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1682 transitions, 26214 flow, removed 82 selfloop flow, removed 10 redundant places.
[2024-03-09 05:25:08,537 INFO  L231             Difference]: Finished difference. Result has 262 places, 1680 transitions, 24451 flow
[2024-03-09 05:25:08,537 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=21201, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24451, PETRI_PLACES=262, PETRI_TRANSITIONS=1680}
[2024-03-09 05:25:08,538 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 122 predicate places.
[2024-03-09 05:25:08,538 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 1680 transitions, 24451 flow
[2024-03-09 05:25:08,538 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-03-09 05:25:08,539 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:25:08,539 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-03-09 05:25:08,539 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 05:25:08,539 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-03-09 05:25:08,539 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:25:08,539 INFO  L85        PathProgramCache]: Analyzing trace with hash -1958351319, now seen corresponding path program 1 times
[2024-03-09 05:25:08,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:25:08,539 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321625299]
[2024-03-09 05:25:08,539 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:25:08,539 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:25:08,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:25:08,879 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:25:08,879 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:25:08,879 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321625299]
[2024-03-09 05:25:08,880 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321625299] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:25:08,880 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599262252]
[2024-03-09 05:25:08,880 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:25:08,880 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:25:08,880 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:25:08,881 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-03-09 05:25:08,882 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-03-09 05:25:08,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:25:08,973 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 21 conjunts are in the unsatisfiable core
[2024-03-09 05:25:08,987 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:25:09,059 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-03-09 05:25:09,164 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-03-09 05:25:09,197 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 05:25:09,235 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:25:09,235 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 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 05:25:09,284 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:25:09,285 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44
[2024-03-09 05:25:09,328 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:25:09,329 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-03-09 05:25:09,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:25:09,337 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:25:09,358 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-09 05:25:09,373 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-03-09 05:25:09,390 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-09 05:25:09,594 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-03-09 05:25:09,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:25:09,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [599262252] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:25:09,655 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:25:09,656 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32
[2024-03-09 05:25:09,656 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888627293]
[2024-03-09 05:25:09,657 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:25:09,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2024-03-09 05:25:09,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:25:09,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2024-03-09 05:25:09,661 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=763, Unknown=3, NotChecked=174, Total=1056
[2024-03-09 05:25:09,861 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 140
[2024-03-09 05:25:09,863 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 1680 transitions, 24451 flow. Second operand  has 33 states, 33 states have (on average 60.72727272727273) internal successors, (2004), 33 states have internal predecessors, (2004), 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-03-09 05:25:09,863 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:25:09,863 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 140
[2024-03-09 05:25:09,863 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:25:32,190 INFO  L124   PetriNetUnfolderBase]: 34893/65299 cut-off events.
[2024-03-09 05:25:32,191 INFO  L125   PetriNetUnfolderBase]: For 366589/366740 co-relation queries the response was YES.
[2024-03-09 05:25:32,759 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 325169 conditions, 65299 events. 34893/65299 cut-off events. For 366589/366740 co-relation queries the response was YES. Maximal size of possible extension queue 1829. Compared 618320 event pairs, 8188 based on Foata normal form. 608/62765 useless extension candidates. Maximal degree in co-relation 322777. Up to 34764 conditions per place. 
[2024-03-09 05:25:33,026 INFO  L140   encePairwiseOnDemand]: 106/140 looper letters, 1633 selfloop transitions, 828 changer transitions 1/2534 dead transitions.
[2024-03-09 05:25:33,026 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 2534 transitions, 38411 flow
[2024-03-09 05:25:33,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-03-09 05:25:33,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-03-09 05:25:33,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1803 transitions.
[2024-03-09 05:25:33,029 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5599378881987578
[2024-03-09 05:25:33,029 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1803 transitions.
[2024-03-09 05:25:33,029 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1803 transitions.
[2024-03-09 05:25:33,030 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:25:33,030 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1803 transitions.
[2024-03-09 05:25:33,032 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 78.3913043478261) internal successors, (1803), 23 states have internal predecessors, (1803), 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-03-09 05:25:33,035 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 140.0) internal successors, (3360), 24 states have internal predecessors, (3360), 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-03-09 05:25:33,035 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 140.0) internal successors, (3360), 24 states have internal predecessors, (3360), 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-03-09 05:25:33,035 INFO  L175             Difference]: Start difference. First operand has 262 places, 1680 transitions, 24451 flow. Second operand 23 states and 1803 transitions.
[2024-03-09 05:25:33,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 2534 transitions, 38411 flow
[2024-03-09 05:25:42,134 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 2534 transitions, 38291 flow, removed 60 selfloop flow, removed 0 redundant places.
[2024-03-09 05:25:42,187 INFO  L231             Difference]: Finished difference. Result has 293 places, 2074 transitions, 33437 flow
[2024-03-09 05:25:42,188 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=24331, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=540, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1060, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=33437, PETRI_PLACES=293, PETRI_TRANSITIONS=2074}
[2024-03-09 05:25:42,188 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 153 predicate places.
[2024-03-09 05:25:42,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 293 places, 2074 transitions, 33437 flow
[2024-03-09 05:25:42,189 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 60.72727272727273) internal successors, (2004), 33 states have internal predecessors, (2004), 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-03-09 05:25:42,189 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:25:42,189 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-03-09 05:25:42,194 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-03-09 05:25:42,393 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-03-09 05:25:42,393 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-03-09 05:25:42,394 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:25:42,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 1117847171, now seen corresponding path program 1 times
[2024-03-09 05:25:42,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:25:42,395 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150122724]
[2024-03-09 05:25:42,395 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:25:42,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:25:42,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:25:42,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:25:42,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:25:42,704 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150122724]
[2024-03-09 05:25:42,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150122724] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:25:42,704 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703160591]
[2024-03-09 05:25:42,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:25:42,705 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:25:42,705 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:25:42,706 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-03-09 05:25:42,709 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-03-09 05:25:42,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:25:42,872 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-03-09 05:25:42,874 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:25:42,953 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-03-09 05:25:43,159 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-03-09 05:25:43,185 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-03-09 05:25:43,218 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-03-09 05:25:43,256 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-03-09 05:25:43,294 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:25:43,295 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-03-09 05:25:43,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:25:43,321 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:25:43,334 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_924 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-09 05:25:43,349 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_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-03-09 05:25:43,366 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_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2))) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-03-09 05:25:43,531 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-03-09 05:25:43,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:25:43,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [703160591] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:25:43,569 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:25:43,569 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34
[2024-03-09 05:25:43,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916782112]
[2024-03-09 05:25:43,569 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:25:43,570 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-09 05:25:43,570 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:25:43,570 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-09 05:25:43,571 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=877, Unknown=3, NotChecked=186, Total=1190
[2024-03-09 05:25:43,793 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 140
[2024-03-09 05:25:43,794 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 2074 transitions, 33437 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-03-09 05:25:43,794 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:25:43,794 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 140
[2024-03-09 05:25:43,794 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:26:11,621 INFO  L124   PetriNetUnfolderBase]: 38462/71944 cut-off events.
[2024-03-09 05:26:11,621 INFO  L125   PetriNetUnfolderBase]: For 567506/567725 co-relation queries the response was YES.
[2024-03-09 05:26:12,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 411630 conditions, 71944 events. 38462/71944 cut-off events. For 567506/567725 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 687543 event pairs, 5218 based on Foata normal form. 515/68929 useless extension candidates. Maximal degree in co-relation 408896. Up to 25382 conditions per place. 
[2024-03-09 05:26:12,909 INFO  L140   encePairwiseOnDemand]: 107/140 looper letters, 1970 selfloop transitions, 1271 changer transitions 0/3324 dead transitions.
[2024-03-09 05:26:12,909 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 3324 transitions, 57309 flow
[2024-03-09 05:26:12,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-09 05:26:12,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-09 05:26:12,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1680 transitions.
[2024-03-09 05:26:12,911 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-03-09 05:26:12,912 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1680 transitions.
[2024-03-09 05:26:12,912 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1680 transitions.
[2024-03-09 05:26:12,912 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:26:12,912 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1680 transitions.
[2024-03-09 05:26:12,914 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-03-09 05:26:12,916 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-03-09 05:26:12,916 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-03-09 05:26:12,916 INFO  L175             Difference]: Start difference. First operand has 293 places, 2074 transitions, 33437 flow. Second operand 21 states and 1680 transitions.
[2024-03-09 05:26:12,916 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 3324 transitions, 57309 flow
[2024-03-09 05:26:35,650 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 3324 transitions, 57173 flow, removed 51 selfloop flow, removed 13 redundant places.
[2024-03-09 05:26:35,695 INFO  L231             Difference]: Finished difference. Result has 309 places, 2723 transitions, 50355 flow
[2024-03-09 05:26:35,696 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=33303, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=691, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=50355, PETRI_PLACES=309, PETRI_TRANSITIONS=2723}
[2024-03-09 05:26:35,697 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 169 predicate places.
[2024-03-09 05:26:35,697 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 2723 transitions, 50355 flow
[2024-03-09 05:26:35,697 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-03-09 05:26:35,697 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:26:35,698 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-03-09 05:26:35,705 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-03-09 05:26:35,899 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-03-09 05:26:35,899 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-03-09 05:26:35,900 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:26:35,900 INFO  L85        PathProgramCache]: Analyzing trace with hash -124498275, now seen corresponding path program 2 times
[2024-03-09 05:26:35,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:26:35,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4629889]
[2024-03-09 05:26:35,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:26:35,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:26:35,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:26:36,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:26:36,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:26:36,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4629889]
[2024-03-09 05:26:36,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4629889] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:26:36,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086333171]
[2024-03-09 05:26:36,331 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:26:36,331 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:26:36,331 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:26:36,332 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-03-09 05:26:36,333 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-03-09 05:26:36,461 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:26:36,462 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:26:36,463 INFO  L262         TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 23 conjunts are in the unsatisfiable core
[2024-03-09 05:26:36,467 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:26:36,575 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-03-09 05:26:36,762 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-03-09 05:26:36,806 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 05:26:36,861 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:26:36,862 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 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 05:26:36,920 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:26:36,920 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44
[2024-03-09 05:26:36,987 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:26:36,990 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-03-09 05:26:37,072 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:26:37,073 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-03-09 05:26:37,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:26:37,082 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:26:37,217 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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-09 05:26:37,234 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2024-03-09 05:26:37,261 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse1) |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_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-09 05:26:37,597 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 27 treesize of output 15
[2024-03-09 05:26:37,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 05:26:37,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086333171] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:26:37,699 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:26:37,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38
[2024-03-09 05:26:37,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141356887]
[2024-03-09 05:26:37,699 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:26:37,700 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 39 states
[2024-03-09 05:26:37,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:26:37,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2024-03-09 05:26:37,701 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1117, Unknown=11, NotChecked=210, Total=1482
[2024-03-09 05:26:37,703 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 140
[2024-03-09 05:26:37,705 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 2723 transitions, 50355 flow. Second operand  has 39 states, 39 states have (on average 57.87179487179487) internal successors, (2257), 39 states have internal predecessors, (2257), 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-03-09 05:26:37,705 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:26:37,705 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 140
[2024-03-09 05:26:37,705 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:27:19,340 INFO  L124   PetriNetUnfolderBase]: 44346/80650 cut-off events.
[2024-03-09 05:27:19,340 INFO  L125   PetriNetUnfolderBase]: For 798431/798528 co-relation queries the response was YES.
[2024-03-09 05:27:20,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 495525 conditions, 80650 events. 44346/80650 cut-off events. For 798431/798528 co-relation queries the response was YES. Maximal size of possible extension queue 2047. Compared 757879 event pairs, 5614 based on Foata normal form. 623/77527 useless extension candidates. Maximal degree in co-relation 492126. Up to 26071 conditions per place. 
[2024-03-09 05:27:20,609 INFO  L140   encePairwiseOnDemand]: 112/140 looper letters, 1815 selfloop transitions, 2002 changer transitions 1/3874 dead transitions.
[2024-03-09 05:27:20,609 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 3874 transitions, 73101 flow
[2024-03-09 05:27:20,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-03-09 05:27:20,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-03-09 05:27:20,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2256 transitions.
[2024-03-09 05:27:20,612 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5198156682027649
[2024-03-09 05:27:20,612 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2256 transitions.
[2024-03-09 05:27:20,612 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2256 transitions.
[2024-03-09 05:27:20,613 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:27:20,613 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2256 transitions.
[2024-03-09 05:27:20,615 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 72.7741935483871) internal successors, (2256), 31 states have internal predecessors, (2256), 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-03-09 05:27:20,618 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 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-03-09 05:27:20,618 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 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-03-09 05:27:20,618 INFO  L175             Difference]: Start difference. First operand has 309 places, 2723 transitions, 50355 flow. Second operand 31 states and 2256 transitions.
[2024-03-09 05:27:20,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 3874 transitions, 73101 flow
[2024-03-09 05:27:42,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 3874 transitions, 72976 flow, removed 36 selfloop flow, removed 10 redundant places.
[2024-03-09 05:27:42,454 INFO  L231             Difference]: Finished difference. Result has 341 places, 3215 transitions, 67966 flow
[2024-03-09 05:27:42,455 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=50254, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1621, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=67966, PETRI_PLACES=341, PETRI_TRANSITIONS=3215}
[2024-03-09 05:27:42,456 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 201 predicate places.
[2024-03-09 05:27:42,456 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 3215 transitions, 67966 flow
[2024-03-09 05:27:42,456 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 39 states, 39 states have (on average 57.87179487179487) internal successors, (2257), 39 states have internal predecessors, (2257), 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-03-09 05:27:42,456 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:27:42,456 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-03-09 05:27:42,463 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-03-09 05:27:42,657 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-03-09 05:27:42,657 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-03-09 05:27:42,658 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:27:42,658 INFO  L85        PathProgramCache]: Analyzing trace with hash -2104890438, now seen corresponding path program 1 times
[2024-03-09 05:27:42,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:27:42,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859752346]
[2024-03-09 05:27:42,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:27:42,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:27:42,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:27:43,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:27:43,359 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:27:43,359 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859752346]
[2024-03-09 05:27:43,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859752346] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:27:43,360 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416511930]
[2024-03-09 05:27:43,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:27:43,360 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:27:43,360 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:27:43,361 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-03-09 05:27:43,363 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-03-09 05:27:43,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:27:43,486 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 51 conjunts are in the unsatisfiable core
[2024-03-09 05:27:43,492 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:27:43,497 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-03-09 05:27:43,550 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 05:27:43,551 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-03-09 05:27:43,671 INFO  L349             Elim1Store]: treesize reduction 52, result has 34.2 percent of original size
[2024-03-09 05:27:43,672 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36
[2024-03-09 05:27:43,722 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:27:43,729 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:27:43,729 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-03-09 05:27:44,231 INFO  L349             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 05:27:44,232 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 57
[2024-03-09 05:27:44,582 INFO  L349             Elim1Store]: treesize reduction 28, result has 34.9 percent of original size
[2024-03-09 05:27:44,582 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 47
[2024-03-09 05:27:44,601 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-03-09 05:27:44,672 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-03-09 05:27:44,724 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 21 treesize of output 20
[2024-03-09 05:27:44,798 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:27:44,798 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 05:27:45,022 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-03-09 05:27:45,090 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:27:45,091 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 05:27:45,171 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:27:45,171 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03-09 05:27:45,201 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:27:45,202 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03-09 05:27:45,224 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:27:45,224 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03-09 05:27:45,242 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:27:45,243 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03-09 05:27:45,281 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-03-09 05:27:45,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:27:45,291 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:27:45,317 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1164 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1164 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1164 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1164 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-09 05:27:45,360 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false
[2024-03-09 05:27:45,422 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-03-09 05:27:45,442 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (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_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-09 05:27:45,613 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (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_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) .cse3)))))) is different from false
[2024-03-09 05:27:46,355 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:27:46,355 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 116 treesize of output 105
[2024-03-09 05:27:46,360 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 67 treesize of output 65
[2024-03-09 05:27:46,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 05:27:46,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416511930] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:27:46,658 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:27:46,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 50
[2024-03-09 05:27:46,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846159245]
[2024-03-09 05:27:46,659 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:27:46,659 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 51 states
[2024-03-09 05:27:46,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:27:46,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2024-03-09 05:27:46,661 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1896, Unknown=9, NotChecked=460, Total=2550
[2024-03-09 05:27:46,676 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 140
[2024-03-09 05:27:46,678 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 3215 transitions, 67966 flow. Second operand  has 51 states, 51 states have (on average 53.254901960784316) internal successors, (2716), 51 states have internal predecessors, (2716), 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-03-09 05:27:46,678 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:27:46,678 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 140
[2024-03-09 05:27:46,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:28:52,647 INFO  L124   PetriNetUnfolderBase]: 51207/93516 cut-off events.
[2024-03-09 05:28:52,648 INFO  L125   PetriNetUnfolderBase]: For 1354606/1354681 co-relation queries the response was YES.
[2024-03-09 05:28:53,826 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 619805 conditions, 93516 events. 51207/93516 cut-off events. For 1354606/1354681 co-relation queries the response was YES. Maximal size of possible extension queue 2316. Compared 883727 event pairs, 7672 based on Foata normal form. 58/89578 useless extension candidates. Maximal degree in co-relation 616185. Up to 45893 conditions per place. 
[2024-03-09 05:28:54,271 INFO  L140   encePairwiseOnDemand]: 85/140 looper letters, 3875 selfloop transitions, 888 changer transitions 4/4818 dead transitions.
[2024-03-09 05:28:54,272 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 4818 transitions, 99703 flow
[2024-03-09 05:28:54,272 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. 
[2024-03-09 05:28:54,272 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2024-03-09 05:28:54,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 3439 transitions.
[2024-03-09 05:28:54,275 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4723901098901099
[2024-03-09 05:28:54,276 INFO  L72            ComplementDD]: Start complementDD. Operand 52 states and 3439 transitions.
[2024-03-09 05:28:54,276 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 52 states and 3439 transitions.
[2024-03-09 05:28:54,276 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:28:54,276 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 3439 transitions.
[2024-03-09 05:28:54,280 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 53 states, 52 states have (on average 66.13461538461539) internal successors, (3439), 52 states have internal predecessors, (3439), 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-03-09 05:28:54,285 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 53 states, 53 states have (on average 140.0) internal successors, (7420), 53 states have internal predecessors, (7420), 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-03-09 05:28:54,286 INFO  L81            ComplementDD]: Finished complementDD. Result  has 53 states, 53 states have (on average 140.0) internal successors, (7420), 53 states have internal predecessors, (7420), 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-03-09 05:28:54,286 INFO  L175             Difference]: Start difference. First operand has 341 places, 3215 transitions, 67966 flow. Second operand 52 states and 3439 transitions.
[2024-03-09 05:28:54,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 4818 transitions, 99703 flow
[2024-03-09 05:29:49,511 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 4818 transitions, 98975 flow, removed 331 selfloop flow, removed 16 redundant places.
[2024-03-09 05:29:49,585 INFO  L231             Difference]: Finished difference. Result has 400 places, 3873 transitions, 83545 flow
[2024-03-09 05:29:49,587 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=67446, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=83545, PETRI_PLACES=400, PETRI_TRANSITIONS=3873}
[2024-03-09 05:29:49,588 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 260 predicate places.
[2024-03-09 05:29:49,588 INFO  L495      AbstractCegarLoop]: Abstraction has has 400 places, 3873 transitions, 83545 flow
[2024-03-09 05:29:49,588 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 51 states, 51 states have (on average 53.254901960784316) internal successors, (2716), 51 states have internal predecessors, (2716), 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-03-09 05:29:49,588 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:29:49,588 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-03-09 05:29:49,594 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-03-09 05:29:49,794 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-03-09 05:29:49,795 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-03-09 05:29:49,795 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:29:49,795 INFO  L85        PathProgramCache]: Analyzing trace with hash 165462582, now seen corresponding path program 2 times
[2024-03-09 05:29:49,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:29:49,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918270904]
[2024-03-09 05:29:49,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:29:49,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:29:49,822 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:29:50,495 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:29:50,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:29:50,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918270904]
[2024-03-09 05:29:50,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918270904] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:29:50,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562656065]
[2024-03-09 05:29:50,496 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:29:50,496 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:29:50,496 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:29:50,497 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-03-09 05:29:50,498 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-03-09 05:29:50,672 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:29:50,672 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:29:50,674 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core
[2024-03-09 05:29:50,681 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:29:50,719 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-03-09 05:29:50,803 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:29:50,804 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13
[2024-03-09 05:29:50,857 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:29:50,857 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 15 treesize of output 15
[2024-03-09 05:29:51,084 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-03-09 05:29:51,645 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 05:29:51,645 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 72 treesize of output 66
[2024-03-09 05:29:52,056 INFO  L349             Elim1Store]: treesize reduction 40, result has 21.6 percent of original size
[2024-03-09 05:29:52,057 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 64 treesize of output 52
[2024-03-09 05:29:52,101 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-03-09 05:29:52,420 INFO  L349             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-03-09 05:29:52,420 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 63 treesize of output 40
[2024-03-09 05:29:52,478 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-03-09 05:29:52,547 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-03-09 05:29:52,612 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-03-09 05:29:52,699 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:29:52,700 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-03-09 05:29:52,715 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:29:52,716 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-03-09 05:29:52,745 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:29:52,745 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-03-09 05:29:52,762 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:29:52,763 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-03-09 05:29:52,842 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-03-09 05:29:52,892 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:29:52,892 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:29:53,057 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-09 05:29:53,105 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false
[2024-03-09 05:29:53,122 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1286 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1287) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-09 05:29:53,490 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-03-09 05:29:53,876 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:29:53,876 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 114 treesize of output 103
[2024-03-09 05:29:53,881 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 65 treesize of output 63
[2024-03-09 05:29:54,096 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:29:54,096 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 209 treesize of output 210
[2024-03-09 05:29:54,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:29:54,214 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562656065] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:29:54,214 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:29:54,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 51
[2024-03-09 05:29:54,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625338597]
[2024-03-09 05:29:54,214 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:29:54,215 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 52 states
[2024-03-09 05:29:54,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:29:54,216 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2024-03-09 05:29:54,217 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2134, Unknown=27, NotChecked=288, Total=2652
[2024-03-09 05:29:54,649 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 140
[2024-03-09 05:29:54,651 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 3873 transitions, 83545 flow. Second operand  has 52 states, 52 states have (on average 47.5) internal successors, (2470), 52 states have internal predecessors, (2470), 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-03-09 05:29:54,651 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:29:54,651 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 140
[2024-03-09 05:29:54,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:31:14,717 INFO  L124   PetriNetUnfolderBase]: 55155/99018 cut-off events.
[2024-03-09 05:31:14,718 INFO  L125   PetriNetUnfolderBase]: For 1733427/1733896 co-relation queries the response was YES.
[2024-03-09 05:31:16,351 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 716931 conditions, 99018 events. 55155/99018 cut-off events. For 1733427/1733896 co-relation queries the response was YES. Maximal size of possible extension queue 2466. Compared 926786 event pairs, 11646 based on Foata normal form. 187/95014 useless extension candidates. Maximal degree in co-relation 713423. Up to 67720 conditions per place. 
[2024-03-09 05:31:16,846 INFO  L140   encePairwiseOnDemand]: 79/140 looper letters, 4290 selfloop transitions, 1139 changer transitions 4/5477 dead transitions.
[2024-03-09 05:31:16,847 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 5477 transitions, 118053 flow
[2024-03-09 05:31:16,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. 
[2024-03-09 05:31:16,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2024-03-09 05:31:16,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 3356 transitions.
[2024-03-09 05:31:16,852 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42806122448979594
[2024-03-09 05:31:16,852 INFO  L72            ComplementDD]: Start complementDD. Operand 56 states and 3356 transitions.
[2024-03-09 05:31:16,852 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 56 states and 3356 transitions.
[2024-03-09 05:31:16,853 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:31:16,853 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 3356 transitions.
[2024-03-09 05:31:16,856 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 57 states, 56 states have (on average 59.92857142857143) internal successors, (3356), 56 states have internal predecessors, (3356), 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-03-09 05:31:16,861 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-03-09 05:31:16,862 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-03-09 05:31:16,862 INFO  L175             Difference]: Start difference. First operand has 400 places, 3873 transitions, 83545 flow. Second operand 56 states and 3356 transitions.
[2024-03-09 05:31:16,862 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 5477 transitions, 118053 flow
[2024-03-09 05:32:28,216 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 5477 transitions, 117617 flow, removed 210 selfloop flow, removed 8 redundant places.
[2024-03-09 05:32:28,304 INFO  L231             Difference]: Finished difference. Result has 463 places, 4377 transitions, 98101 flow
[2024-03-09 05:32:28,307 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=83179, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=714, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3024, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=98101, PETRI_PLACES=463, PETRI_TRANSITIONS=4377}
[2024-03-09 05:32:28,307 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 323 predicate places.
[2024-03-09 05:32:28,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 463 places, 4377 transitions, 98101 flow
[2024-03-09 05:32:28,308 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 52 states, 52 states have (on average 47.5) internal successors, (2470), 52 states have internal predecessors, (2470), 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-03-09 05:32:28,308 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:32:28,308 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-03-09 05:32:28,313 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-03-09 05:32:28,512 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-03-09 05:32:28,512 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-03-09 05:32:28,513 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:32:28,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -29194128, now seen corresponding path program 3 times
[2024-03-09 05:32:28,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:32:28,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290991341]
[2024-03-09 05:32:28,514 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:32:28,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:32:28,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:32:29,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:32:29,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:32:29,102 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290991341]
[2024-03-09 05:32:29,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290991341] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:32:29,102 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893299511]
[2024-03-09 05:32:29,102 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 05:32:29,102 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:32:29,102 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:32:29,103 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:32:29,104 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-09 05:32:29,293 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 05:32:29,294 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:32:29,295 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 69 conjunts are in the unsatisfiable core
[2024-03-09 05:32:29,300 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:32:29,331 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-03-09 05:32:29,450 INFO  L349             Elim1Store]: treesize reduction 32, result has 36.0 percent of original size
[2024-03-09 05:32:29,450 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 23 treesize of output 24
[2024-03-09 05:32:29,502 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:32:29,502 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 05:32:30,226 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 05:32:30,227 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 78 treesize of output 70
[2024-03-09 05:32:30,235 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:32:30,237 INFO  L349             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-03-09 05:32:30,237 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 1 case distinctions, treesize of input 31 treesize of output 21
[2024-03-09 05:32:30,677 INFO  L349             Elim1Store]: treesize reduction 36, result has 29.4 percent of original size
[2024-03-09 05:32:30,678 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 54 treesize of output 48
[2024-03-09 05:32:30,685 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:32:30,695 INFO  L349             Elim1Store]: treesize reduction 21, result has 30.0 percent of original size
[2024-03-09 05:32:30,695 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 2 case distinctions, treesize of input 23 treesize of output 25
[2024-03-09 05:32:30,703 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 5 treesize of output 3
[2024-03-09 05:32:30,710 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-03-09 05:32:30,921 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-03-09 05:32:30,924 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-03-09 05:32:30,970 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-03-09 05:32:31,006 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-03-09 05:32:31,055 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-03-09 05:32:31,109 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-03-09 05:32:31,156 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-03-09 05:32:31,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:32:31,194 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:32:31,332 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1408 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1408) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1408 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1408) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1408 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1408) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1408 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1408) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false
[2024-03-09 05:32:31,352 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1408 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1408) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1408 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1408) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1408 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1408) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1408 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1408) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false
[2024-03-09 05:32:31,568 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1401 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1401) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 05:32:31,572 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1401 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1401) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 05:32:31,578 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1401) |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-03-09 05:32:31,599 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (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_1399) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1401) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 05:32:31,622 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (= .cse0 (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_1399) .cse0 v_ArrVal_1401) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2024-03-09 05:32:31,890 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:32:31,890 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-03-09 05:32:31,904 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:32:31,905 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 17 treesize of output 20
[2024-03-09 05:32:31,913 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-03-09 05:32:31,918 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-03-09 05:32:32,107 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:32:32,108 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 157 treesize of output 196
[2024-03-09 05:32:32,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 05:32:32,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [893299511] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:32:32,330 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:32:32,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 54
[2024-03-09 05:32:32,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800507114]
[2024-03-09 05:32:32,330 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:32:32,330 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 55 states
[2024-03-09 05:32:32,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:32:32,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants.
[2024-03-09 05:32:32,332 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2031, Unknown=41, NotChecked=686, Total=2970
[2024-03-09 05:32:32,647 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 140
[2024-03-09 05:32:32,649 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 4377 transitions, 98101 flow. Second operand  has 55 states, 55 states have (on average 47.38181818181818) internal successors, (2606), 55 states have internal predecessors, (2606), 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-03-09 05:32:32,649 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:32:32,649 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 140
[2024-03-09 05:32:32,649 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:34:20,769 INFO  L124   PetriNetUnfolderBase]: 67971/121445 cut-off events.
[2024-03-09 05:34:20,769 INFO  L125   PetriNetUnfolderBase]: For 2524742/2525282 co-relation queries the response was YES.
[2024-03-09 05:34:23,238 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 939736 conditions, 121445 events. 67971/121445 cut-off events. For 2524742/2525282 co-relation queries the response was YES. Maximal size of possible extension queue 3218. Compared 1169584 event pairs, 13017 based on Foata normal form. 358/116600 useless extension candidates. Maximal degree in co-relation 937132. Up to 67040 conditions per place. 
[2024-03-09 05:34:23,901 INFO  L140   encePairwiseOnDemand]: 82/140 looper letters, 5012 selfloop transitions, 1793 changer transitions 16/6865 dead transitions.
[2024-03-09 05:34:23,901 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 6865 transitions, 158456 flow
[2024-03-09 05:34:23,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. 
[2024-03-09 05:34:23,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2024-03-09 05:34:23,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 3319 transitions.
[2024-03-09 05:34:23,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43103896103896105
[2024-03-09 05:34:23,905 INFO  L72            ComplementDD]: Start complementDD. Operand 55 states and 3319 transitions.
[2024-03-09 05:34:23,905 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 55 states and 3319 transitions.
[2024-03-09 05:34:23,906 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:34:23,906 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 3319 transitions.
[2024-03-09 05:34:23,909 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 56 states, 55 states have (on average 60.345454545454544) internal successors, (3319), 55 states have internal predecessors, (3319), 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-03-09 05:34:23,914 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 56 states, 56 states have (on average 140.0) internal successors, (7840), 56 states have internal predecessors, (7840), 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-03-09 05:34:23,914 INFO  L81            ComplementDD]: Finished complementDD. Result  has 56 states, 56 states have (on average 140.0) internal successors, (7840), 56 states have internal predecessors, (7840), 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-03-09 05:34:23,914 INFO  L175             Difference]: Start difference. First operand has 463 places, 4377 transitions, 98101 flow. Second operand 55 states and 3319 transitions.
[2024-03-09 05:34:23,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 6865 transitions, 158456 flow
[2024-03-09 05:36:56,757 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 6865 transitions, 157624 flow, removed 333 selfloop flow, removed 27 redundant places.
[2024-03-09 05:36:56,869 INFO  L231             Difference]: Finished difference. Result has 506 places, 5477 transitions, 133104 flow
[2024-03-09 05:36:56,872 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=97357, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=893, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=133104, PETRI_PLACES=506, PETRI_TRANSITIONS=5477}
[2024-03-09 05:36:56,872 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 366 predicate places.
[2024-03-09 05:36:56,872 INFO  L495      AbstractCegarLoop]: Abstraction has has 506 places, 5477 transitions, 133104 flow
[2024-03-09 05:36:56,873 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 55 states, 55 states have (on average 47.38181818181818) internal successors, (2606), 55 states have internal predecessors, (2606), 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-03-09 05:36:56,873 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:36:56,873 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-03-09 05:36:56,880 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-03-09 05:36:57,074 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2024-03-09 05:36:57,075 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 05:36:57,075 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:36:57,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -1342309074, now seen corresponding path program 4 times
[2024-03-09 05:36:57,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:36:57,076 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692877769]
[2024-03-09 05:36:57,076 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:36:57,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:36:57,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:36:57,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:36:57,756 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:36:57,756 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692877769]
[2024-03-09 05:36:57,756 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692877769] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:36:57,756 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471138827]
[2024-03-09 05:36:57,756 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 05:36:57,756 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:36:57,756 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:36:57,757 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:36:57,758 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-09 05:36:58,039 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 05:36:58,039 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:36:58,041 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 61 conjunts are in the unsatisfiable core
[2024-03-09 05:36:58,048 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:36:58,087 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-03-09 05:36:58,172 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:36:58,173 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13
[2024-03-09 05:36:58,241 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:36:58,242 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 15 treesize of output 15
Killed by 15
