./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/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 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:41:49,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:41:49,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:41:49,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:41:49,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:41:49,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:41:49,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:41:49,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:41:49,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:41:49,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:41:49,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:41:49,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:41:49,806 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:41:49,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:41:49,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:41:49,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:41:49,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:41:49,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:41:49,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:41:49,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:41:49,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:41:49,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:41:49,809 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:41:49,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:41:49,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:41:49,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:41:49,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:41:49,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:41:49,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:41:49,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:41:49,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:41:49,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:41:49,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:41:49,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:41:49,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:41:49,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:41:49,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:41:49,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:41:49,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:41:49,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:41:49,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:41:49,814 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:/storage/repos/ultimate/releaseScripts/default/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 -> /storage/repos/ultimate/releaseScripts/default/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 -> 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 [2024-11-10 14:41:50,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:41:50,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:41:50,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:41:50,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:41:50,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:41:50,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i [2024-11-10 14:41:51,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:41:51,641 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:41:51,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i [2024-11-10 14:41:51,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23401bfc/88e1d374cbd3485cb8caf09a68e4bf7c/FLAG70d8b797c [2024-11-10 14:41:51,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23401bfc/88e1d374cbd3485cb8caf09a68e4bf7c [2024-11-10 14:41:51,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:41:51,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:41:51,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:41:51,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:41:51,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:41:51,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:41:51" (1/1) ... [2024-11-10 14:41:51,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f4c119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:51, skipping insertion in model container [2024-11-10 14:41:51,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:41:51" (1/1) ... [2024-11-10 14:41:51,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:41:52,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:41:52,068 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:41:52,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:41:52,160 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:41:52,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52 WrapperNode [2024-11-10 14:41:52,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:41:52,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:41:52,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:41:52,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:41:52,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,209 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-10 14:41:52,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:41:52,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:41:52,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:41:52,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:41:52,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:41:52,268 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:41:52,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:41:52,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:41:52,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (1/1) ... [2024-11-10 14:41:52,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:41:52,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:41:52,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:41:52,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:41:52,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:41:52,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:41:52,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:41:52,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:41:52,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 14:41:52,381 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 14:41:52,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:41:52,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:41:52,383 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:41:52,471 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:41:52,473 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:41:52,625 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:41:52,625 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:41:52,636 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:41:52,641 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:41:52,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:41:52 BoogieIcfgContainer [2024-11-10 14:41:52,642 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:41:52,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:41:52,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:41:52,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:41:52,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:41:51" (1/3) ... [2024-11-10 14:41:52,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a842ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:41:52, skipping insertion in model container [2024-11-10 14:41:52,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:52" (2/3) ... [2024-11-10 14:41:52,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a842ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:41:52, skipping insertion in model container [2024-11-10 14:41:52,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:41:52" (3/3) ... [2024-11-10 14:41:52,656 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-index.i [2024-11-10 14:41:52,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:41:52,685 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 14:41:52,685 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:41:52,744 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:41:52,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 98 transitions, 203 flow [2024-11-10 14:41:52,816 INFO L124 PetriNetUnfolderBase]: 6/135 cut-off events. [2024-11-10 14:41:52,816 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:41:52,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 135 events. 6/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 247 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 66. Up to 4 conditions per place. [2024-11-10 14:41:52,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 98 transitions, 203 flow [2024-11-10 14:41:52,823 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 98 transitions, 203 flow [2024-11-10 14:41:52,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:41:52,833 INFO L333 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, 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;@5252107b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:41:52,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-10 14:41:52,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:41:52,839 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2024-11-10 14:41:52,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:41:52,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:52,839 INFO L204 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] [2024-11-10 14:41:52,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:41:52,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:52,844 INFO L85 PathProgramCache]: Analyzing trace with hash -909430597, now seen corresponding path program 1 times [2024-11-10 14:41:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:52,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555976808] [2024-11-10 14:41:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:53,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:53,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555976808] [2024-11-10 14:41:53,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555976808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:53,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:53,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:41:53,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847116144] [2024-11-10 14:41:53,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:53,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:41:53,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:53,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:41:53,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:41:53,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 98 [2024-11-10 14:41:53,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 98 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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-11-10 14:41:53,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:53,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 98 [2024-11-10 14:41:53,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:53,120 INFO L124 PetriNetUnfolderBase]: 3/165 cut-off events. [2024-11-10 14:41:53,121 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-10 14:41:53,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 165 events. 3/165 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 342 event pairs, 2 based on Foata normal form. 5/151 useless extension candidates. Maximal degree in co-relation 103. Up to 15 conditions per place. [2024-11-10 14:41:53,123 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 8 selfloop transitions, 2 changer transitions 1/94 dead transitions. [2024-11-10 14:41:53,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 215 flow [2024-11-10 14:41:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:41:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:41:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-11-10 14:41:53,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-10 14:41:53,135 INFO L175 Difference]: Start difference. First operand has 97 places, 98 transitions, 203 flow. Second operand 3 states and 266 transitions. [2024-11-10 14:41:53,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 215 flow [2024-11-10 14:41:53,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 94 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:41:53,143 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 197 flow [2024-11-10 14:41:53,144 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2024-11-10 14:41:53,149 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2024-11-10 14:41:53,150 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 197 flow [2024-11-10 14:41:53,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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-11-10 14:41:53,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:53,150 INFO L204 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] [2024-11-10 14:41:53,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:41:53,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:41:53,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash -233359639, now seen corresponding path program 1 times [2024-11-10 14:41:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:53,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63831370] [2024-11-10 14:41:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:53,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63831370] [2024-11-10 14:41:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63831370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:53,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:53,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:41:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318219950] [2024-11-10 14:41:53,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:53,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:41:53,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:53,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:41:53,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:41:53,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2024-11-10 14:41:53,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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-11-10 14:41:53,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:53,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2024-11-10 14:41:53,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:53,255 INFO L124 PetriNetUnfolderBase]: 5/174 cut-off events. [2024-11-10 14:41:53,256 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-11-10 14:41:53,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 174 events. 5/174 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 338 event pairs, 2 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 169. Up to 16 conditions per place. [2024-11-10 14:41:53,258 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 7 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-11-10 14:41:53,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 215 flow [2024-11-10 14:41:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:41:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:41:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2024-11-10 14:41:53,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9149659863945578 [2024-11-10 14:41:53,262 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 197 flow. Second operand 3 states and 269 transitions. [2024-11-10 14:41:53,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 215 flow [2024-11-10 14:41:53,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 93 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:41:53,267 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 203 flow [2024-11-10 14:41:53,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2024-11-10 14:41:53,268 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2024-11-10 14:41:53,268 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 203 flow [2024-11-10 14:41:53,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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-11-10 14:41:53,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:53,269 INFO L204 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] [2024-11-10 14:41:53,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:41:53,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:41:53,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash -968299577, now seen corresponding path program 1 times [2024-11-10 14:41:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:53,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111183470] [2024-11-10 14:41:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:53,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:53,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111183470] [2024-11-10 14:41:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111183470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:53,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364854030] [2024-11-10 14:41:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:53,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:41:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:41:53,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:41:53,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 98 [2024-11-10 14:41:53,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 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-11-10 14:41:53,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:53,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 98 [2024-11-10 14:41:53,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:53,978 INFO L124 PetriNetUnfolderBase]: 73/409 cut-off events. [2024-11-10 14:41:53,979 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:41:53,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 409 events. 73/409 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1984 event pairs, 35 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 505. Up to 159 conditions per place. [2024-11-10 14:41:53,981 INFO L140 encePairwiseOnDemand]: 87/98 looper letters, 23 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2024-11-10 14:41:53,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 114 transitions, 335 flow [2024-11-10 14:41:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions. [2024-11-10 14:41:53,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8027210884353742 [2024-11-10 14:41:53,988 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 203 flow. Second operand 6 states and 472 transitions. [2024-11-10 14:41:53,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 114 transitions, 335 flow [2024-11-10 14:41:53,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 114 transitions, 335 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:41:53,991 INFO L231 Difference]: Finished difference. Result has 106 places, 114 transitions, 353 flow [2024-11-10 14:41:53,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=106, PETRI_TRANSITIONS=114} [2024-11-10 14:41:53,992 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 9 predicate places. [2024-11-10 14:41:53,992 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 114 transitions, 353 flow [2024-11-10 14:41:53,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 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-11-10 14:41:53,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:53,992 INFO L204 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] [2024-11-10 14:41:53,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:41:53,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:41:53,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:53,994 INFO L85 PathProgramCache]: Analyzing trace with hash 446402729, now seen corresponding path program 1 times [2024-11-10 14:41:53,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:53,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237234312] [2024-11-10 14:41:53,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:53,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:54,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:54,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237234312] [2024-11-10 14:41:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237234312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:54,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:54,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427645448] [2024-11-10 14:41:54,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:54,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:41:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:54,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:41:54,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:41:54,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 98 [2024-11-10 14:41:54,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 114 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 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-11-10 14:41:54,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:54,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 98 [2024-11-10 14:41:54,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:54,166 INFO L124 PetriNetUnfolderBase]: 34/270 cut-off events. [2024-11-10 14:41:54,167 INFO L125 PetriNetUnfolderBase]: For 34/40 co-relation queries the response was YES. [2024-11-10 14:41:54,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 270 events. 34/270 cut-off events. For 34/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 941 event pairs, 0 based on Foata normal form. 2/261 useless extension candidates. Maximal degree in co-relation 343. Up to 49 conditions per place. [2024-11-10 14:41:54,169 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 11 selfloop transitions, 2 changer transitions 5/119 dead transitions. [2024-11-10 14:41:54,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 119 transitions, 399 flow [2024-11-10 14:41:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2024-11-10 14:41:54,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2024-11-10 14:41:54,170 INFO L175 Difference]: Start difference. First operand has 106 places, 114 transitions, 353 flow. Second operand 6 states and 511 transitions. [2024-11-10 14:41:54,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 119 transitions, 399 flow [2024-11-10 14:41:54,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 119 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:41:54,174 INFO L231 Difference]: Finished difference. Result has 115 places, 114 transitions, 371 flow [2024-11-10 14:41:54,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=115, PETRI_TRANSITIONS=114} [2024-11-10 14:41:54,175 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 18 predicate places. [2024-11-10 14:41:54,175 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 371 flow [2024-11-10 14:41:54,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 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-11-10 14:41:54,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:54,176 INFO L204 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-11-10 14:41:54,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:41:54,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:41:54,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:54,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1666601114, now seen corresponding path program 1 times [2024-11-10 14:41:54,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:54,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810743313] [2024-11-10 14:41:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:54,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:54,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:54,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810743313] [2024-11-10 14:41:54,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810743313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:54,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:54,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:54,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144777280] [2024-11-10 14:41:54,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:54,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:41:54,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:54,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:41:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:41:54,478 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2024-11-10 14:41:54,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 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-11-10 14:41:54,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:54,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2024-11-10 14:41:54,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:54,640 INFO L124 PetriNetUnfolderBase]: 131/510 cut-off events. [2024-11-10 14:41:54,640 INFO L125 PetriNetUnfolderBase]: For 137/143 co-relation queries the response was YES. [2024-11-10 14:41:54,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 510 events. 131/510 cut-off events. For 137/143 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2624 event pairs, 23 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 1037. Up to 240 conditions per place. [2024-11-10 14:41:54,645 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 35 selfloop transitions, 48 changer transitions 12/157 dead transitions. [2024-11-10 14:41:54,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 157 transitions, 693 flow [2024-11-10 14:41:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 503 transitions. [2024-11-10 14:41:54,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8554421768707483 [2024-11-10 14:41:54,648 INFO L175 Difference]: Start difference. First operand has 115 places, 114 transitions, 371 flow. Second operand 6 states and 503 transitions. [2024-11-10 14:41:54,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 157 transitions, 693 flow [2024-11-10 14:41:54,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 157 transitions, 679 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-10 14:41:54,654 INFO L231 Difference]: Finished difference. Result has 117 places, 145 transitions, 714 flow [2024-11-10 14:41:54,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=714, PETRI_PLACES=117, PETRI_TRANSITIONS=145} [2024-11-10 14:41:54,656 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 20 predicate places. [2024-11-10 14:41:54,656 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 145 transitions, 714 flow [2024-11-10 14:41:54,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 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-11-10 14:41:54,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:54,657 INFO L204 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] [2024-11-10 14:41:54,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:41:54,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:41:54,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash 907880160, now seen corresponding path program 1 times [2024-11-10 14:41:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:54,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161958927] [2024-11-10 14:41:54,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:54,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:41:54,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:41:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:41:54,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:41:54,719 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:41:54,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-10 14:41:54,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-10 14:41:54,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-10 14:41:54,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-10 14:41:54,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-10 14:41:54,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-10 14:41:54,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-10 14:41:54,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-10 14:41:54,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-10 14:41:54,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:41:54,726 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:41:54,731 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:41:54,731 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:41:54,755 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:41:54,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 119 transitions, 254 flow [2024-11-10 14:41:54,785 INFO L124 PetriNetUnfolderBase]: 11/230 cut-off events. [2024-11-10 14:41:54,786 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:41:54,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 230 events. 11/230 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 531 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2024-11-10 14:41:54,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 119 transitions, 254 flow [2024-11-10 14:41:54,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 254 flow [2024-11-10 14:41:54,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:41:54,792 INFO L333 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, 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;@5252107b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:41:54,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-10 14:41:54,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:41:54,797 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2024-11-10 14:41:54,797 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:41:54,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:54,797 INFO L204 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] [2024-11-10 14:41:54,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:41:54,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1115425170, now seen corresponding path program 1 times [2024-11-10 14:41:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767378246] [2024-11-10 14:41:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:54,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:54,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767378246] [2024-11-10 14:41:54,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767378246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:54,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:54,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:41:54,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113799327] [2024-11-10 14:41:54,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:54,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:41:54,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:54,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:41:54,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:41:54,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 119 [2024-11-10 14:41:54,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-11-10 14:41:54,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:54,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 119 [2024-11-10 14:41:54,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:54,895 INFO L124 PetriNetUnfolderBase]: 19/449 cut-off events. [2024-11-10 14:41:54,896 INFO L125 PetriNetUnfolderBase]: For 28/34 co-relation queries the response was YES. [2024-11-10 14:41:54,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 449 events. 19/449 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1880 event pairs, 16 based on Foata normal form. 9/401 useless extension candidates. Maximal degree in co-relation 291. Up to 50 conditions per place. [2024-11-10 14:41:54,898 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 11 selfloop transitions, 2 changer transitions 1/115 dead transitions. [2024-11-10 14:41:54,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 272 flow [2024-11-10 14:41:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:41:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:41:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2024-11-10 14:41:54,899 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-10 14:41:54,899 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 254 flow. Second operand 3 states and 323 transitions. [2024-11-10 14:41:54,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 115 transitions, 272 flow [2024-11-10 14:41:54,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 115 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:41:54,901 INFO L231 Difference]: Finished difference. Result has 120 places, 114 transitions, 248 flow [2024-11-10 14:41:54,901 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=120, PETRI_TRANSITIONS=114} [2024-11-10 14:41:54,902 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2024-11-10 14:41:54,903 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 114 transitions, 248 flow [2024-11-10 14:41:54,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-11-10 14:41:54,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:54,904 INFO L204 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] [2024-11-10 14:41:54,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:41:54,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:41:54,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1072772439, now seen corresponding path program 1 times [2024-11-10 14:41:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:54,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736863478] [2024-11-10 14:41:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:54,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:54,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736863478] [2024-11-10 14:41:54,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736863478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:54,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:54,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:41:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719198939] [2024-11-10 14:41:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:54,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:41:54,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:54,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:41:54,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:41:54,934 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 119 [2024-11-10 14:41:54,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 114 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-11-10 14:41:54,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:54,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 119 [2024-11-10 14:41:54,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:54,982 INFO L124 PetriNetUnfolderBase]: 48/646 cut-off events. [2024-11-10 14:41:54,983 INFO L125 PetriNetUnfolderBase]: For 45/63 co-relation queries the response was YES. [2024-11-10 14:41:54,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 646 events. 48/646 cut-off events. For 45/63 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3266 event pairs, 28 based on Foata normal form. 2/589 useless extension candidates. Maximal degree in co-relation 740. Up to 97 conditions per place. [2024-11-10 14:41:54,985 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 12 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-11-10 14:41:54,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 115 transitions, 285 flow [2024-11-10 14:41:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:41:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:41:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2024-11-10 14:41:54,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.907563025210084 [2024-11-10 14:41:54,987 INFO L175 Difference]: Start difference. First operand has 120 places, 114 transitions, 248 flow. Second operand 3 states and 324 transitions. [2024-11-10 14:41:54,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 115 transitions, 285 flow [2024-11-10 14:41:54,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:41:54,988 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 259 flow [2024-11-10 14:41:54,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=117, PETRI_TRANSITIONS=114} [2024-11-10 14:41:54,989 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -2 predicate places. [2024-11-10 14:41:54,989 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 259 flow [2024-11-10 14:41:54,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-11-10 14:41:54,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:54,990 INFO L204 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] [2024-11-10 14:41:54,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:41:54,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:41:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1220292482, now seen corresponding path program 1 times [2024-11-10 14:41:54,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39174955] [2024-11-10 14:41:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:55,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:55,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39174955] [2024-11-10 14:41:55,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39174955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:55,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999104104] [2024-11-10 14:41:55,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:55,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:41:55,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:55,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:41:55,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:41:55,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2024-11-10 14:41:55,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 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-11-10 14:41:55,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:55,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2024-11-10 14:41:55,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:55,586 INFO L124 PetriNetUnfolderBase]: 1014/3193 cut-off events. [2024-11-10 14:41:55,586 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-10 14:41:55,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5085 conditions, 3193 events. 1014/3193 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 26157 event pairs, 586 based on Foata normal form. 0/2857 useless extension candidates. Maximal degree in co-relation 4136. Up to 1592 conditions per place. [2024-11-10 14:41:55,599 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 30 selfloop transitions, 38 changer transitions 0/152 dead transitions. [2024-11-10 14:41:55,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 152 transitions, 476 flow [2024-11-10 14:41:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2024-11-10 14:41:55,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.819327731092437 [2024-11-10 14:41:55,601 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 259 flow. Second operand 6 states and 585 transitions. [2024-11-10 14:41:55,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 152 transitions, 476 flow [2024-11-10 14:41:55,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 152 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:41:55,603 INFO L231 Difference]: Finished difference. Result has 127 places, 151 transitions, 513 flow [2024-11-10 14:41:55,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=127, PETRI_TRANSITIONS=151} [2024-11-10 14:41:55,604 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 8 predicate places. [2024-11-10 14:41:55,604 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 151 transitions, 513 flow [2024-11-10 14:41:55,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 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-11-10 14:41:55,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:55,605 INFO L204 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] [2024-11-10 14:41:55,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:41:55,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:41:55,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1224557385, now seen corresponding path program 1 times [2024-11-10 14:41:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:55,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718358547] [2024-11-10 14:41:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718358547] [2024-11-10 14:41:55,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718358547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:55,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:55,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:55,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42117589] [2024-11-10 14:41:55,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:55,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:41:55,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:55,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:41:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:41:55,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 119 [2024-11-10 14:41:55,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 151 transitions, 513 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 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-11-10 14:41:55,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:55,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 119 [2024-11-10 14:41:55,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:55,931 INFO L124 PetriNetUnfolderBase]: 484/1803 cut-off events. [2024-11-10 14:41:55,931 INFO L125 PetriNetUnfolderBase]: For 344/406 co-relation queries the response was YES. [2024-11-10 14:41:55,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3294 conditions, 1803 events. 484/1803 cut-off events. For 344/406 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 12923 event pairs, 135 based on Foata normal form. 2/1701 useless extension candidates. Maximal degree in co-relation 2714. Up to 615 conditions per place. [2024-11-10 14:41:55,940 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 14 selfloop transitions, 2 changer transitions 5/157 dead transitions. [2024-11-10 14:41:55,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 157 transitions, 567 flow [2024-11-10 14:41:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2024-11-10 14:41:55,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8795518207282913 [2024-11-10 14:41:55,942 INFO L175 Difference]: Start difference. First operand has 127 places, 151 transitions, 513 flow. Second operand 6 states and 628 transitions. [2024-11-10 14:41:55,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 157 transitions, 567 flow [2024-11-10 14:41:55,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 157 transitions, 567 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:41:55,947 INFO L231 Difference]: Finished difference. Result has 136 places, 152 transitions, 535 flow [2024-11-10 14:41:55,947 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=535, PETRI_PLACES=136, PETRI_TRANSITIONS=152} [2024-11-10 14:41:55,947 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2024-11-10 14:41:55,948 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 152 transitions, 535 flow [2024-11-10 14:41:55,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 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-11-10 14:41:55,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:55,948 INFO L204 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-11-10 14:41:55,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:41:55,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:41:55,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1411313662, now seen corresponding path program 1 times [2024-11-10 14:41:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:55,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535002398] [2024-11-10 14:41:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:55,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:56,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:56,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535002398] [2024-11-10 14:41:56,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535002398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:56,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:56,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682040090] [2024-11-10 14:41:56,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:56,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:41:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:41:56,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:41:56,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 119 [2024-11-10 14:41:56,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 152 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 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-11-10 14:41:56,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:56,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 119 [2024-11-10 14:41:56,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:56,976 INFO L124 PetriNetUnfolderBase]: 2423/6896 cut-off events. [2024-11-10 14:41:56,977 INFO L125 PetriNetUnfolderBase]: For 1888/2269 co-relation queries the response was YES. [2024-11-10 14:41:56,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14983 conditions, 6896 events. 2423/6896 cut-off events. For 1888/2269 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 62669 event pairs, 501 based on Foata normal form. 17/6376 useless extension candidates. Maximal degree in co-relation 14880. Up to 2869 conditions per place. [2024-11-10 14:41:57,012 INFO L140 encePairwiseOnDemand]: 100/119 looper letters, 86 selfloop transitions, 86 changer transitions 0/262 dead transitions. [2024-11-10 14:41:57,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 262 transitions, 1363 flow [2024-11-10 14:41:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions. [2024-11-10 14:41:57,014 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8893557422969187 [2024-11-10 14:41:57,014 INFO L175 Difference]: Start difference. First operand has 136 places, 152 transitions, 535 flow. Second operand 6 states and 635 transitions. [2024-11-10 14:41:57,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 262 transitions, 1363 flow [2024-11-10 14:41:57,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 262 transitions, 1351 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 14:41:57,026 INFO L231 Difference]: Finished difference. Result has 138 places, 235 transitions, 1249 flow [2024-11-10 14:41:57,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1249, PETRI_PLACES=138, PETRI_TRANSITIONS=235} [2024-11-10 14:41:57,027 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2024-11-10 14:41:57,028 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 235 transitions, 1249 flow [2024-11-10 14:41:57,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 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-11-10 14:41:57,028 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:57,028 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:41:57,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:41:57,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:41:57,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1643095156, now seen corresponding path program 1 times [2024-11-10 14:41:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:57,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617629177] [2024-11-10 14:41:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:41:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617629177] [2024-11-10 14:41:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617629177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:57,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042632217] [2024-11-10 14:41:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:57,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:41:57,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:41:57,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:41:57,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2024-11-10 14:41:57,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 235 transitions, 1249 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 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-11-10 14:41:57,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:57,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2024-11-10 14:41:57,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:58,368 INFO L124 PetriNetUnfolderBase]: 3064/8876 cut-off events. [2024-11-10 14:41:58,368 INFO L125 PetriNetUnfolderBase]: For 6898/7167 co-relation queries the response was YES. [2024-11-10 14:41:58,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24610 conditions, 8876 events. 3064/8876 cut-off events. For 6898/7167 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 88009 event pairs, 525 based on Foata normal form. 14/8317 useless extension candidates. Maximal degree in co-relation 23643. Up to 4183 conditions per place. [2024-11-10 14:41:58,425 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 135 selfloop transitions, 71 changer transitions 0/303 dead transitions. [2024-11-10 14:41:58,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 303 transitions, 2105 flow [2024-11-10 14:41:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 596 transitions. [2024-11-10 14:41:58,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.834733893557423 [2024-11-10 14:41:58,428 INFO L175 Difference]: Start difference. First operand has 138 places, 235 transitions, 1249 flow. Second operand 6 states and 596 transitions. [2024-11-10 14:41:58,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 303 transitions, 2105 flow [2024-11-10 14:41:58,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 303 transitions, 2087 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-10 14:41:58,487 INFO L231 Difference]: Finished difference. Result has 148 places, 301 transitions, 2011 flow [2024-11-10 14:41:58,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2011, PETRI_PLACES=148, PETRI_TRANSITIONS=301} [2024-11-10 14:41:58,488 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 29 predicate places. [2024-11-10 14:41:58,488 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 301 transitions, 2011 flow [2024-11-10 14:41:58,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 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-11-10 14:41:58,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:58,489 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:41:58,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:41:58,489 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:41:58,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -43737278, now seen corresponding path program 1 times [2024-11-10 14:41:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996726596] [2024-11-10 14:41:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 14:41:59,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:59,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996726596] [2024-11-10 14:41:59,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996726596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:41:59,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680316107] [2024-11-10 14:41:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:59,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:41:59,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:41:59,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:41:59,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:41:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:59,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 14:41:59,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:41:59,173 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-11-10 14:41:59,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 14:41:59,226 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-11-10 14:41:59,368 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 15 treesize of output 11 [2024-11-10 14:41:59,381 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 28 treesize of output 27 [2024-11-10 14:41:59,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:41:59,414 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 40 treesize of output 42 [2024-11-10 14:41:59,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:41:59,455 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 52 treesize of output 57 [2024-11-10 14:41:59,520 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 56 treesize of output 45 [2024-11-10 14:41:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 14:41:59,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:41:59,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_227) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_227) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_227) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_227) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)))) is different from false [2024-11-10 14:41:59,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (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|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_227) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_227) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_227) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_227) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-10 14:42:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 7 trivial. 1 not checked. [2024-11-10 14:42:03,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680316107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:42:03,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:42:03,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2024-11-10 14:42:03,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548508184] [2024-11-10 14:42:03,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:42:03,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 14:42:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:03,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 14:42:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=135, Unknown=10, NotChecked=50, Total=240 [2024-11-10 14:42:03,946 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 119 [2024-11-10 14:42:03,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 301 transitions, 2011 flow. Second operand has 16 states, 16 states have (on average 66.3125) internal successors, (1061), 16 states have internal predecessors, (1061), 0 states have call successors, (0), 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-11-10 14:42:03,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:03,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 119 [2024-11-10 14:42:03,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:06,597 INFO L124 PetriNetUnfolderBase]: 8340/18977 cut-off events. [2024-11-10 14:42:06,598 INFO L125 PetriNetUnfolderBase]: For 24331/24338 co-relation queries the response was YES. [2024-11-10 14:42:06,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58501 conditions, 18977 events. 8340/18977 cut-off events. For 24331/24338 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 188231 event pairs, 2776 based on Foata normal form. 172/18084 useless extension candidates. Maximal degree in co-relation 56532. Up to 8310 conditions per place. [2024-11-10 14:42:06,763 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 389 selfloop transitions, 36 changer transitions 0/492 dead transitions. [2024-11-10 14:42:06,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 492 transitions, 4297 flow [2024-11-10 14:42:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 14:42:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 14:42:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 968 transitions. [2024-11-10 14:42:06,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6257272139625081 [2024-11-10 14:42:06,767 INFO L175 Difference]: Start difference. First operand has 148 places, 301 transitions, 2011 flow. Second operand 13 states and 968 transitions. [2024-11-10 14:42:06,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 492 transitions, 4297 flow [2024-11-10 14:42:06,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 492 transitions, 4157 flow, removed 70 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:06,863 INFO L231 Difference]: Finished difference. Result has 159 places, 300 transitions, 1939 flow [2024-11-10 14:42:06,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1939, PETRI_PLACES=159, PETRI_TRANSITIONS=300} [2024-11-10 14:42:06,865 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 40 predicate places. [2024-11-10 14:42:06,865 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 300 transitions, 1939 flow [2024-11-10 14:42:06,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 66.3125) internal successors, (1061), 16 states have internal predecessors, (1061), 0 states have call successors, (0), 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-11-10 14:42:06,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:06,866 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2024-11-10 14:42:06,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 14:42:07,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-10 14:42:07,071 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:42:07,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1868850752, now seen corresponding path program 1 times [2024-11-10 14:42:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:07,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051087862] [2024-11-10 14:42:07,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:07,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:07,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051087862] [2024-11-10 14:42:07,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051087862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:07,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:07,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 14:42:07,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495964479] [2024-11-10 14:42:07,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:07,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:42:07,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:42:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:42:07,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 119 [2024-11-10 14:42:07,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 300 transitions, 1939 flow. Second operand has 11 states, 11 states have (on average 81.9090909090909) internal successors, (901), 11 states have internal predecessors, (901), 0 states have call successors, (0), 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-11-10 14:42:07,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:07,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 119 [2024-11-10 14:42:07,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:09,854 INFO L124 PetriNetUnfolderBase]: 5101/13113 cut-off events. [2024-11-10 14:42:09,854 INFO L125 PetriNetUnfolderBase]: For 18173/20127 co-relation queries the response was YES. [2024-11-10 14:42:09,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43921 conditions, 13113 events. 5101/13113 cut-off events. For 18173/20127 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 130011 event pairs, 578 based on Foata normal form. 314/12870 useless extension candidates. Maximal degree in co-relation 39987. Up to 3173 conditions per place. [2024-11-10 14:42:09,922 INFO L140 encePairwiseOnDemand]: 100/119 looper letters, 339 selfloop transitions, 262 changer transitions 6/689 dead transitions. [2024-11-10 14:42:09,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 689 transitions, 6033 flow [2024-11-10 14:42:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 14:42:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-10 14:42:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1629 transitions. [2024-11-10 14:42:09,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7605042016806722 [2024-11-10 14:42:09,925 INFO L175 Difference]: Start difference. First operand has 159 places, 300 transitions, 1939 flow. Second operand 18 states and 1629 transitions. [2024-11-10 14:42:09,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 689 transitions, 6033 flow [2024-11-10 14:42:09,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 689 transitions, 5889 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-10 14:42:09,971 INFO L231 Difference]: Finished difference. Result has 174 places, 506 transitions, 4575 flow [2024-11-10 14:42:09,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4575, PETRI_PLACES=174, PETRI_TRANSITIONS=506} [2024-11-10 14:42:09,972 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 55 predicate places. [2024-11-10 14:42:09,972 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 506 transitions, 4575 flow [2024-11-10 14:42:09,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.9090909090909) internal successors, (901), 11 states have internal predecessors, (901), 0 states have call successors, (0), 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-11-10 14:42:09,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:09,973 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:09,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:42:09,973 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:42:09,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash 972160517, now seen corresponding path program 1 times [2024-11-10 14:42:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:09,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488325762] [2024-11-10 14:42:09,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:42:10,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:10,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488325762] [2024-11-10 14:42:10,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488325762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:10,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:10,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 14:42:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100685881] [2024-11-10 14:42:10,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:10,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:42:10,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:10,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:42:10,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:42:10,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 119 [2024-11-10 14:42:10,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 506 transitions, 4575 flow. Second operand has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 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-11-10 14:42:10,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:10,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 119 [2024-11-10 14:42:10,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:12,731 INFO L124 PetriNetUnfolderBase]: 4487/12125 cut-off events. [2024-11-10 14:42:12,732 INFO L125 PetriNetUnfolderBase]: For 34250/34772 co-relation queries the response was YES. [2024-11-10 14:42:12,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48144 conditions, 12125 events. 4487/12125 cut-off events. For 34250/34772 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 122043 event pairs, 440 based on Foata normal form. 181/11735 useless extension candidates. Maximal degree in co-relation 46767. Up to 3248 conditions per place. [2024-11-10 14:42:12,812 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 495 selfloop transitions, 44 changer transitions 0/658 dead transitions. [2024-11-10 14:42:12,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 658 transitions, 7538 flow [2024-11-10 14:42:12,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 14:42:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 14:42:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1124 transitions. [2024-11-10 14:42:12,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7265675500969618 [2024-11-10 14:42:12,815 INFO L175 Difference]: Start difference. First operand has 174 places, 506 transitions, 4575 flow. Second operand 13 states and 1124 transitions. [2024-11-10 14:42:12,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 658 transitions, 7538 flow [2024-11-10 14:42:12,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 658 transitions, 7460 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-11-10 14:42:12,946 INFO L231 Difference]: Finished difference. Result has 180 places, 505 transitions, 4589 flow [2024-11-10 14:42:12,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4589, PETRI_PLACES=180, PETRI_TRANSITIONS=505} [2024-11-10 14:42:12,947 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 61 predicate places. [2024-11-10 14:42:12,947 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 505 transitions, 4589 flow [2024-11-10 14:42:12,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 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-11-10 14:42:12,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:12,948 INFO L204 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-11-10 14:42:12,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:42:12,949 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:42:12,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash 427001869, now seen corresponding path program 1 times [2024-11-10 14:42:12,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:12,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554407950] [2024-11-10 14:42:12,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:12,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:42:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554407950] [2024-11-10 14:42:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554407950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:13,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:13,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:13,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166813906] [2024-11-10 14:42:13,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:13,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:42:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:13,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:42:13,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:42:13,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 119 [2024-11-10 14:42:13,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 505 transitions, 4589 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 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-11-10 14:42:13,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:13,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 119 [2024-11-10 14:42:13,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:14,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread2of2ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_9, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_9, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} AuxVars[] AssignedVars[#race][376], [Black: 125#true, 161#true, Black: 132#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 131#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 133#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 134#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 118#true, 101#L1022-5true, Black: 142#(= |ULTIMATE.start_main_~i~1#1| 0), 45#L1036true, 589#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 154#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 156#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 153#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), 120#true, Black: 155#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 608#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 610#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 592#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 626#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 606#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 29#L1022-1true, 650#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 593#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 584#true, Black: 604#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 590#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 591#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 163#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), 151#true, Black: 594#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 129#true, 127#(= |#race~datas~0| 0)]) [2024-11-10 14:42:14,062 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-10 14:42:14,063 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-10 14:42:14,063 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-10 14:42:14,063 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-10 14:42:16,412 INFO L124 PetriNetUnfolderBase]: 9732/22289 cut-off events. [2024-11-10 14:42:16,412 INFO L125 PetriNetUnfolderBase]: For 74784/75778 co-relation queries the response was YES. [2024-11-10 14:42:16,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90861 conditions, 22289 events. 9732/22289 cut-off events. For 74784/75778 co-relation queries the response was YES. Maximal size of possible extension queue 1331. Compared 229506 event pairs, 1088 based on Foata normal form. 16/21144 useless extension candidates. Maximal degree in co-relation 88769. Up to 11105 conditions per place. [2024-11-10 14:42:16,692 INFO L140 encePairwiseOnDemand]: 100/119 looper letters, 362 selfloop transitions, 355 changer transitions 12/862 dead transitions. [2024-11-10 14:42:16,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 862 transitions, 9421 flow [2024-11-10 14:42:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2024-11-10 14:42:16,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8837535014005602 [2024-11-10 14:42:16,694 INFO L175 Difference]: Start difference. First operand has 180 places, 505 transitions, 4589 flow. Second operand 6 states and 631 transitions. [2024-11-10 14:42:16,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 862 transitions, 9421 flow [2024-11-10 14:42:17,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 862 transitions, 9185 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-10 14:42:17,085 INFO L231 Difference]: Finished difference. Result has 177 places, 780 transitions, 8340 flow [2024-11-10 14:42:17,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8340, PETRI_PLACES=177, PETRI_TRANSITIONS=780} [2024-11-10 14:42:17,086 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 58 predicate places. [2024-11-10 14:42:17,086 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 780 transitions, 8340 flow [2024-11-10 14:42:17,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 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-11-10 14:42:17,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:17,087 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 14:42:17,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:42:17,087 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:42:17,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1997039626, now seen corresponding path program 1 times [2024-11-10 14:42:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:17,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464036847] [2024-11-10 14:42:17,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:17,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:42:17,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:42:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:42:17,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:42:17,121 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:42:17,121 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-10 14:42:17,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-10 14:42:17,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-10 14:42:17,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-10 14:42:17,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-10 14:42:17,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-10 14:42:17,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-10 14:42:17,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-10 14:42:17,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-10 14:42:17,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-10 14:42:17,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-10 14:42:17,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:42:17,122 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:17,123 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:42:17,123 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:42:17,141 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:42:17,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 140 transitions, 307 flow [2024-11-10 14:42:17,166 INFO L124 PetriNetUnfolderBase]: 21/380 cut-off events. [2024-11-10 14:42:17,167 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 14:42:17,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 380 events. 21/380 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1076 event pairs, 1 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 238. Up to 16 conditions per place. [2024-11-10 14:42:17,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 140 transitions, 307 flow [2024-11-10 14:42:17,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 140 transitions, 307 flow [2024-11-10 14:42:17,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:42:17,170 INFO L333 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, 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;@5252107b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:42:17,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-10 14:42:17,171 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:42:17,171 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2024-11-10 14:42:17,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:42:17,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:17,172 INFO L204 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] [2024-11-10 14:42:17,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-10 14:42:17,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2060584546, now seen corresponding path program 1 times [2024-11-10 14:42:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:17,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208347225] [2024-11-10 14:42:17,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:17,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:17,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208347225] [2024-11-10 14:42:17,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208347225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:17,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:17,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:17,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532059951] [2024-11-10 14:42:17,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:17,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:17,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:17,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:17,202 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140 [2024-11-10 14:42:17,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 140 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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-11-10 14:42:17,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:17,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140 [2024-11-10 14:42:17,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:17,295 INFO L124 PetriNetUnfolderBase]: 90/1278 cut-off events. [2024-11-10 14:42:17,296 INFO L125 PetriNetUnfolderBase]: For 138/161 co-relation queries the response was YES. [2024-11-10 14:42:17,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 1278 events. 90/1278 cut-off events. For 138/161 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8348 event pairs, 81 based on Foata normal form. 21/1130 useless extension candidates. Maximal degree in co-relation 887. Up to 178 conditions per place. [2024-11-10 14:42:17,305 INFO L140 encePairwiseOnDemand]: 134/140 looper letters, 14 selfloop transitions, 2 changer transitions 1/136 dead transitions. [2024-11-10 14:42:17,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 136 transitions, 331 flow [2024-11-10 14:42:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2024-11-10 14:42:17,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-10 14:42:17,307 INFO L175 Difference]: Start difference. First operand has 141 places, 140 transitions, 307 flow. Second operand 3 states and 380 transitions. [2024-11-10 14:42:17,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 136 transitions, 331 flow [2024-11-10 14:42:17,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 136 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:17,309 INFO L231 Difference]: Finished difference. Result has 142 places, 135 transitions, 301 flow [2024-11-10 14:42:17,309 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=142, PETRI_TRANSITIONS=135} [2024-11-10 14:42:17,309 INFO L277 CegarLoopForPetriNet]: 141 programPoint places, 1 predicate places. [2024-11-10 14:42:17,310 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 135 transitions, 301 flow [2024-11-10 14:42:17,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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-11-10 14:42:17,311 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:17,311 INFO L204 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] [2024-11-10 14:42:17,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:42:17,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-10 14:42:17,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:17,312 INFO L85 PathProgramCache]: Analyzing trace with hash 466134441, now seen corresponding path program 1 times [2024-11-10 14:42:17,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:17,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120929326] [2024-11-10 14:42:17,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:17,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:17,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:17,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120929326] [2024-11-10 14:42:17,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120929326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:17,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:17,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:17,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669928996] [2024-11-10 14:42:17,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:17,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:17,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:17,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:17,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:17,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 140 [2024-11-10 14:42:17,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 135 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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-11-10 14:42:17,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:17,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 140 [2024-11-10 14:42:17,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:17,582 INFO L124 PetriNetUnfolderBase]: 307/2396 cut-off events. [2024-11-10 14:42:17,582 INFO L125 PetriNetUnfolderBase]: For 293/387 co-relation queries the response was YES. [2024-11-10 14:42:17,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3018 conditions, 2396 events. 307/2396 cut-off events. For 293/387 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19113 event pairs, 207 based on Foata normal form. 6/2181 useless extension candidates. Maximal degree in co-relation 2984. Up to 508 conditions per place. [2024-11-10 14:42:17,590 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 17 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2024-11-10 14:42:17,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 137 transitions, 359 flow [2024-11-10 14:42:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2024-11-10 14:42:17,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9023809523809524 [2024-11-10 14:42:17,592 INFO L175 Difference]: Start difference. First operand has 142 places, 135 transitions, 301 flow. Second operand 3 states and 379 transitions. [2024-11-10 14:42:17,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 137 transitions, 359 flow [2024-11-10 14:42:17,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:17,594 INFO L231 Difference]: Finished difference. Result has 138 places, 135 transitions, 317 flow [2024-11-10 14:42:17,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=138, PETRI_TRANSITIONS=135} [2024-11-10 14:42:17,595 INFO L277 CegarLoopForPetriNet]: 141 programPoint places, -3 predicate places. [2024-11-10 14:42:17,595 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 135 transitions, 317 flow [2024-11-10 14:42:17,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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-11-10 14:42:17,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:17,595 INFO L204 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] [2024-11-10 14:42:17,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:42:17,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-10 14:42:17,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:17,596 INFO L85 PathProgramCache]: Analyzing trace with hash -758819318, now seen corresponding path program 1 times [2024-11-10 14:42:17,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:17,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482841062] [2024-11-10 14:42:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:17,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482841062] [2024-11-10 14:42:17,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482841062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:17,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:17,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715455487] [2024-11-10 14:42:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:17,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:42:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:42:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:42:17,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 140 [2024-11-10 14:42:17,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 135 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 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-11-10 14:42:17,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:17,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 140 [2024-11-10 14:42:17,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:19,859 INFO L124 PetriNetUnfolderBase]: 10379/23876 cut-off events. [2024-11-10 14:42:19,859 INFO L125 PetriNetUnfolderBase]: For 1187/1187 co-relation queries the response was YES. [2024-11-10 14:42:19,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39921 conditions, 23876 events. 10379/23876 cut-off events. For 1187/1187 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 241527 event pairs, 6716 based on Foata normal form. 0/21814 useless extension candidates. Maximal degree in co-relation 32269. Up to 14165 conditions per place. [2024-11-10 14:42:19,959 INFO L140 encePairwiseOnDemand]: 121/140 looper letters, 37 selfloop transitions, 54 changer transitions 0/190 dead transitions. [2024-11-10 14:42:19,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 190 transitions, 621 flow [2024-11-10 14:42:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2024-11-10 14:42:19,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.830952380952381 [2024-11-10 14:42:19,961 INFO L175 Difference]: Start difference. First operand has 138 places, 135 transitions, 317 flow. Second operand 6 states and 698 transitions. [2024-11-10 14:42:19,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 190 transitions, 621 flow [2024-11-10 14:42:19,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 190 transitions, 621 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:19,964 INFO L231 Difference]: Finished difference. Result has 148 places, 188 transitions, 675 flow [2024-11-10 14:42:19,964 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=675, PETRI_PLACES=148, PETRI_TRANSITIONS=188} [2024-11-10 14:42:19,964 INFO L277 CegarLoopForPetriNet]: 141 programPoint places, 7 predicate places. [2024-11-10 14:42:19,964 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 188 transitions, 675 flow [2024-11-10 14:42:19,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 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-11-10 14:42:19,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:19,965 INFO L204 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] [2024-11-10 14:42:19,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:42:19,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-10 14:42:19,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1649643575, now seen corresponding path program 1 times [2024-11-10 14:42:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854116933] [2024-11-10 14:42:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:20,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:20,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854116933] [2024-11-10 14:42:20,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854116933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:20,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:20,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:20,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78627440] [2024-11-10 14:42:20,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:20,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:42:20,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:20,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:42:20,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:42:20,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140 [2024-11-10 14:42:20,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 188 transitions, 675 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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-11-10 14:42:20,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:20,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140 [2024-11-10 14:42:20,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:21,450 INFO L124 PetriNetUnfolderBase]: 4736/12247 cut-off events. [2024-11-10 14:42:21,451 INFO L125 PetriNetUnfolderBase]: For 3307/3804 co-relation queries the response was YES. [2024-11-10 14:42:21,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23586 conditions, 12247 events. 4736/12247 cut-off events. For 3307/3804 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 115157 event pairs, 1830 based on Foata normal form. 2/11578 useless extension candidates. Maximal degree in co-relation 19343. Up to 5581 conditions per place. [2024-11-10 14:42:21,504 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 16 selfloop transitions, 2 changer transitions 5/194 dead transitions. [2024-11-10 14:42:21,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 194 transitions, 733 flow [2024-11-10 14:42:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2024-11-10 14:42:21,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2024-11-10 14:42:21,506 INFO L175 Difference]: Start difference. First operand has 148 places, 188 transitions, 675 flow. Second operand 6 states and 744 transitions. [2024-11-10 14:42:21,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 194 transitions, 733 flow [2024-11-10 14:42:21,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 194 transitions, 733 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:21,522 INFO L231 Difference]: Finished difference. Result has 157 places, 189 transitions, 697 flow [2024-11-10 14:42:21,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=697, PETRI_PLACES=157, PETRI_TRANSITIONS=189} [2024-11-10 14:42:21,523 INFO L277 CegarLoopForPetriNet]: 141 programPoint places, 16 predicate places. [2024-11-10 14:42:21,523 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 189 transitions, 697 flow [2024-11-10 14:42:21,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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-11-10 14:42:21,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:21,523 INFO L204 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-11-10 14:42:21,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 14:42:21,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-10 14:42:21,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 195077501, now seen corresponding path program 1 times [2024-11-10 14:42:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230239841] [2024-11-10 14:42:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:21,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230239841] [2024-11-10 14:42:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230239841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:21,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:21,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:21,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511001712] [2024-11-10 14:42:21,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:21,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:42:21,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:21,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:42:21,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:42:21,787 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 140 [2024-11-10 14:42:21,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 189 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 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-11-10 14:42:21,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:21,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 140 [2024-11-10 14:42:21,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:25,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][292], [Black: 153#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 30#L1031-3true, 42#L1022-1true, 83#L1022-5true, 162#true, Black: 164#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#(= |#race~datas~0| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 151#true, Black: 166#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), 173#true, 51#L1022-4true, 140#true, Black: 147#true, 138#true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 142#true, Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-10 14:42:25,154 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-11-10 14:42:25,154 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-10 14:42:25,154 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-10 14:42:25,154 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-10 14:42:25,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][292], [Black: 153#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 30#L1031-3true, Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 42#L1022-1true, 83#L1022-5true, 162#true, Black: 164#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#(= |#race~datas~0| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 151#true, Black: 166#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), 173#true, 5#L1022-3true, 140#true, Black: 147#true, 138#true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 142#true, Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-10 14:42:25,487 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-11-10 14:42:25,487 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:42:25,487 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:42:25,487 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:42:25,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][238], [Black: 153#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 30#L1031-3true, Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 83#L1022-5true, 162#true, Black: 164#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 149#(= |#race~datas~0| 0), 151#true, Black: 166#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), 173#true, 140#true, 15#L1023true, Black: 147#true, 138#true, 46#L1022-5true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 142#true, Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-10 14:42:25,600 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-11-10 14:42:25,600 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:42:25,600 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:42:25,600 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:42:25,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][292], [Black: 153#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 30#L1031-3true, Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 42#L1022-1true, 83#L1022-5true, 162#true, Black: 164#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#(= |#race~datas~0| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 151#true, Black: 166#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), 173#true, 87#L1022-2true, 140#true, Black: 147#true, 138#true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 142#true, Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-10 14:42:25,623 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-11-10 14:42:25,624 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-10 14:42:25,624 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-10 14:42:25,624 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-10 14:42:28,576 INFO L124 PetriNetUnfolderBase]: 29121/67866 cut-off events. [2024-11-10 14:42:28,577 INFO L125 PetriNetUnfolderBase]: For 20004/23690 co-relation queries the response was YES. [2024-11-10 14:42:28,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151993 conditions, 67866 events. 29121/67866 cut-off events. For 20004/23690 co-relation queries the response was YES. Maximal size of possible extension queue 2114. Compared 782167 event pairs, 6580 based on Foata normal form. 74/62639 useless extension candidates. Maximal degree in co-relation 151889. Up to 28748 conditions per place. [2024-11-10 14:42:29,066 INFO L140 encePairwiseOnDemand]: 117/140 looper letters, 128 selfloop transitions, 118 changer transitions 0/351 dead transitions. [2024-11-10 14:42:29,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 351 transitions, 1961 flow [2024-11-10 14:42:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 755 transitions. [2024-11-10 14:42:29,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8988095238095238 [2024-11-10 14:42:29,068 INFO L175 Difference]: Start difference. First operand has 157 places, 189 transitions, 697 flow. Second operand 6 states and 755 transitions. [2024-11-10 14:42:29,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 351 transitions, 1961 flow [2024-11-10 14:42:29,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 351 transitions, 1949 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 14:42:29,180 INFO L231 Difference]: Finished difference. Result has 159 places, 306 transitions, 1758 flow [2024-11-10 14:42:29,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1758, PETRI_PLACES=159, PETRI_TRANSITIONS=306} [2024-11-10 14:42:29,180 INFO L277 CegarLoopForPetriNet]: 141 programPoint places, 18 predicate places. [2024-11-10 14:42:29,180 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 306 transitions, 1758 flow [2024-11-10 14:42:29,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 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-11-10 14:42:29,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:29,181 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:42:29,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 14:42:29,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-10 14:42:29,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:29,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1002292959, now seen corresponding path program 1 times [2024-11-10 14:42:29,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:29,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183907234] [2024-11-10 14:42:29,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:42:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183907234] [2024-11-10 14:42:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183907234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:29,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:29,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099831238] [2024-11-10 14:42:29,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:29,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:42:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:29,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:42:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:42:29,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140 [2024-11-10 14:42:29,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 306 transitions, 1758 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 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-11-10 14:42:29,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:29,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140 [2024-11-10 14:42:29,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:38,795 INFO L124 PetriNetUnfolderBase]: 34935/82425 cut-off events. [2024-11-10 14:42:38,795 INFO L125 PetriNetUnfolderBase]: For 74503/77123 co-relation queries the response was YES. [2024-11-10 14:42:39,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241287 conditions, 82425 events. 34935/82425 cut-off events. For 74503/77123 co-relation queries the response was YES. Maximal size of possible extension queue 2570. Compared 996150 event pairs, 8505 based on Foata normal form. 151/76862 useless extension candidates. Maximal degree in co-relation 231554. Up to 43128 conditions per place. [2024-11-10 14:42:39,418 INFO L140 encePairwiseOnDemand]: 121/140 looper letters, 192 selfloop transitions, 110 changer transitions 0/414 dead transitions. [2024-11-10 14:42:39,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 414 transitions, 3090 flow [2024-11-10 14:42:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2024-11-10 14:42:39,420 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.844047619047619 [2024-11-10 14:42:39,420 INFO L175 Difference]: Start difference. First operand has 159 places, 306 transitions, 1758 flow. Second operand 6 states and 709 transitions. [2024-11-10 14:42:39,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 414 transitions, 3090 flow [2024-11-10 14:42:39,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 414 transitions, 3072 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:39,973 INFO L231 Difference]: Finished difference. Result has 169 places, 411 transitions, 2985 flow [2024-11-10 14:42:39,973 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2985, PETRI_PLACES=169, PETRI_TRANSITIONS=411} [2024-11-10 14:42:39,973 INFO L277 CegarLoopForPetriNet]: 141 programPoint places, 28 predicate places. [2024-11-10 14:42:39,973 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 411 transitions, 2985 flow [2024-11-10 14:42:39,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 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-11-10 14:42:39,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:39,974 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:42:39,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 14:42:39,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-10 14:42:39,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:39,974 INFO L85 PathProgramCache]: Analyzing trace with hash 259343663, now seen corresponding path program 1 times [2024-11-10 14:42:39,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:39,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072840253] [2024-11-10 14:42:39,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:39,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat