./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d 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-index-bitmask-race.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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:05:27,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:05:27,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:05:27,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:05:27,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:05:27,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:05:27,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:05:27,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:05:27,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:05:27,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:05:27,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:05:27,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:05:27,400 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:05:27,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:05:27,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:05:27,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:05:27,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:05:27,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:05:27,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:05:27,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:05:27,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:05:27,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:05:27,406 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:05:27,411 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:05:27,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:05:27,412 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:05:27,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:05:27,412 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:05:27,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:05:27,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:05:27,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:05:27,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:05:27,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:05:27,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:05:27,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:05:27,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:05:27,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:05:27,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:05:27,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:05:27,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:05:27,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:05:27,417 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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2024-11-09 07:05:27,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:05:27,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:05:27,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:05:27,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:05:27,718 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:05:27,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-09 07:05:29,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:05:29,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:05:29,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-09 07:05:29,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afda4aca/7842dcc6da7744d8a2aca67420107022/FLAG3e831c98d [2024-11-09 07:05:29,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afda4aca/7842dcc6da7744d8a2aca67420107022 [2024-11-09 07:05:29,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:05:29,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:05:29,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:05:29,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:05:29,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:05:29,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:05:29" (1/1) ... [2024-11-09 07:05:29,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574dc1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:29, skipping insertion in model container [2024-11-09 07:05:29,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:05:29" (1/1) ... [2024-11-09 07:05:29,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:05:30,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:05:30,386 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:05:30,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:05:30,502 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:05:30,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30 WrapperNode [2024-11-09 07:05:30,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:05:30,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:05:30,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:05:30,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:05:30,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,566 INFO L138 Inliner]: procedures = 273, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-11-09 07:05:30,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:05:30,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:05:30,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:05:30,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:05:30,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:05:30,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:05:30,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:05:30,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:05:30,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:05:30,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:05:30,714 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-09 07:05:30,732 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-09 07:05:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:05:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:05:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:05:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:05:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-09 07:05:30,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-09 07:05:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:05:30,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:05:30,783 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:05:30,963 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:05:30,965 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:05:31,358 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:05:31,359 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:05:31,400 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:05:31,400 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:05:31,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:31 BoogieIcfgContainer [2024-11-09 07:05:31,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:05:31,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:05:31,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:05:31,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:05:31,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:05:29" (1/3) ... [2024-11-09 07:05:31,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2b53e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:05:31, skipping insertion in model container [2024-11-09 07:05:31,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30" (2/3) ... [2024-11-09 07:05:31,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2b53e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:05:31, skipping insertion in model container [2024-11-09 07:05:31,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:31" (3/3) ... [2024-11-09 07:05:31,412 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2024-11-09 07:05:31,437 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:05:31,437 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-09 07:05:31,437 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:05:31,529 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 07:05:31,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 187 transitions, 381 flow [2024-11-09 07:05:31,669 INFO L124 PetriNetUnfolderBase]: 30/281 cut-off events. [2024-11-09 07:05:31,669 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 07:05:31,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 281 events. 30/281 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 611 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2024-11-09 07:05:31,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 187 transitions, 381 flow [2024-11-09 07:05:31,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 187 transitions, 381 flow [2024-11-09 07:05:31,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:05:31,712 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;@6b5e5b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:05:31,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-09 07:05:31,724 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:05:31,725 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-09 07:05:31,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:05:31,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:31,726 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] [2024-11-09 07:05:31,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:31,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1429972780, now seen corresponding path program 1 times [2024-11-09 07:05:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:31,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708127647] [2024-11-09 07:05:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:32,001 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-09 07:05:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708127647] [2024-11-09 07:05:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708127647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:32,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:32,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447925382] [2024-11-09 07:05:32,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:32,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:32,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:32,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 187 [2024-11-09 07:05:32,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 187 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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-09 07:05:32,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:32,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 187 [2024-11-09 07:05:32,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:32,294 INFO L124 PetriNetUnfolderBase]: 59/540 cut-off events. [2024-11-09 07:05:32,295 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2024-11-09 07:05:32,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 540 events. 59/540 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2185 event pairs, 2 based on Foata normal form. 6/448 useless extension candidates. Maximal degree in co-relation 448. Up to 57 conditions per place. [2024-11-09 07:05:32,305 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 15 selfloop transitions, 2 changer transitions 2/182 dead transitions. [2024-11-09 07:05:32,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 182 transitions, 405 flow [2024-11-09 07:05:32,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2024-11-09 07:05:32,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2024-11-09 07:05:32,329 INFO L175 Difference]: Start difference. First operand has 172 places, 187 transitions, 381 flow. Second operand 3 states and 517 transitions. [2024-11-09 07:05:32,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 182 transitions, 405 flow [2024-11-09 07:05:32,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 182 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:32,340 INFO L231 Difference]: Finished difference. Result has 173 places, 180 transitions, 371 flow [2024-11-09 07:05:32,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=173, PETRI_TRANSITIONS=180} [2024-11-09 07:05:32,349 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2024-11-09 07:05:32,350 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 180 transitions, 371 flow [2024-11-09 07:05:32,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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-09 07:05:32,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:32,351 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-09 07:05:32,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:05:32,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:32,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:32,353 INFO L85 PathProgramCache]: Analyzing trace with hash -493487120, now seen corresponding path program 1 times [2024-11-09 07:05:32,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:32,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947831985] [2024-11-09 07:05:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:32,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:32,479 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-09 07:05:32,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:32,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947831985] [2024-11-09 07:05:32,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947831985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:32,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:32,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:32,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912726346] [2024-11-09 07:05:32,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:32,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:32,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:32,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:32,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 187 [2024-11-09 07:05:32,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 180 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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-09 07:05:32,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:32,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 187 [2024-11-09 07:05:32,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:32,700 INFO L124 PetriNetUnfolderBase]: 128/705 cut-off events. [2024-11-09 07:05:32,701 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:05:32,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 705 events. 128/705 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3405 event pairs, 6 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 819. Up to 96 conditions per place. [2024-11-09 07:05:32,714 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 27 selfloop transitions, 8 changer transitions 0/195 dead transitions. [2024-11-09 07:05:32,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 195 transitions, 471 flow [2024-11-09 07:05:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2024-11-09 07:05:32,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2024-11-09 07:05:32,720 INFO L175 Difference]: Start difference. First operand has 173 places, 180 transitions, 371 flow. Second operand 3 states and 527 transitions. [2024-11-09 07:05:32,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 195 transitions, 471 flow [2024-11-09 07:05:32,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 195 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:05:32,729 INFO L231 Difference]: Finished difference. Result has 173 places, 188 transitions, 437 flow [2024-11-09 07:05:32,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=173, PETRI_TRANSITIONS=188} [2024-11-09 07:05:32,730 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2024-11-09 07:05:32,730 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 188 transitions, 437 flow [2024-11-09 07:05:32,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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-09 07:05:32,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:32,731 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] [2024-11-09 07:05:32,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:05:32,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:32,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:32,733 INFO L85 PathProgramCache]: Analyzing trace with hash 11869524, now seen corresponding path program 1 times [2024-11-09 07:05:32,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:32,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202399579] [2024-11-09 07:05:32,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:32,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:32,809 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-09 07:05:32,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202399579] [2024-11-09 07:05:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202399579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:32,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145656880] [2024-11-09 07:05:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:32,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 187 [2024-11-09 07:05:32,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 188 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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-09 07:05:32,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:32,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 187 [2024-11-09 07:05:32,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:32,978 INFO L124 PetriNetUnfolderBase]: 116/769 cut-off events. [2024-11-09 07:05:32,979 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-09 07:05:32,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 769 events. 116/769 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4003 event pairs, 10 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 782. Up to 64 conditions per place. [2024-11-09 07:05:32,988 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 19 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2024-11-09 07:05:32,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 193 transitions, 489 flow [2024-11-09 07:05:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2024-11-09 07:05:32,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9340463458110517 [2024-11-09 07:05:32,992 INFO L175 Difference]: Start difference. First operand has 173 places, 188 transitions, 437 flow. Second operand 3 states and 524 transitions. [2024-11-09 07:05:32,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 193 transitions, 489 flow [2024-11-09 07:05:32,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 193 transitions, 473 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:05:33,017 INFO L231 Difference]: Finished difference. Result has 172 places, 188 transitions, 431 flow [2024-11-09 07:05:33,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=172, PETRI_TRANSITIONS=188} [2024-11-09 07:05:33,019 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 0 predicate places. [2024-11-09 07:05:33,019 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 188 transitions, 431 flow [2024-11-09 07:05:33,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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-09 07:05:33,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:33,020 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] [2024-11-09 07:05:33,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:05:33,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:33,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash 793688972, now seen corresponding path program 1 times [2024-11-09 07:05:33,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:33,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378974112] [2024-11-09 07:05:33,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:33,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:33,195 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-09 07:05:33,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:33,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378974112] [2024-11-09 07:05:33,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378974112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:33,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:33,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:33,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388903962] [2024-11-09 07:05:33,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:33,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:05:33,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:33,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:05:33,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:05:33,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 187 [2024-11-09 07:05:33,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 188 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 0 states have call successors, (0), 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-09 07:05:33,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:33,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 187 [2024-11-09 07:05:33,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:33,432 INFO L124 PetriNetUnfolderBase]: 103/671 cut-off events. [2024-11-09 07:05:33,433 INFO L125 PetriNetUnfolderBase]: For 25/40 co-relation queries the response was YES. [2024-11-09 07:05:33,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 671 events. 103/671 cut-off events. For 25/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3301 event pairs, 15 based on Foata normal form. 2/565 useless extension candidates. Maximal degree in co-relation 657. Up to 75 conditions per place. [2024-11-09 07:05:33,438 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 25 selfloop transitions, 2 changer transitions 5/200 dead transitions. [2024-11-09 07:05:33,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 200 transitions, 519 flow [2024-11-09 07:05:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1011 transitions. [2024-11-09 07:05:33,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9010695187165776 [2024-11-09 07:05:33,443 INFO L175 Difference]: Start difference. First operand has 172 places, 188 transitions, 431 flow. Second operand 6 states and 1011 transitions. [2024-11-09 07:05:33,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 200 transitions, 519 flow [2024-11-09 07:05:33,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 200 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:33,449 INFO L231 Difference]: Finished difference. Result has 181 places, 188 transitions, 449 flow [2024-11-09 07:05:33,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=181, PETRI_TRANSITIONS=188} [2024-11-09 07:05:33,452 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2024-11-09 07:05:33,452 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 188 transitions, 449 flow [2024-11-09 07:05:33,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 0 states have call successors, (0), 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-09 07:05:33,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:33,453 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, 1, 1, 1] [2024-11-09 07:05:33,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:05:33,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:33,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:33,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2140868580, now seen corresponding path program 1 times [2024-11-09 07:05:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:33,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742761958] [2024-11-09 07:05:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:33,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:33,557 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-09 07:05:33,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:33,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742761958] [2024-11-09 07:05:33,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742761958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:33,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:33,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:05:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190091951] [2024-11-09 07:05:33,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:33,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:33,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:33,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:33,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:33,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 187 [2024-11-09 07:05:33,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 188 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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-09 07:05:33,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:33,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 187 [2024-11-09 07:05:33,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:33,690 INFO L124 PetriNetUnfolderBase]: 104/631 cut-off events. [2024-11-09 07:05:33,690 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-09 07:05:33,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 631 events. 104/631 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2775 event pairs, 11 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 725. Up to 74 conditions per place. [2024-11-09 07:05:33,695 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 17 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-11-09 07:05:33,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 194 transitions, 499 flow [2024-11-09 07:05:33,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2024-11-09 07:05:33,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9447415329768271 [2024-11-09 07:05:33,697 INFO L175 Difference]: Start difference. First operand has 181 places, 188 transitions, 449 flow. Second operand 3 states and 530 transitions. [2024-11-09 07:05:33,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 194 transitions, 499 flow [2024-11-09 07:05:33,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 485 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-09 07:05:33,703 INFO L231 Difference]: Finished difference. Result has 176 places, 189 transitions, 447 flow [2024-11-09 07:05:33,703 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=173, 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=3, PETRI_FLOW=447, PETRI_PLACES=176, PETRI_TRANSITIONS=189} [2024-11-09 07:05:33,705 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 4 predicate places. [2024-11-09 07:05:33,705 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 189 transitions, 447 flow [2024-11-09 07:05:33,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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-09 07:05:33,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:33,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:33,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:05:33,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:33,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash -543783968, now seen corresponding path program 1 times [2024-11-09 07:05:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581595875] [2024-11-09 07:05:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:33,802 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-09 07:05:33,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:33,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581595875] [2024-11-09 07:05:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581595875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:33,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:33,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:05:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743179756] [2024-11-09 07:05:33,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:33,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:05:33,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:33,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:05:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:05:33,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 187 [2024-11-09 07:05:33,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 189 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-09 07:05:33,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:33,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 187 [2024-11-09 07:05:33,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:33,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [113#L1058-11true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 198#true, Black: 183#true, 173#true, 202#true]) [2024-11-09 07:05:33,991 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2024-11-09 07:05:33,991 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-09 07:05:33,991 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-09 07:05:33,991 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-09 07:05:33,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 114#L1058-14true, 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 198#true, Black: 183#true, 173#true, 202#true]) [2024-11-09 07:05:33,997 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2024-11-09 07:05:33,997 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-11-09 07:05:33,998 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-11-09 07:05:33,998 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-09 07:05:34,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), 99#L1058-27true, Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, 148#L1048-16true, Black: 183#true, 173#true, 202#true]) [2024-11-09 07:05:34,026 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2024-11-09 07:05:34,026 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2024-11-09 07:05:34,026 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-11-09 07:05:34,026 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-11-09 07:05:34,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][168], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 67#L1059-10true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 148#L1048-16true, 173#true, 202#true]) [2024-11-09 07:05:34,050 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-11-09 07:05:34,050 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-09 07:05:34,050 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-09 07:05:34,050 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-11-09 07:05:34,078 INFO L124 PetriNetUnfolderBase]: 211/1003 cut-off events. [2024-11-09 07:05:34,079 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-09 07:05:34,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 1003 events. 211/1003 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5778 event pairs, 22 based on Foata normal form. 1/884 useless extension candidates. Maximal degree in co-relation 1275. Up to 105 conditions per place. [2024-11-09 07:05:34,086 INFO L140 encePairwiseOnDemand]: 174/187 looper letters, 36 selfloop transitions, 13 changer transitions 0/214 dead transitions. [2024-11-09 07:05:34,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 214 transitions, 597 flow [2024-11-09 07:05:34,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:05:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 07:05:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 690 transitions. [2024-11-09 07:05:34,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9224598930481284 [2024-11-09 07:05:34,089 INFO L175 Difference]: Start difference. First operand has 176 places, 189 transitions, 447 flow. Second operand 4 states and 690 transitions. [2024-11-09 07:05:34,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 214 transitions, 597 flow [2024-11-09 07:05:34,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 214 transitions, 595 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:05:34,094 INFO L231 Difference]: Finished difference. Result has 181 places, 200 transitions, 545 flow [2024-11-09 07:05:34,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=545, PETRI_PLACES=181, PETRI_TRANSITIONS=200} [2024-11-09 07:05:34,098 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2024-11-09 07:05:34,098 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 200 transitions, 545 flow [2024-11-09 07:05:34,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-09 07:05:34,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:34,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:34,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:05:34,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:34,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash -403311547, now seen corresponding path program 1 times [2024-11-09 07:05:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:34,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546183783] [2024-11-09 07:05:34,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:34,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:34,266 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-09 07:05:34,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:34,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546183783] [2024-11-09 07:05:34,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546183783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:34,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:34,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:05:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763387697] [2024-11-09 07:05:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:34,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:05:34,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:05:34,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:05:34,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 187 [2024-11-09 07:05:34,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 200 transitions, 545 flow. Second operand has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 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-09 07:05:34,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:34,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 187 [2024-11-09 07:05:34,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:34,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][194], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 67#L1059-10true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, Black: 183#true, 173#true, 202#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0)))]) [2024-11-09 07:05:34,450 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-11-09 07:05:34,450 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-09 07:05:34,450 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-11-09 07:05:34,450 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-09 07:05:34,503 INFO L124 PetriNetUnfolderBase]: 228/1120 cut-off events. [2024-11-09 07:05:34,503 INFO L125 PetriNetUnfolderBase]: For 411/435 co-relation queries the response was YES. [2024-11-09 07:05:34,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 1120 events. 228/1120 cut-off events. For 411/435 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6864 event pairs, 18 based on Foata normal form. 5/991 useless extension candidates. Maximal degree in co-relation 1632. Up to 189 conditions per place. [2024-11-09 07:05:34,512 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 34 selfloop transitions, 9 changer transitions 0/218 dead transitions. [2024-11-09 07:05:34,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 218 transitions, 701 flow [2024-11-09 07:05:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:05:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 07:05:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2024-11-09 07:05:34,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9278074866310161 [2024-11-09 07:05:34,515 INFO L175 Difference]: Start difference. First operand has 181 places, 200 transitions, 545 flow. Second operand 4 states and 694 transitions. [2024-11-09 07:05:34,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 218 transitions, 701 flow [2024-11-09 07:05:34,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 218 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:34,521 INFO L231 Difference]: Finished difference. Result has 186 places, 206 transitions, 624 flow [2024-11-09 07:05:34,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=624, PETRI_PLACES=186, PETRI_TRANSITIONS=206} [2024-11-09 07:05:34,523 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 14 predicate places. [2024-11-09 07:05:34,523 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 206 transitions, 624 flow [2024-11-09 07:05:34,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 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-09 07:05:34,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:34,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:34,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:05:34,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:34,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:34,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1077689753, now seen corresponding path program 1 times [2024-11-09 07:05:34,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:34,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323096634] [2024-11-09 07:05:34,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:34,621 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-09 07:05:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:34,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323096634] [2024-11-09 07:05:34,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323096634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:34,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:34,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:05:34,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765310759] [2024-11-09 07:05:34,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:34,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:05:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:05:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:05:34,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 187 [2024-11-09 07:05:34,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 206 transitions, 624 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-09 07:05:34,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:34,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 187 [2024-11-09 07:05:34,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:34,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][189], [113#L1058-11true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2024-11-09 07:05:34,789 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2024-11-09 07:05:34,790 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-09 07:05:34,790 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-09 07:05:34,790 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-09 07:05:34,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 67#L1059-10true, Black: 183#true, 202#true]) [2024-11-09 07:05:34,841 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-11-09 07:05:34,841 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-09 07:05:34,841 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-09 07:05:34,841 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-11-09 07:05:34,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][175], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 47#L1058-36true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, 202#true]) [2024-11-09 07:05:34,845 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-11-09 07:05:34,845 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:34,845 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-09 07:05:34,845 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:34,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][169], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, 95#L1059-16true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2024-11-09 07:05:34,852 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is not cut-off event [2024-11-09 07:05:34,852 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-09 07:05:34,852 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-09 07:05:34,852 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-09 07:05:34,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][169], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 162#L1059-20true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 180#(= |#race~threads_mask~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2024-11-09 07:05:34,873 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-11-09 07:05:34,873 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-11-09 07:05:34,873 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-11-09 07:05:34,873 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-11-09 07:05:34,898 INFO L124 PetriNetUnfolderBase]: 289/1275 cut-off events. [2024-11-09 07:05:34,898 INFO L125 PetriNetUnfolderBase]: For 921/1011 co-relation queries the response was YES. [2024-11-09 07:05:34,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 1275 events. 289/1275 cut-off events. For 921/1011 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7941 event pairs, 26 based on Foata normal form. 27/1151 useless extension candidates. Maximal degree in co-relation 2184. Up to 181 conditions per place. [2024-11-09 07:05:34,910 INFO L140 encePairwiseOnDemand]: 177/187 looper letters, 39 selfloop transitions, 18 changer transitions 0/226 dead transitions. [2024-11-09 07:05:34,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 226 transitions, 821 flow [2024-11-09 07:05:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:05:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 07:05:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions. [2024-11-09 07:05:34,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9211229946524064 [2024-11-09 07:05:34,912 INFO L175 Difference]: Start difference. First operand has 186 places, 206 transitions, 624 flow. Second operand 4 states and 689 transitions. [2024-11-09 07:05:34,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 226 transitions, 821 flow [2024-11-09 07:05:34,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 226 transitions, 821 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:34,919 INFO L231 Difference]: Finished difference. Result has 191 places, 212 transitions, 734 flow [2024-11-09 07:05:34,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=734, PETRI_PLACES=191, PETRI_TRANSITIONS=212} [2024-11-09 07:05:34,920 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 19 predicate places. [2024-11-09 07:05:34,920 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 212 transitions, 734 flow [2024-11-09 07:05:34,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-09 07:05:34,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:34,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:34,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:05:34,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:34,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1584821290, now seen corresponding path program 1 times [2024-11-09 07:05:34,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:34,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377347351] [2024-11-09 07:05:34,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:34,981 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-09 07:05:34,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:34,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377347351] [2024-11-09 07:05:34,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377347351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:34,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:34,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:05:34,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060986488] [2024-11-09 07:05:34,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:34,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:05:34,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:34,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:05:34,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:05:35,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 187 [2024-11-09 07:05:35,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 212 transitions, 734 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-09 07:05:35,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:35,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 187 [2024-11-09 07:05:35,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:35,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [113#L1058-11true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-09 07:05:35,159 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2024-11-09 07:05:35,159 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-09 07:05:35,159 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-09 07:05:35,159 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-11-09 07:05:35,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, 67#L1059-10true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-09 07:05:35,211 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-11-09 07:05:35,211 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-09 07:05:35,211 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-09 07:05:35,211 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-09 07:05:35,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][173], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 47#L1058-36true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-09 07:05:35,218 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-09 07:05:35,218 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-09 07:05:35,218 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:35,218 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-09 07:05:35,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][167], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-09 07:05:35,226 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-09 07:05:35,226 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:35,226 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-09 07:05:35,226 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-09 07:05:35,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][167], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 162#L1059-20true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 180#(= |#race~threads_mask~0| 0), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-09 07:05:35,244 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-11-09 07:05:35,244 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-09 07:05:35,244 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 07:05:35,244 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 07:05:35,267 INFO L124 PetriNetUnfolderBase]: 287/1265 cut-off events. [2024-11-09 07:05:35,267 INFO L125 PetriNetUnfolderBase]: For 1605/1711 co-relation queries the response was YES. [2024-11-09 07:05:35,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 1265 events. 287/1265 cut-off events. For 1605/1711 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7857 event pairs, 27 based on Foata normal form. 29/1145 useless extension candidates. Maximal degree in co-relation 2466. Up to 188 conditions per place. [2024-11-09 07:05:35,279 INFO L140 encePairwiseOnDemand]: 177/187 looper letters, 39 selfloop transitions, 22 changer transitions 0/230 dead transitions. [2024-11-09 07:05:35,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 230 transitions, 940 flow [2024-11-09 07:05:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:05:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 07:05:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions. [2024-11-09 07:05:35,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9211229946524064 [2024-11-09 07:05:35,281 INFO L175 Difference]: Start difference. First operand has 191 places, 212 transitions, 734 flow. Second operand 4 states and 689 transitions. [2024-11-09 07:05:35,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 230 transitions, 940 flow [2024-11-09 07:05:35,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 230 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:05:35,289 INFO L231 Difference]: Finished difference. Result has 195 places, 217 transitions, 836 flow [2024-11-09 07:05:35,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=836, PETRI_PLACES=195, PETRI_TRANSITIONS=217} [2024-11-09 07:05:35,291 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 23 predicate places. [2024-11-09 07:05:35,291 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 217 transitions, 836 flow [2024-11-09 07:05:35,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-09 07:05:35,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:35,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:35,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:05:35,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:35,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:35,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1207538559, now seen corresponding path program 1 times [2024-11-09 07:05:35,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:35,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830232243] [2024-11-09 07:05:35,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:35,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:35,388 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-09 07:05:35,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830232243] [2024-11-09 07:05:35,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830232243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:35,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:35,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:05:35,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811887550] [2024-11-09 07:05:35,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:35,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:05:35,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:35,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:05:35,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:05:35,466 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2024-11-09 07:05:35,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 217 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 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-09 07:05:35,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:35,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2024-11-09 07:05:35,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:35,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][175], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 47#L1058-36true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-09 07:05:35,654 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-09 07:05:35,654 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:35,655 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-09 07:05:35,655 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-09 07:05:35,729 INFO L124 PetriNetUnfolderBase]: 324/1351 cut-off events. [2024-11-09 07:05:35,730 INFO L125 PetriNetUnfolderBase]: For 2684/2842 co-relation queries the response was YES. [2024-11-09 07:05:35,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 1351 events. 324/1351 cut-off events. For 2684/2842 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8507 event pairs, 28 based on Foata normal form. 27/1227 useless extension candidates. Maximal degree in co-relation 2960. Up to 288 conditions per place. [2024-11-09 07:05:35,744 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 41 selfloop transitions, 18 changer transitions 0/237 dead transitions. [2024-11-09 07:05:35,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 237 transitions, 1056 flow [2024-11-09 07:05:35,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:05:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 07:05:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2024-11-09 07:05:35,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9278074866310161 [2024-11-09 07:05:35,746 INFO L175 Difference]: Start difference. First operand has 195 places, 217 transitions, 836 flow. Second operand 4 states and 694 transitions. [2024-11-09 07:05:35,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 237 transitions, 1056 flow [2024-11-09 07:05:35,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 237 transitions, 1033 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:05:35,759 INFO L231 Difference]: Finished difference. Result has 199 places, 223 transitions, 931 flow [2024-11-09 07:05:35,760 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=931, PETRI_PLACES=199, PETRI_TRANSITIONS=223} [2024-11-09 07:05:35,761 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 27 predicate places. [2024-11-09 07:05:35,762 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 223 transitions, 931 flow [2024-11-09 07:05:35,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 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-09 07:05:35,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:35,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:35,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:05:35,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:35,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:35,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1174291803, now seen corresponding path program 1 times [2024-11-09 07:05:35,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:35,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092326184] [2024-11-09 07:05:35,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:35,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:35,808 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-09 07:05:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092326184] [2024-11-09 07:05:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092326184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:35,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:35,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279481122] [2024-11-09 07:05:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:35,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:35,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:35,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:35,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 187 [2024-11-09 07:05:35,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 223 transitions, 931 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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-09 07:05:35,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:35,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 187 [2024-11-09 07:05:35,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:35,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][169], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 223#(not (= ~threads_mask~0 0)), 235#true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 200#(<= (+ ~threads_mask~0 1) 0), 47#L1058-36true, Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-09 07:05:35,955 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-09 07:05:35,955 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-09 07:05:35,955 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:35,955 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-09 07:05:35,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L1059-15-->L1059-16: Formula: (= v_~threads_mask~0_22 |v_ULTIMATE.start_main_#t~bitwise18#1_6|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} OutVars{~threads_mask~0=v_~threads_mask~0_22, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} AuxVars[] AssignedVars[~threads_mask~0][205], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 235#true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-09 07:05:35,967 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-09 07:05:35,967 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-09 07:05:35,967 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:35,967 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-09 07:05:36,029 INFO L124 PetriNetUnfolderBase]: 323/1495 cut-off events. [2024-11-09 07:05:36,029 INFO L125 PetriNetUnfolderBase]: For 1851/1901 co-relation queries the response was YES. [2024-11-09 07:05:36,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 1495 events. 323/1495 cut-off events. For 1851/1901 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10546 event pairs, 40 based on Foata normal form. 7/1339 useless extension candidates. Maximal degree in co-relation 2849. Up to 266 conditions per place. [2024-11-09 07:05:36,043 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 29 selfloop transitions, 7 changer transitions 0/230 dead transitions. [2024-11-09 07:05:36,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 230 transitions, 1023 flow [2024-11-09 07:05:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2024-11-09 07:05:36,045 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9197860962566845 [2024-11-09 07:05:36,045 INFO L175 Difference]: Start difference. First operand has 199 places, 223 transitions, 931 flow. Second operand 3 states and 516 transitions. [2024-11-09 07:05:36,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 230 transitions, 1023 flow [2024-11-09 07:05:36,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 230 transitions, 1007 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:05:36,055 INFO L231 Difference]: Finished difference. Result has 202 places, 228 transitions, 971 flow [2024-11-09 07:05:36,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=971, PETRI_PLACES=202, PETRI_TRANSITIONS=228} [2024-11-09 07:05:36,056 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 30 predicate places. [2024-11-09 07:05:36,056 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 228 transitions, 971 flow [2024-11-09 07:05:36,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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-09 07:05:36,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:36,057 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, 1, 1, 1, 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-09 07:05:36,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:05:36,058 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:36,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:36,058 INFO L85 PathProgramCache]: Analyzing trace with hash 330580917, now seen corresponding path program 1 times [2024-11-09 07:05:36,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:36,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269261808] [2024-11-09 07:05:36,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:36,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:36,555 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-09 07:05:36,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:36,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269261808] [2024-11-09 07:05:36,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269261808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:36,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:36,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:36,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111422554] [2024-11-09 07:05:36,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:36,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:36,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 187 [2024-11-09 07:05:36,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 228 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 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-09 07:05:36,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:36,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 187 [2024-11-09 07:05:36,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:37,034 INFO L124 PetriNetUnfolderBase]: 463/2077 cut-off events. [2024-11-09 07:05:37,034 INFO L125 PetriNetUnfolderBase]: For 2035/2056 co-relation queries the response was YES. [2024-11-09 07:05:37,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4082 conditions, 2077 events. 463/2077 cut-off events. For 2035/2056 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 15343 event pairs, 84 based on Foata normal form. 6/1838 useless extension candidates. Maximal degree in co-relation 3846. Up to 375 conditions per place. [2024-11-09 07:05:37,056 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 42 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2024-11-09 07:05:37,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 257 transitions, 1157 flow [2024-11-09 07:05:37,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 973 transitions. [2024-11-09 07:05:37,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8672014260249554 [2024-11-09 07:05:37,059 INFO L175 Difference]: Start difference. First operand has 202 places, 228 transitions, 971 flow. Second operand 6 states and 973 transitions. [2024-11-09 07:05:37,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 257 transitions, 1157 flow [2024-11-09 07:05:37,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 257 transitions, 1143 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:05:37,071 INFO L231 Difference]: Finished difference. Result has 210 places, 249 transitions, 1107 flow [2024-11-09 07:05:37,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1107, PETRI_PLACES=210, PETRI_TRANSITIONS=249} [2024-11-09 07:05:37,073 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 38 predicate places. [2024-11-09 07:05:37,073 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 249 transitions, 1107 flow [2024-11-09 07:05:37,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 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-09 07:05:37,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:37,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:37,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:05:37,074 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:37,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash -231671054, now seen corresponding path program 1 times [2024-11-09 07:05:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:37,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078732788] [2024-11-09 07:05:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:37,593 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-09 07:05:37,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:37,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078732788] [2024-11-09 07:05:37,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078732788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:37,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:37,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328054663] [2024-11-09 07:05:37,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:37,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:37,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:37,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:37,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 187 [2024-11-09 07:05:37,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 249 transitions, 1107 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 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-09 07:05:37,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:37,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 187 [2024-11-09 07:05:37,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:37,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L1048-7-->L1048-10: Formula: (and (not (= v_~threads_mask~0_26 0)) (not (= |v_threadThread1of1ForFork0_#t~bitwise5_7| v_~threads_mask~0_26))) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_26} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_26} AuxVars[] AssignedVars[][169], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 202#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 223#(not (= ~threads_mask~0 0)), 204#(not (= ~threads_mask~0 0)), Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 83#L1048-10true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, 217#(not (= ~threads_mask~0 0)), Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2024-11-09 07:05:37,941 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-11-09 07:05:37,941 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-09 07:05:37,941 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-09 07:05:37,941 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-09 07:05:37,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2024-11-09 07:05:37,947 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-09 07:05:37,947 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:37,947 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:37,947 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-09 07:05:37,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L1059-15-->L1059-16: Formula: (= v_~threads_mask~0_22 |v_ULTIMATE.start_main_#t~bitwise18#1_6|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} OutVars{~threads_mask~0=v_~threads_mask~0_22, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} AuxVars[] AssignedVars[~threads_mask~0][248], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2024-11-09 07:05:37,959 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-09 07:05:37,959 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:37,959 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-09 07:05:37,959 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-09 07:05:37,969 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), 148#L1048-16true, Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2024-11-09 07:05:37,970 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-11-09 07:05:37,970 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-11-09 07:05:37,970 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-11-09 07:05:37,970 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-11-09 07:05:37,970 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-09 07:05:38,082 INFO L124 PetriNetUnfolderBase]: 560/2229 cut-off events. [2024-11-09 07:05:38,083 INFO L125 PetriNetUnfolderBase]: For 2215/2286 co-relation queries the response was YES. [2024-11-09 07:05:38,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4781 conditions, 2229 events. 560/2229 cut-off events. For 2215/2286 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 16788 event pairs, 74 based on Foata normal form. 13/2016 useless extension candidates. Maximal degree in co-relation 4506. Up to 491 conditions per place. [2024-11-09 07:05:38,106 INFO L140 encePairwiseOnDemand]: 172/187 looper letters, 70 selfloop transitions, 48 changer transitions 0/316 dead transitions. [2024-11-09 07:05:38,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 316 transitions, 1611 flow [2024-11-09 07:05:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1016 transitions. [2024-11-09 07:05:38,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9055258467023173 [2024-11-09 07:05:38,109 INFO L175 Difference]: Start difference. First operand has 210 places, 249 transitions, 1107 flow. Second operand 6 states and 1016 transitions. [2024-11-09 07:05:38,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 316 transitions, 1611 flow [2024-11-09 07:05:38,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 316 transitions, 1611 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:38,124 INFO L231 Difference]: Finished difference. Result has 220 places, 292 transitions, 1495 flow [2024-11-09 07:05:38,125 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1495, PETRI_PLACES=220, PETRI_TRANSITIONS=292} [2024-11-09 07:05:38,126 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 48 predicate places. [2024-11-09 07:05:38,126 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 292 transitions, 1495 flow [2024-11-09 07:05:38,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 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-09 07:05:38,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:38,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:38,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:05:38,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:38,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1592921287, now seen corresponding path program 1 times [2024-11-09 07:05:38,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:38,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094112540] [2024-11-09 07:05:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:38,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:05:38,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:38,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094112540] [2024-11-09 07:05:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094112540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:38,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:38,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:38,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905022636] [2024-11-09 07:05:38,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:38,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:38,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:38,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 187 [2024-11-09 07:05:38,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 292 transitions, 1495 flow. Second operand has 6 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 0 states have call successors, (0), 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-09 07:05:38,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:38,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 187 [2024-11-09 07:05:38,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:39,035 INFO L124 PetriNetUnfolderBase]: 548/2322 cut-off events. [2024-11-09 07:05:39,035 INFO L125 PetriNetUnfolderBase]: For 2686/2783 co-relation queries the response was YES. [2024-11-09 07:05:39,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5453 conditions, 2322 events. 548/2322 cut-off events. For 2686/2783 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 18043 event pairs, 80 based on Foata normal form. 17/2121 useless extension candidates. Maximal degree in co-relation 5200. Up to 534 conditions per place. [2024-11-09 07:05:39,063 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 94 selfloop transitions, 31 changer transitions 7/328 dead transitions. [2024-11-09 07:05:39,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 328 transitions, 1936 flow [2024-11-09 07:05:39,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2024-11-09 07:05:39,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8770053475935828 [2024-11-09 07:05:39,066 INFO L175 Difference]: Start difference. First operand has 220 places, 292 transitions, 1495 flow. Second operand 6 states and 984 transitions. [2024-11-09 07:05:39,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 328 transitions, 1936 flow [2024-11-09 07:05:39,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 328 transitions, 1918 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:39,087 INFO L231 Difference]: Finished difference. Result has 230 places, 313 transitions, 1778 flow [2024-11-09 07:05:39,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1778, PETRI_PLACES=230, PETRI_TRANSITIONS=313} [2024-11-09 07:05:39,089 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 58 predicate places. [2024-11-09 07:05:39,090 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 313 transitions, 1778 flow [2024-11-09 07:05:39,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 0 states have call successors, (0), 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-09 07:05:39,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:39,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:39,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:05:39,091 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:39,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:39,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2051310526, now seen corresponding path program 1 times [2024-11-09 07:05:39,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:39,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114562697] [2024-11-09 07:05:39,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:39,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:39,146 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-09 07:05:39,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:39,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114562697] [2024-11-09 07:05:39,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114562697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:39,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:39,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315070657] [2024-11-09 07:05:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:39,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:39,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:39,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:39,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 187 [2024-11-09 07:05:39,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 313 transitions, 1778 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 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-09 07:05:39,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:39,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 187 [2024-11-09 07:05:39,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:39,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][178], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 47#L1058-36true, Black: 265#(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))) 0) (= (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)) 0)), 273#true, Black: 266#(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))) 0) (= (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)) 0) (= (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)) 0)), 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 267#(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))) 0) (= (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)) 0) (= (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)) 0) (= (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)) 0)), Black: 204#(not (= ~threads_mask~0 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), 148#L1048-16true, Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2024-11-09 07:05:39,402 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-09 07:05:39,402 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:39,402 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-09 07:05:39,402 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-09 07:05:39,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L1059-15-->L1059-16: Formula: (= v_~threads_mask~0_22 |v_ULTIMATE.start_main_#t~bitwise18#1_6|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} OutVars{~threads_mask~0=v_~threads_mask~0_22, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} AuxVars[] AssignedVars[~threads_mask~0][266], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 265#(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))) 0) (= (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)) 0)), 273#true, 95#L1059-16true, Black: 266#(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))) 0) (= (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)) 0) (= (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)) 0)), 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 267#(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))) 0) (= (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)) 0) (= (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)) 0) (= (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)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2024-11-09 07:05:39,422 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-09 07:05:39,423 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-09 07:05:39,423 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-09 07:05:39,423 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-09 07:05:39,565 INFO L124 PetriNetUnfolderBase]: 655/2555 cut-off events. [2024-11-09 07:05:39,566 INFO L125 PetriNetUnfolderBase]: For 3196/3307 co-relation queries the response was YES. [2024-11-09 07:05:39,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6118 conditions, 2555 events. 655/2555 cut-off events. For 3196/3307 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 20291 event pairs, 77 based on Foata normal form. 15/2355 useless extension candidates. Maximal degree in co-relation 5864. Up to 451 conditions per place. [2024-11-09 07:05:39,590 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 33 selfloop transitions, 11 changer transitions 3/328 dead transitions. [2024-11-09 07:05:39,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 328 transitions, 1932 flow [2024-11-09 07:05:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2024-11-09 07:05:39,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9322638146167558 [2024-11-09 07:05:39,592 INFO L175 Difference]: Start difference. First operand has 230 places, 313 transitions, 1778 flow. Second operand 3 states and 523 transitions. [2024-11-09 07:05:39,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 328 transitions, 1932 flow [2024-11-09 07:05:39,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 328 transitions, 1876 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:39,612 INFO L231 Difference]: Finished difference. Result has 230 places, 317 transitions, 1780 flow [2024-11-09 07:05:39,612 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1780, PETRI_PLACES=230, PETRI_TRANSITIONS=317} [2024-11-09 07:05:39,613 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 58 predicate places. [2024-11-09 07:05:39,613 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 317 transitions, 1780 flow [2024-11-09 07:05:39,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 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-09 07:05:39,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:39,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:39,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:05:39,614 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:39,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash 138997766, now seen corresponding path program 1 times [2024-11-09 07:05:39,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:39,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207120928] [2024-11-09 07:05:39,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:05:40,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:40,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207120928] [2024-11-09 07:05:40,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207120928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:40,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:40,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:05:40,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881275847] [2024-11-09 07:05:40,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:40,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:05:40,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:40,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:05:40,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:05:40,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 187 [2024-11-09 07:05:40,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 317 transitions, 1780 flow. Second operand has 12 states, 12 states have (on average 145.25) internal successors, (1743), 12 states have internal predecessors, (1743), 0 states have call successors, (0), 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-09 07:05:40,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:40,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 187 [2024-11-09 07:05:40,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:41,533 INFO L124 PetriNetUnfolderBase]: 704/2826 cut-off events. [2024-11-09 07:05:41,533 INFO L125 PetriNetUnfolderBase]: For 4115/4267 co-relation queries the response was YES. [2024-11-09 07:05:41,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7377 conditions, 2826 events. 704/2826 cut-off events. For 4115/4267 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 23098 event pairs, 93 based on Foata normal form. 69/2709 useless extension candidates. Maximal degree in co-relation 7102. Up to 460 conditions per place. [2024-11-09 07:05:41,553 INFO L140 encePairwiseOnDemand]: 172/187 looper letters, 179 selfloop transitions, 67 changer transitions 4/435 dead transitions. [2024-11-09 07:05:41,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 435 transitions, 2952 flow [2024-11-09 07:05:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:05:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-09 07:05:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2710 transitions. [2024-11-09 07:05:41,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8051099227569816 [2024-11-09 07:05:41,565 INFO L175 Difference]: Start difference. First operand has 230 places, 317 transitions, 1780 flow. Second operand 18 states and 2710 transitions. [2024-11-09 07:05:41,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 435 transitions, 2952 flow [2024-11-09 07:05:41,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 435 transitions, 2930 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:05:41,603 INFO L231 Difference]: Finished difference. Result has 245 places, 335 transitions, 2017 flow [2024-11-09 07:05:41,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2017, PETRI_PLACES=245, PETRI_TRANSITIONS=335} [2024-11-09 07:05:41,604 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 73 predicate places. [2024-11-09 07:05:41,605 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 335 transitions, 2017 flow [2024-11-09 07:05:41,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 145.25) internal successors, (1743), 12 states have internal predecessors, (1743), 0 states have call successors, (0), 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-09 07:05:41,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:41,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:41,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:05:41,606 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:41,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1401388129, now seen corresponding path program 1 times [2024-11-09 07:05:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:41,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080889797] [2024-11-09 07:05:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:41,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:05:42,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:42,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080889797] [2024-11-09 07:05:42,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080889797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:42,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:42,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:05:42,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231554695] [2024-11-09 07:05:42,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:42,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:05:42,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:42,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:05:42,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:05:42,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 187 [2024-11-09 07:05:42,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 335 transitions, 2017 flow. Second operand has 12 states, 12 states have (on average 145.16666666666666) internal successors, (1742), 12 states have internal predecessors, (1742), 0 states have call successors, (0), 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-09 07:05:42,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:42,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 187 [2024-11-09 07:05:42,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:43,190 INFO L124 PetriNetUnfolderBase]: 639/2696 cut-off events. [2024-11-09 07:05:43,191 INFO L125 PetriNetUnfolderBase]: For 4149/4255 co-relation queries the response was YES. [2024-11-09 07:05:43,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7146 conditions, 2696 events. 639/2696 cut-off events. For 4149/4255 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 21865 event pairs, 89 based on Foata normal form. 29/2548 useless extension candidates. Maximal degree in co-relation 6865. Up to 511 conditions per place. [2024-11-09 07:05:43,211 INFO L140 encePairwiseOnDemand]: 174/187 looper letters, 75 selfloop transitions, 6 changer transitions 112/369 dead transitions. [2024-11-09 07:05:43,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 369 transitions, 2651 flow [2024-11-09 07:05:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:05:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 07:05:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1933 transitions. [2024-11-09 07:05:43,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7951460304401481 [2024-11-09 07:05:43,217 INFO L175 Difference]: Start difference. First operand has 245 places, 335 transitions, 2017 flow. Second operand 13 states and 1933 transitions. [2024-11-09 07:05:43,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 369 transitions, 2651 flow [2024-11-09 07:05:43,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 369 transitions, 2495 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-09 07:05:43,247 INFO L231 Difference]: Finished difference. Result has 248 places, 257 transitions, 1422 flow [2024-11-09 07:05:43,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1422, PETRI_PLACES=248, PETRI_TRANSITIONS=257} [2024-11-09 07:05:43,248 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 76 predicate places. [2024-11-09 07:05:43,248 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 257 transitions, 1422 flow [2024-11-09 07:05:43,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 145.16666666666666) internal successors, (1742), 12 states have internal predecessors, (1742), 0 states have call successors, (0), 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-09 07:05:43,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:43,249 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:43,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:05:43,249 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:43,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:43,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1294028965, now seen corresponding path program 1 times [2024-11-09 07:05:43,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:43,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277011588] [2024-11-09 07:05:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:43,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:43,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:43,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277011588] [2024-11-09 07:05:43,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277011588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:43,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:43,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:05:43,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331954428] [2024-11-09 07:05:43,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:43,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:05:43,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:43,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:05:43,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:05:43,597 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 187 [2024-11-09 07:05:43,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 257 transitions, 1422 flow. Second operand has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 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-09 07:05:43,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:43,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 187 [2024-11-09 07:05:43,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:44,345 INFO L124 PetriNetUnfolderBase]: 1270/4207 cut-off events. [2024-11-09 07:05:44,345 INFO L125 PetriNetUnfolderBase]: For 7031/7164 co-relation queries the response was YES. [2024-11-09 07:05:44,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11014 conditions, 4207 events. 1270/4207 cut-off events. For 7031/7164 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 34304 event pairs, 225 based on Foata normal form. 85/4022 useless extension candidates. Maximal degree in co-relation 10976. Up to 1165 conditions per place. [2024-11-09 07:05:44,372 INFO L140 encePairwiseOnDemand]: 174/187 looper letters, 96 selfloop transitions, 49 changer transitions 0/352 dead transitions. [2024-11-09 07:05:44,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 352 transitions, 2237 flow [2024-11-09 07:05:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:05:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 07:05:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2311 transitions. [2024-11-09 07:05:44,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8827349121466769 [2024-11-09 07:05:44,378 INFO L175 Difference]: Start difference. First operand has 248 places, 257 transitions, 1422 flow. Second operand 14 states and 2311 transitions. [2024-11-09 07:05:44,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 352 transitions, 2237 flow [2024-11-09 07:05:44,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 352 transitions, 2190 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-11-09 07:05:44,401 INFO L231 Difference]: Finished difference. Result has 225 places, 303 transitions, 1954 flow [2024-11-09 07:05:44,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1954, PETRI_PLACES=225, PETRI_TRANSITIONS=303} [2024-11-09 07:05:44,402 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 53 predicate places. [2024-11-09 07:05:44,402 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 303 transitions, 1954 flow [2024-11-09 07:05:44,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 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-09 07:05:44,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:44,403 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:44,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:05:44,403 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:44,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash -370624315, now seen corresponding path program 1 times [2024-11-09 07:05:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:44,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594439407] [2024-11-09 07:05:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:44,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594439407] [2024-11-09 07:05:44,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594439407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:44,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:44,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:05:44,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777859228] [2024-11-09 07:05:44,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:44,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:05:44,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:44,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:05:44,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:05:44,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 187 [2024-11-09 07:05:44,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 303 transitions, 1954 flow. Second operand has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 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-09 07:05:44,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:44,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 187 [2024-11-09 07:05:44,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:45,460 INFO L124 PetriNetUnfolderBase]: 1184/4038 cut-off events. [2024-11-09 07:05:45,461 INFO L125 PetriNetUnfolderBase]: For 10190/10357 co-relation queries the response was YES. [2024-11-09 07:05:45,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12023 conditions, 4038 events. 1184/4038 cut-off events. For 10190/10357 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 32981 event pairs, 208 based on Foata normal form. 59/3834 useless extension candidates. Maximal degree in co-relation 11979. Up to 1072 conditions per place. [2024-11-09 07:05:45,513 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 88 selfloop transitions, 61 changer transitions 0/357 dead transitions. [2024-11-09 07:05:45,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 357 transitions, 2600 flow [2024-11-09 07:05:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:05:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 07:05:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2313 transitions. [2024-11-09 07:05:45,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8834988540870894 [2024-11-09 07:05:45,517 INFO L175 Difference]: Start difference. First operand has 225 places, 303 transitions, 1954 flow. Second operand 14 states and 2313 transitions. [2024-11-09 07:05:45,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 357 transitions, 2600 flow [2024-11-09 07:05:45,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 357 transitions, 2555 flow, removed 21 selfloop flow, removed 1 redundant places. [2024-11-09 07:05:45,564 INFO L231 Difference]: Finished difference. Result has 241 places, 319 transitions, 2218 flow [2024-11-09 07:05:45,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1917, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2218, PETRI_PLACES=241, PETRI_TRANSITIONS=319} [2024-11-09 07:05:45,565 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 69 predicate places. [2024-11-09 07:05:45,566 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 319 transitions, 2218 flow [2024-11-09 07:05:45,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 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-09 07:05:45,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:45,567 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:45,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:05:45,567 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:45,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:45,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1844164866, now seen corresponding path program 1 times [2024-11-09 07:05:45,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:45,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54114417] [2024-11-09 07:05:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:45,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:45,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:45,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54114417] [2024-11-09 07:05:45,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54114417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:45,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:45,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:05:45,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328981416] [2024-11-09 07:05:45,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:45,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:05:45,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:45,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:05:45,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:05:45,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 187 [2024-11-09 07:05:45,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 319 transitions, 2218 flow. Second operand has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 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-09 07:05:45,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:45,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 187 [2024-11-09 07:05:45,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:46,767 INFO L124 PetriNetUnfolderBase]: 1399/4856 cut-off events. [2024-11-09 07:05:46,767 INFO L125 PetriNetUnfolderBase]: For 15105/15328 co-relation queries the response was YES. [2024-11-09 07:05:46,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15000 conditions, 4856 events. 1399/4856 cut-off events. For 15105/15328 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 42494 event pairs, 198 based on Foata normal form. 58/4613 useless extension candidates. Maximal degree in co-relation 14951. Up to 1180 conditions per place. [2024-11-09 07:05:46,812 INFO L140 encePairwiseOnDemand]: 175/187 looper letters, 139 selfloop transitions, 47 changer transitions 0/394 dead transitions. [2024-11-09 07:05:46,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 394 transitions, 3150 flow [2024-11-09 07:05:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:05:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 07:05:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2320 transitions. [2024-11-09 07:05:46,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8861726508785333 [2024-11-09 07:05:46,817 INFO L175 Difference]: Start difference. First operand has 241 places, 319 transitions, 2218 flow. Second operand 14 states and 2320 transitions. [2024-11-09 07:05:46,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 394 transitions, 3150 flow [2024-11-09 07:05:46,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 394 transitions, 3106 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-09 07:05:46,879 INFO L231 Difference]: Finished difference. Result has 259 places, 353 transitions, 2691 flow [2024-11-09 07:05:46,881 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2691, PETRI_PLACES=259, PETRI_TRANSITIONS=353} [2024-11-09 07:05:46,882 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 87 predicate places. [2024-11-09 07:05:46,883 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 353 transitions, 2691 flow [2024-11-09 07:05:46,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 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-09 07:05:46,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:46,885 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:46,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:05:46,885 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:46,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:46,886 INFO L85 PathProgramCache]: Analyzing trace with hash -786149150, now seen corresponding path program 1 times [2024-11-09 07:05:46,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:46,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083315169] [2024-11-09 07:05:46,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:46,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:47,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:47,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083315169] [2024-11-09 07:05:47,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083315169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:47,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:47,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:05:47,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299136752] [2024-11-09 07:05:47,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:47,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:05:47,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:47,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:05:47,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:05:47,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 187 [2024-11-09 07:05:47,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 353 transitions, 2691 flow. Second operand has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 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-09 07:05:47,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:47,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 187 [2024-11-09 07:05:47,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:48,242 INFO L124 PetriNetUnfolderBase]: 1367/5110 cut-off events. [2024-11-09 07:05:48,243 INFO L125 PetriNetUnfolderBase]: For 20282/20522 co-relation queries the response was YES. [2024-11-09 07:05:48,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16313 conditions, 5110 events. 1367/5110 cut-off events. For 20282/20522 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 46718 event pairs, 125 based on Foata normal form. 104/4937 useless extension candidates. Maximal degree in co-relation 16254. Up to 624 conditions per place. [2024-11-09 07:05:48,283 INFO L140 encePairwiseOnDemand]: 174/187 looper letters, 63 selfloop transitions, 165 changer transitions 0/436 dead transitions. [2024-11-09 07:05:48,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 436 transitions, 3993 flow [2024-11-09 07:05:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:05:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 07:05:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2296 transitions. [2024-11-09 07:05:48,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8770053475935828 [2024-11-09 07:05:48,288 INFO L175 Difference]: Start difference. First operand has 259 places, 353 transitions, 2691 flow. Second operand 14 states and 2296 transitions. [2024-11-09 07:05:48,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 436 transitions, 3993 flow [2024-11-09 07:05:48,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 436 transitions, 3867 flow, removed 63 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:48,392 INFO L231 Difference]: Finished difference. Result has 278 places, 410 transitions, 3815 flow [2024-11-09 07:05:48,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=2597, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3815, PETRI_PLACES=278, PETRI_TRANSITIONS=410} [2024-11-09 07:05:48,393 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 106 predicate places. [2024-11-09 07:05:48,393 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 410 transitions, 3815 flow [2024-11-09 07:05:48,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 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-09 07:05:48,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:48,394 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:48,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:05:48,395 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1952893537, now seen corresponding path program 1 times [2024-11-09 07:05:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224186153] [2024-11-09 07:05:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:48,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:48,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224186153] [2024-11-09 07:05:48,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224186153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:48,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:48,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:48,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997126406] [2024-11-09 07:05:48,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:48,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:05:48,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:48,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:05:48,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:05:48,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 187 [2024-11-09 07:05:48,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 410 transitions, 3815 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 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-09 07:05:48,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:48,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 187 [2024-11-09 07:05:48,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:50,183 INFO L124 PetriNetUnfolderBase]: 1684/7265 cut-off events. [2024-11-09 07:05:50,184 INFO L125 PetriNetUnfolderBase]: For 25604/26012 co-relation queries the response was YES. [2024-11-09 07:05:50,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22828 conditions, 7265 events. 1684/7265 cut-off events. For 25604/26012 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 76729 event pairs, 79 based on Foata normal form. 82/7024 useless extension candidates. Maximal degree in co-relation 22762. Up to 470 conditions per place. [2024-11-09 07:05:50,235 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 77 selfloop transitions, 7 changer transitions 0/441 dead transitions. [2024-11-09 07:05:50,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 441 transitions, 4192 flow [2024-11-09 07:05:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1011 transitions. [2024-11-09 07:05:50,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9010695187165776 [2024-11-09 07:05:50,238 INFO L175 Difference]: Start difference. First operand has 278 places, 410 transitions, 3815 flow. Second operand 6 states and 1011 transitions. [2024-11-09 07:05:50,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 441 transitions, 4192 flow [2024-11-09 07:05:50,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 441 transitions, 4047 flow, removed 59 selfloop flow, removed 6 redundant places. [2024-11-09 07:05:50,374 INFO L231 Difference]: Finished difference. Result has 280 places, 415 transitions, 3731 flow [2024-11-09 07:05:50,374 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=3686, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3731, PETRI_PLACES=280, PETRI_TRANSITIONS=415} [2024-11-09 07:05:50,375 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 108 predicate places. [2024-11-09 07:05:50,375 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 415 transitions, 3731 flow [2024-11-09 07:05:50,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 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-09 07:05:50,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:50,376 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:50,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:05:50,376 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:50,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1777851748, now seen corresponding path program 1 times [2024-11-09 07:05:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:50,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703161090] [2024-11-09 07:05:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:50,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:50,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:50,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703161090] [2024-11-09 07:05:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703161090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:50,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:05:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385962544] [2024-11-09 07:05:50,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:50,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:50,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:50,674 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2024-11-09 07:05:50,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 415 transitions, 3731 flow. Second operand has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 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-09 07:05:50,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:50,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2024-11-09 07:05:50,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:52,535 INFO L124 PetriNetUnfolderBase]: 1968/10406 cut-off events. [2024-11-09 07:05:52,536 INFO L125 PetriNetUnfolderBase]: For 27792/28258 co-relation queries the response was YES. [2024-11-09 07:05:52,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30676 conditions, 10406 events. 1968/10406 cut-off events. For 27792/28258 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 122836 event pairs, 122 based on Foata normal form. 86/10100 useless extension candidates. Maximal degree in co-relation 30610. Up to 682 conditions per place. [2024-11-09 07:05:52,614 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 106 selfloop transitions, 20 changer transitions 0/469 dead transitions. [2024-11-09 07:05:52,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 469 transitions, 4065 flow [2024-11-09 07:05:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:05:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 07:05:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1881 transitions. [2024-11-09 07:05:52,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9144385026737968 [2024-11-09 07:05:52,617 INFO L175 Difference]: Start difference. First operand has 280 places, 415 transitions, 3731 flow. Second operand 11 states and 1881 transitions. [2024-11-09 07:05:52,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 469 transitions, 4065 flow [2024-11-09 07:05:52,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 469 transitions, 4037 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-11-09 07:05:52,783 INFO L231 Difference]: Finished difference. Result has 291 places, 406 transitions, 3491 flow [2024-11-09 07:05:52,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=3330, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3491, PETRI_PLACES=291, PETRI_TRANSITIONS=406} [2024-11-09 07:05:52,784 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 119 predicate places. [2024-11-09 07:05:52,784 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 406 transitions, 3491 flow [2024-11-09 07:05:52,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 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-09 07:05:52,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:52,785 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:05:52,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:05:52,785 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:52,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:52,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1051201428, now seen corresponding path program 1 times [2024-11-09 07:05:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:52,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420009343] [2024-11-09 07:05:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:52,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:05:52,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:05:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:05:52,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:05:52,870 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:05:52,871 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-11-09 07:05:52,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-09 07:05:52,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-09 07:05:52,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-09 07:05:52,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-09 07:05:52,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-09 07:05:52,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-09 07:05:52,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-11-09 07:05:52,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-09 07:05:52,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-09 07:05:52,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-09 07:05:52,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-09 07:05:52,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-09 07:05:52,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-09 07:05:52,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-09 07:05:52,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-09 07:05:52,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:05:52,879 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-09 07:05:52,958 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:05:52,958 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:05:52,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:05:52 BasicIcfg [2024-11-09 07:05:52,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:05:52,964 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:05:52,964 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:05:52,964 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:05:52,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:31" (3/4) ... [2024-11-09 07:05:52,966 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:05:52,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:05:52,968 INFO L158 Benchmark]: Toolchain (without parser) took 23106.35ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 101.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 563.2MB. Max. memory is 16.1GB. [2024-11-09 07:05:52,968 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:05:52,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.32ms. Allocated memory is still 159.4MB. Free memory was 100.9MB in the beginning and 69.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 07:05:52,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.60ms. Allocated memory is still 159.4MB. Free memory was 69.4MB in the beginning and 66.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:05:52,969 INFO L158 Benchmark]: Boogie Preprocessor took 33.73ms. Allocated memory is still 159.4MB. Free memory was 66.5MB in the beginning and 64.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:05:52,969 INFO L158 Benchmark]: RCFGBuilder took 799.15ms. Allocated memory is still 159.4MB. Free memory was 64.4MB in the beginning and 105.0MB in the end (delta: -40.5MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-09 07:05:52,969 INFO L158 Benchmark]: TraceAbstraction took 21559.99ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 104.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 568.0MB. Max. memory is 16.1GB. [2024-11-09 07:05:52,969 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 2.2GB. Free memory is still 1.6GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:05:52,971 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.32ms. Allocated memory is still 159.4MB. Free memory was 100.9MB in the beginning and 69.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.60ms. Allocated memory is still 159.4MB. Free memory was 69.4MB in the beginning and 66.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.73ms. Allocated memory is still 159.4MB. Free memory was 66.5MB in the beginning and 64.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 799.15ms. Allocated memory is still 159.4MB. Free memory was 64.4MB in the beginning and 105.0MB in the end (delta: -40.5MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21559.99ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 104.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 568.0MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 2.2GB. Free memory is still 1.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: overapproximation of shiftLeft at line 1048, overapproximation of shiftRight at line 1058, overapproximation of bitwiseOr at line 1048, overapproximation of bitwiseAnd at line 1059. Possible FailurePath: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=31] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=31, tids={-2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-3:0}, threads_mask=-1, threads_total=31, tids={-2:0}] [L1057] 0 int i = 0; VAL [datas={-3:0}, i=0, threads_mask=-1, threads_total=31, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-3:0}, i=0, threads_mask=-1, threads_total=31, tids={-2:0}] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={-3:0}, i=0, threads_mask=-1, threads_total=31, tids={-2:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={-3:0}, i=0, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-3:0}, i=0, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] [L1059] EXPR 0 1 << j VAL [datas={-3:0}, i=0, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-3:0}, i=0, j=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={-3:0}, i=0, j=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:1}, datas={-3:0}, i=0, j=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1057] 0 i++ VAL [\old(arg)={0:1}, datas={-3:0}, i=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:1}, datas={-3:0}, i=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1048] EXPR 1 1 << j VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, i=1, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 209 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.3s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2472 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1750 mSDsluCounter, 1534 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1271 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5243 IncrementalHoareTripleChecker+Invalid, 5429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 263 mSDtfsCounter, 5243 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3815occurred in iteration=21, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1969 NumberOfCodeBlocks, 1969 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1832 ConstructedInterpolants, 0 QuantifiedInterpolants, 5690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 21/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 07:05:52,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-index-bitmask-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:05:55,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:05:55,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf [2024-11-09 07:05:55,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:05:55,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:05:55,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:05:55,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:05:55,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:05:55,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:05:55,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:05:55,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:05:55,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:05:55,626 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:05:55,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:05:55,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:05:55,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:05:55,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:05:55,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:05:55,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:05:55,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:05:55,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:05:55,636 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:05:55,636 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:05:55,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:05:55,636 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:05:55,637 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:05:55,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:05:55,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:05:55,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:05:55,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:05:55,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:05:55,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:05:55,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:05:55,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:05:55,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:05:55,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:05:55,641 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:05:55,641 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:05:55,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:05:55,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:05:55,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:05:55,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:05:55,643 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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2024-11-09 07:05:55,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:05:55,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:05:55,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:05:55,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:05:55,993 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:05:55,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-09 07:05:57,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:05:57,778 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:05:57,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-09 07:05:57,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c9c4872/2184dc774c0d44ea9f55989d0fb2342f/FLAG760e0cfd8 [2024-11-09 07:05:57,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c9c4872/2184dc774c0d44ea9f55989d0fb2342f [2024-11-09 07:05:57,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:05:57,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:05:57,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:05:57,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:05:57,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:05:57,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:05:57" (1/1) ... [2024-11-09 07:05:57,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2068cff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:57, skipping insertion in model container [2024-11-09 07:05:57,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:05:57" (1/1) ... [2024-11-09 07:05:57,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:05:58,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:05:58,465 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:05:58,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:05:58,575 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:05:58,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58 WrapperNode [2024-11-09 07:05:58,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:05:58,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:05:58,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:05:58,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:05:58,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,653 INFO L138 Inliner]: procedures = 274, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2024-11-09 07:05:58,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:05:58,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:05:58,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:05:58,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:05:58,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:05:58,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:05:58,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:05:58,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:05:58,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (1/1) ... [2024-11-09 07:05:58,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:05:58,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:05:58,774 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-09 07:05:58,781 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-09 07:05:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 07:05:58,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:05:58,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 07:05:58,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:05:58,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-09 07:05:58,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-09 07:05:58,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:05:58,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:05:58,825 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:05:58,970 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:05:58,972 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:05:59,334 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:05:59,334 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:05:59,354 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:05:59,354 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:05:59,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:59 BoogieIcfgContainer [2024-11-09 07:05:59,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:05:59,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:05:59,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:05:59,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:05:59,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:05:57" (1/3) ... [2024-11-09 07:05:59,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7fd8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:05:59, skipping insertion in model container [2024-11-09 07:05:59,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:58" (2/3) ... [2024-11-09 07:05:59,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7fd8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:05:59, skipping insertion in model container [2024-11-09 07:05:59,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:59" (3/3) ... [2024-11-09 07:05:59,365 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2024-11-09 07:05:59,382 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:05:59,382 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-09 07:05:59,382 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:05:59,510 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 07:05:59,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 134 transitions, 275 flow [2024-11-09 07:05:59,637 INFO L124 PetriNetUnfolderBase]: 9/189 cut-off events. [2024-11-09 07:05:59,638 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 07:05:59,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 189 events. 9/189 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 318 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2024-11-09 07:05:59,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 134 transitions, 275 flow [2024-11-09 07:05:59,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 134 transitions, 275 flow [2024-11-09 07:05:59,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:05:59,678 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;@410e526a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:05:59,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-09 07:05:59,689 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:05:59,690 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-09 07:05:59,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:05:59,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:59,691 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] [2024-11-09 07:05:59,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:05:59,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 825090929, now seen corresponding path program 1 times [2024-11-09 07:05:59,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:05:59,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102866462] [2024-11-09 07:05:59,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:59,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:05:59,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:05:59,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:05:59,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 07:05:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:59,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:05:59,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:59,883 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-09 07:05:59,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:05:59,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:05:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102866462] [2024-11-09 07:05:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102866462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:59,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470756252] [2024-11-09 07:05:59,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:59,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:59,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:05:59,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:59,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:59,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 134 [2024-11-09 07:05:59,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 134 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-09 07:05:59,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:59,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 134 [2024-11-09 07:06:00,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:00,081 INFO L124 PetriNetUnfolderBase]: 5/234 cut-off events. [2024-11-09 07:06:00,081 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:06:00,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 234 events. 5/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 531 event pairs, 2 based on Foata normal form. 6/206 useless extension candidates. Maximal degree in co-relation 146. Up to 15 conditions per place. [2024-11-09 07:06:00,087 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 8 selfloop transitions, 2 changer transitions 2/129 dead transitions. [2024-11-09 07:06:00,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 285 flow [2024-11-09 07:06:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:06:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:06:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2024-11-09 07:06:00,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253731343283582 [2024-11-09 07:06:00,106 INFO L175 Difference]: Start difference. First operand has 131 places, 134 transitions, 275 flow. Second operand 3 states and 372 transitions. [2024-11-09 07:06:00,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 285 flow [2024-11-09 07:06:00,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 129 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:00,114 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 265 flow [2024-11-09 07:06:00,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2024-11-09 07:06:00,121 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2024-11-09 07:06:00,122 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 265 flow [2024-11-09 07:06:00,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-09 07:06:00,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:00,124 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-09 07:06:00,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:06:00,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:00,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:00,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:00,329 INFO L85 PathProgramCache]: Analyzing trace with hash -508688433, now seen corresponding path program 1 times [2024-11-09 07:06:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:00,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268206147] [2024-11-09 07:06:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:00,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:00,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:00,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:00,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 07:06:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:00,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:06:00,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:00,422 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-09 07:06:00,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:00,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268206147] [2024-11-09 07:06:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268206147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:00,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:00,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:06:00,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573770937] [2024-11-09 07:06:00,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:00,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:06:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:00,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:06:00,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:06:00,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 134 [2024-11-09 07:06:00,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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-09 07:06:00,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:00,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 134 [2024-11-09 07:06:00,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:00,531 INFO L124 PetriNetUnfolderBase]: 20/306 cut-off events. [2024-11-09 07:06:00,531 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:06:00,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 306 events. 20/306 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1060 event pairs, 7 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 331. Up to 36 conditions per place. [2024-11-09 07:06:00,534 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 13 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2024-11-09 07:06:00,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 323 flow [2024-11-09 07:06:00,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:06:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:06:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2024-11-09 07:06:00,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2024-11-09 07:06:00,548 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 265 flow. Second operand 3 states and 375 transitions. [2024-11-09 07:06:00,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 323 flow [2024-11-09 07:06:00,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:06:00,553 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 331 flow [2024-11-09 07:06:00,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2024-11-09 07:06:00,555 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2024-11-09 07:06:00,555 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 331 flow [2024-11-09 07:06:00,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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-09 07:06:00,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:00,556 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] [2024-11-09 07:06:00,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:06:00,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:00,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:00,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1342900130, now seen corresponding path program 1 times [2024-11-09 07:06:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:00,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048808174] [2024-11-09 07:06:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:00,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:00,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:00,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:00,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 07:06:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:00,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:06:00,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:00,853 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-09 07:06:00,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:00,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048808174] [2024-11-09 07:06:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048808174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:00,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:00,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:06:00,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297419506] [2024-11-09 07:06:00,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:00,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:06:00,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:00,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:06:00,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:06:00,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 134 [2024-11-09 07:06:00,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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-09 07:06:00,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:00,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 134 [2024-11-09 07:06:00,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:00,926 INFO L124 PetriNetUnfolderBase]: 24/365 cut-off events. [2024-11-09 07:06:00,926 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-09 07:06:00,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 365 events. 24/365 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1403 event pairs, 9 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 347. Up to 40 conditions per place. [2024-11-09 07:06:00,929 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 7 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2024-11-09 07:06:00,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 349 flow [2024-11-09 07:06:00,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:06:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:06:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-11-09 07:06:00,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9303482587064676 [2024-11-09 07:06:00,931 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 331 flow. Second operand 3 states and 374 transitions. [2024-11-09 07:06:00,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 349 flow [2024-11-09 07:06:00,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:06:00,935 INFO L231 Difference]: Finished difference. Result has 131 places, 135 transitions, 325 flow [2024-11-09 07:06:00,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=131, PETRI_TRANSITIONS=135} [2024-11-09 07:06:00,936 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 0 predicate places. [2024-11-09 07:06:00,937 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 135 transitions, 325 flow [2024-11-09 07:06:00,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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-09 07:06:00,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:00,937 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] [2024-11-09 07:06:00,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 07:06:01,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:01,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:01,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:01,139 INFO L85 PathProgramCache]: Analyzing trace with hash 198282629, now seen corresponding path program 1 times [2024-11-09 07:06:01,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:01,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717373874] [2024-11-09 07:06:01,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:01,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:01,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:01,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:01,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:06:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:01,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:06:01,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:01,737 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-09 07:06:01,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:01,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:01,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717373874] [2024-11-09 07:06:01,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717373874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:01,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:01,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:06:01,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201690875] [2024-11-09 07:06:01,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:01,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:06:01,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:01,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:06:01,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:06:02,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 134 [2024-11-09 07:06:02,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 135 transitions, 325 flow. Second operand has 11 states, 11 states have (on average 106.72727272727273) internal successors, (1174), 11 states have internal predecessors, (1174), 0 states have call successors, (0), 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-09 07:06:02,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:02,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 134 [2024-11-09 07:06:02,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:02,428 INFO L124 PetriNetUnfolderBase]: 21/327 cut-off events. [2024-11-09 07:06:02,429 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2024-11-09 07:06:02,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 327 events. 21/327 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1154 event pairs, 6 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 289. Up to 38 conditions per place. [2024-11-09 07:06:02,431 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 12 selfloop transitions, 13 changer transitions 5/140 dead transitions. [2024-11-09 07:06:02,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 140 transitions, 395 flow [2024-11-09 07:06:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:06:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 07:06:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1711 transitions. [2024-11-09 07:06:02,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7980410447761194 [2024-11-09 07:06:02,435 INFO L175 Difference]: Start difference. First operand has 131 places, 135 transitions, 325 flow. Second operand 16 states and 1711 transitions. [2024-11-09 07:06:02,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 140 transitions, 395 flow [2024-11-09 07:06:02,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 140 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:02,439 INFO L231 Difference]: Finished difference. Result has 150 places, 135 transitions, 363 flow [2024-11-09 07:06:02,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=363, PETRI_PLACES=150, PETRI_TRANSITIONS=135} [2024-11-09 07:06:02,440 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 19 predicate places. [2024-11-09 07:06:02,440 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 135 transitions, 363 flow [2024-11-09 07:06:02,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 106.72727272727273) internal successors, (1174), 11 states have internal predecessors, (1174), 0 states have call successors, (0), 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-09 07:06:02,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:02,441 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] [2024-11-09 07:06:02,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 07:06:02,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:02,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1473544567, now seen corresponding path program 1 times [2024-11-09 07:06:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:02,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824106215] [2024-11-09 07:06:02,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:02,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:02,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:02,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:02,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 07:06:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:02,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:06:02,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:02,783 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-09 07:06:02,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:02,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:02,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824106215] [2024-11-09 07:06:02,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824106215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:02,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:02,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:06:02,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166574146] [2024-11-09 07:06:02,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:02,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:06:02,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:02,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:06:02,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:06:02,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 134 [2024-11-09 07:06:02,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 135 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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-09 07:06:02,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:02,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 134 [2024-11-09 07:06:02,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:02,838 INFO L124 PetriNetUnfolderBase]: 19/297 cut-off events. [2024-11-09 07:06:02,838 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-09 07:06:02,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 297 events. 19/297 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1006 event pairs, 6 based on Foata normal form. 1/275 useless extension candidates. Maximal degree in co-relation 330. Up to 36 conditions per place. [2024-11-09 07:06:02,840 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 4 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-11-09 07:06:02,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 136 transitions, 377 flow [2024-11-09 07:06:02,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:06:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:06:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2024-11-09 07:06:02,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9502487562189055 [2024-11-09 07:06:02,842 INFO L175 Difference]: Start difference. First operand has 150 places, 135 transitions, 363 flow. Second operand 3 states and 382 transitions. [2024-11-09 07:06:02,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 136 transitions, 377 flow [2024-11-09 07:06:02,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 136 transitions, 343 flow, removed 4 selfloop flow, removed 15 redundant places. [2024-11-09 07:06:02,846 INFO L231 Difference]: Finished difference. Result has 135 places, 136 transitions, 341 flow [2024-11-09 07:06:02,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=135, PETRI_TRANSITIONS=136} [2024-11-09 07:06:02,847 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 4 predicate places. [2024-11-09 07:06:02,847 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 136 transitions, 341 flow [2024-11-09 07:06:02,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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-09 07:06:02,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:02,848 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] [2024-11-09 07:06:02,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 07:06:03,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:03,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:03,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1220080592, now seen corresponding path program 1 times [2024-11-09 07:06:03,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:03,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470431961] [2024-11-09 07:06:03,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:03,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:03,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:03,051 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:03,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 07:06:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:03,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:06:03,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:03,130 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-09 07:06:03,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:03,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:03,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470431961] [2024-11-09 07:06:03,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470431961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:03,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:03,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:06:03,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236781656] [2024-11-09 07:06:03,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:03,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:06:03,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:03,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:06:03,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:06:03,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 134 [2024-11-09 07:06:03,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 136 transitions, 341 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-09 07:06:03,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:03,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 134 [2024-11-09 07:06:03,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:03,208 INFO L124 PetriNetUnfolderBase]: 33/346 cut-off events. [2024-11-09 07:06:03,208 INFO L125 PetriNetUnfolderBase]: For 38/41 co-relation queries the response was YES. [2024-11-09 07:06:03,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 346 events. 33/346 cut-off events. For 38/41 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1386 event pairs, 10 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 457. Up to 63 conditions per place. [2024-11-09 07:06:03,210 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 16 selfloop transitions, 7 changer transitions 0/141 dead transitions. [2024-11-09 07:06:03,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 141 transitions, 403 flow [2024-11-09 07:06:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:06:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:06:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2024-11-09 07:06:03,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.917910447761194 [2024-11-09 07:06:03,212 INFO L175 Difference]: Start difference. First operand has 135 places, 136 transitions, 341 flow. Second operand 3 states and 369 transitions. [2024-11-09 07:06:03,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 141 transitions, 403 flow [2024-11-09 07:06:03,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 141 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:06:03,215 INFO L231 Difference]: Finished difference. Result has 138 places, 141 transitions, 395 flow [2024-11-09 07:06:03,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=138, PETRI_TRANSITIONS=141} [2024-11-09 07:06:03,216 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 7 predicate places. [2024-11-09 07:06:03,216 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 141 transitions, 395 flow [2024-11-09 07:06:03,216 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-09 07:06:03,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:03,216 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:03,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:06:03,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:03,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:03,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash 734470491, now seen corresponding path program 1 times [2024-11-09 07:06:03,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:03,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749068214] [2024-11-09 07:06:03,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:03,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:03,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:03,426 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:03,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 07:06:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:03,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:06:03,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:03,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-09 07:06:03,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2024-11-09 07:06:03,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:03,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52 [2024-11-09 07:06:03,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:03,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71 [2024-11-09 07:06:03,745 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-09 07:06:03,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:03,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749068214] [2024-11-09 07:06:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749068214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:03,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113192736] [2024-11-09 07:06:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:03,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:06:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:06:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:06:03,985 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 134 [2024-11-09 07:06:03,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 141 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 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-09 07:06:03,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:03,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 134 [2024-11-09 07:06:03,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:04,233 INFO L124 PetriNetUnfolderBase]: 101/677 cut-off events. [2024-11-09 07:06:04,233 INFO L125 PetriNetUnfolderBase]: For 76/79 co-relation queries the response was YES. [2024-11-09 07:06:04,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 677 events. 101/677 cut-off events. For 76/79 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3829 event pairs, 44 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 997. Up to 154 conditions per place. [2024-11-09 07:06:04,240 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 23 selfloop transitions, 22 changer transitions 0/162 dead transitions. [2024-11-09 07:06:04,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 162 transitions, 527 flow [2024-11-09 07:06:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2024-11-09 07:06:04,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8482587064676617 [2024-11-09 07:06:04,243 INFO L175 Difference]: Start difference. First operand has 138 places, 141 transitions, 395 flow. Second operand 6 states and 682 transitions. [2024-11-09 07:06:04,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 162 transitions, 527 flow [2024-11-09 07:06:04,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 162 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:06:04,249 INFO L231 Difference]: Finished difference. Result has 146 places, 162 transitions, 531 flow [2024-11-09 07:06:04,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=146, PETRI_TRANSITIONS=162} [2024-11-09 07:06:04,250 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 15 predicate places. [2024-11-09 07:06:04,250 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 162 transitions, 531 flow [2024-11-09 07:06:04,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 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-09 07:06:04,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:04,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:04,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 07:06:04,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:04,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:04,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:04,452 INFO L85 PathProgramCache]: Analyzing trace with hash -694098063, now seen corresponding path program 1 times [2024-11-09 07:06:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:04,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292335958] [2024-11-09 07:06:04,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:04,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:04,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:04,456 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:04,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 07:06:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:04,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:06:04,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:04,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-09 07:06:04,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2024-11-09 07:06:04,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:04,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52 [2024-11-09 07:06:04,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:04,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71 [2024-11-09 07:06:04,731 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-09 07:06:04,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:04,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292335958] [2024-11-09 07:06:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292335958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:04,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274087611] [2024-11-09 07:06:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:06:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:04,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:06:04,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:06:04,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2024-11-09 07:06:04,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 162 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 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-09 07:06:04,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:04,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2024-11-09 07:06:04,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:05,231 INFO L124 PetriNetUnfolderBase]: 159/765 cut-off events. [2024-11-09 07:06:05,232 INFO L125 PetriNetUnfolderBase]: For 191/232 co-relation queries the response was YES. [2024-11-09 07:06:05,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 765 events. 159/765 cut-off events. For 191/232 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4346 event pairs, 30 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 1428. Up to 252 conditions per place. [2024-11-09 07:06:05,237 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 35 selfloop transitions, 48 changer transitions 0/205 dead transitions. [2024-11-09 07:06:05,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 205 transitions, 853 flow [2024-11-09 07:06:05,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 713 transitions. [2024-11-09 07:06:05,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8868159203980099 [2024-11-09 07:06:05,240 INFO L175 Difference]: Start difference. First operand has 146 places, 162 transitions, 531 flow. Second operand 6 states and 713 transitions. [2024-11-09 07:06:05,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 205 transitions, 853 flow [2024-11-09 07:06:05,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 205 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:05,246 INFO L231 Difference]: Finished difference. Result has 156 places, 205 transitions, 919 flow [2024-11-09 07:06:05,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=156, PETRI_TRANSITIONS=205} [2024-11-09 07:06:05,248 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 25 predicate places. [2024-11-09 07:06:05,248 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 205 transitions, 919 flow [2024-11-09 07:06:05,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 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-09 07:06:05,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:05,249 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, 1, 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-09 07:06:05,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 07:06:05,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:05,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:05,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:05,450 INFO L85 PathProgramCache]: Analyzing trace with hash -810644308, now seen corresponding path program 1 times [2024-11-09 07:06:05,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:05,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627631477] [2024-11-09 07:06:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:05,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:05,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 07:06:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:05,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:06:05,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:05,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 07:06:05,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2024-11-09 07:06:05,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:05,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 [2024-11-09 07:06:05,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:05,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63 [2024-11-09 07:06:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:06:05,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:05,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627631477] [2024-11-09 07:06:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627631477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:05,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:05,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:06:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820740316] [2024-11-09 07:06:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:05,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:06:05,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:05,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:06:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:06:05,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2024-11-09 07:06:05,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 205 transitions, 919 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:06:05,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:05,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2024-11-09 07:06:05,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:06,210 INFO L124 PetriNetUnfolderBase]: 179/886 cut-off events. [2024-11-09 07:06:06,211 INFO L125 PetriNetUnfolderBase]: For 610/750 co-relation queries the response was YES. [2024-11-09 07:06:06,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2254 conditions, 886 events. 179/886 cut-off events. For 610/750 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5582 event pairs, 25 based on Foata normal form. 4/842 useless extension candidates. Maximal degree in co-relation 2128. Up to 274 conditions per place. [2024-11-09 07:06:06,218 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 75 selfloop transitions, 31 changer transitions 7/233 dead transitions. [2024-11-09 07:06:06,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 233 transitions, 1306 flow [2024-11-09 07:06:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:06:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:06:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions. [2024-11-09 07:06:06,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8619402985074627 [2024-11-09 07:06:06,222 INFO L175 Difference]: Start difference. First operand has 156 places, 205 transitions, 919 flow. Second operand 6 states and 693 transitions. [2024-11-09 07:06:06,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 233 transitions, 1306 flow [2024-11-09 07:06:06,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 233 transitions, 1288 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:06,233 INFO L231 Difference]: Finished difference. Result has 166 places, 226 transitions, 1202 flow [2024-11-09 07:06:06,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1202, PETRI_PLACES=166, PETRI_TRANSITIONS=226} [2024-11-09 07:06:06,235 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 35 predicate places. [2024-11-09 07:06:06,235 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 226 transitions, 1202 flow [2024-11-09 07:06:06,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:06:06,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:06,236 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, 1, 1, 1, 1, 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-09 07:06:06,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 07:06:06,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:06,437 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:06,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1862015287, now seen corresponding path program 1 times [2024-11-09 07:06:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:06,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023534427] [2024-11-09 07:06:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:06,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:06,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:06,441 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:06,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 07:06:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:06,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:06:06,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:06,534 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-09 07:06:06,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:06,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023534427] [2024-11-09 07:06:06,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023534427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:06,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:06,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:06:06,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929600207] [2024-11-09 07:06:06,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:06,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:06:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:06:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:06:06,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 134 [2024-11-09 07:06:06,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 226 transitions, 1202 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-09 07:06:06,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:06,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 134 [2024-11-09 07:06:06,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:06,690 INFO L124 PetriNetUnfolderBase]: 186/872 cut-off events. [2024-11-09 07:06:06,690 INFO L125 PetriNetUnfolderBase]: For 654/703 co-relation queries the response was YES. [2024-11-09 07:06:06,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 872 events. 186/872 cut-off events. For 654/703 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5389 event pairs, 15 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 2169. Up to 130 conditions per place. [2024-11-09 07:06:06,698 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 14 selfloop transitions, 11 changer transitions 18/233 dead transitions. [2024-11-09 07:06:06,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 233 transitions, 1280 flow [2024-11-09 07:06:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:06:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:06:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-11-09 07:06:06,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.927860696517413 [2024-11-09 07:06:06,701 INFO L175 Difference]: Start difference. First operand has 166 places, 226 transitions, 1202 flow. Second operand 3 states and 373 transitions. [2024-11-09 07:06:06,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 233 transitions, 1280 flow [2024-11-09 07:06:06,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 233 transitions, 1224 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-11-09 07:06:06,714 INFO L231 Difference]: Finished difference. Result has 166 places, 215 transitions, 1143 flow [2024-11-09 07:06:06,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1143, PETRI_PLACES=166, PETRI_TRANSITIONS=215} [2024-11-09 07:06:06,717 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 35 predicate places. [2024-11-09 07:06:06,717 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 215 transitions, 1143 flow [2024-11-09 07:06:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-09 07:06:06,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:06,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:06:06,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:06:06,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:06,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:06,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2127031774, now seen corresponding path program 1 times [2024-11-09 07:06:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:06,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282436453] [2024-11-09 07:06:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:06,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:06,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:06,920 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:06,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 07:06:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:07,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:06:07,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:07,019 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 7 [2024-11-09 07:06:07,042 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:06:07,043 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 13 treesize of output 13 [2024-11-09 07:06:07,127 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 13 [2024-11-09 07:06:07,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2024-11-09 07:06:07,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:07,218 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 44 treesize of output 52 [2024-11-09 07:06:07,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:07,289 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 58 treesize of output 71 [2024-11-09 07:06:07,616 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 64 treesize of output 53 [2024-11-09 07:06:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:07,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:07,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282436453] [2024-11-09 07:06:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282436453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:07,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:07,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:06:07,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163819359] [2024-11-09 07:06:07,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:07,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:06:07,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:07,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:06:07,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:06:08,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 134 [2024-11-09 07:06:08,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 215 transitions, 1143 flow. Second operand has 11 states, 11 states have (on average 101.9090909090909) internal successors, (1121), 11 states have internal predecessors, (1121), 0 states have call successors, (0), 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-09 07:06:08,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:08,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 134 [2024-11-09 07:06:08,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:09,065 INFO L124 PetriNetUnfolderBase]: 193/884 cut-off events. [2024-11-09 07:06:09,066 INFO L125 PetriNetUnfolderBase]: For 1024/1289 co-relation queries the response was YES. [2024-11-09 07:06:09,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2668 conditions, 884 events. 193/884 cut-off events. For 1024/1289 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5465 event pairs, 26 based on Foata normal form. 44/902 useless extension candidates. Maximal degree in co-relation 2527. Up to 137 conditions per place. [2024-11-09 07:06:09,074 INFO L140 encePairwiseOnDemand]: 122/134 looper letters, 98 selfloop transitions, 50 changer transitions 4/260 dead transitions. [2024-11-09 07:06:09,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 260 transitions, 1767 flow [2024-11-09 07:06:09,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:06:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 07:06:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1258 transitions. [2024-11-09 07:06:09,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7823383084577115 [2024-11-09 07:06:09,079 INFO L175 Difference]: Start difference. First operand has 166 places, 215 transitions, 1143 flow. Second operand 12 states and 1258 transitions. [2024-11-09 07:06:09,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 260 transitions, 1767 flow [2024-11-09 07:06:09,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 260 transitions, 1744 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 07:06:09,094 INFO L231 Difference]: Finished difference. Result has 163 places, 213 transitions, 1206 flow [2024-11-09 07:06:09,096 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1206, PETRI_PLACES=163, PETRI_TRANSITIONS=213} [2024-11-09 07:06:09,096 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 32 predicate places. [2024-11-09 07:06:09,097 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 213 transitions, 1206 flow [2024-11-09 07:06:09,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.9090909090909) internal successors, (1121), 11 states have internal predecessors, (1121), 0 states have call successors, (0), 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-09 07:06:09,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:09,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:06:09,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 07:06:09,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:09,298 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:09,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:09,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1949998659, now seen corresponding path program 1 times [2024-11-09 07:06:09,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:09,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21799106] [2024-11-09 07:06:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:09,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:09,300 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:09,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 07:06:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:09,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:06:09,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:09,406 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 7 [2024-11-09 07:06:09,431 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:06:09,431 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 13 treesize of output 13 [2024-11-09 07:06:09,505 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-09 07:06:09,595 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 29 [2024-11-09 07:06:09,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:09,640 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 46 [2024-11-09 07:06:09,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:09,705 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 63 [2024-11-09 07:06:09,778 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-09 07:06:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:06:09,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:06:09,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:06:09,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21799106] [2024-11-09 07:06:09,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21799106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:06:09,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:06:09,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:06:09,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118080815] [2024-11-09 07:06:09,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:06:09,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:06:09,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:06:09,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:06:09,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:06:10,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 134 [2024-11-09 07:06:10,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 213 transitions, 1206 flow. Second operand has 11 states, 11 states have (on average 101.81818181818181) internal successors, (1120), 11 states have internal predecessors, (1120), 0 states have call successors, (0), 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-09 07:06:10,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:10,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 134 [2024-11-09 07:06:10,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:10,979 INFO L124 PetriNetUnfolderBase]: 168/812 cut-off events. [2024-11-09 07:06:10,980 INFO L125 PetriNetUnfolderBase]: For 917/1050 co-relation queries the response was YES. [2024-11-09 07:06:10,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 812 events. 168/812 cut-off events. For 917/1050 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4987 event pairs, 11 based on Foata normal form. 9/800 useless extension candidates. Maximal degree in co-relation 2352. Up to 156 conditions per place. [2024-11-09 07:06:10,985 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 55 selfloop transitions, 6 changer transitions 68/235 dead transitions. [2024-11-09 07:06:10,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 235 transitions, 1706 flow [2024-11-09 07:06:10,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:06:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 07:06:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1240 transitions. [2024-11-09 07:06:10,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7711442786069652 [2024-11-09 07:06:10,990 INFO L175 Difference]: Start difference. First operand has 163 places, 213 transitions, 1206 flow. Second operand 12 states and 1240 transitions. [2024-11-09 07:06:10,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 235 transitions, 1706 flow [2024-11-09 07:06:11,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 235 transitions, 1548 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-11-09 07:06:11,003 INFO L231 Difference]: Finished difference. Result has 162 places, 167 transitions, 816 flow [2024-11-09 07:06:11,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=816, PETRI_PLACES=162, PETRI_TRANSITIONS=167} [2024-11-09 07:06:11,006 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 31 predicate places. [2024-11-09 07:06:11,006 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 167 transitions, 816 flow [2024-11-09 07:06:11,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.81818181818181) internal successors, (1120), 11 states have internal predecessors, (1120), 0 states have call successors, (0), 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-09 07:06:11,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:11,007 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:06:11,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 07:06:11,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:11,212 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 07:06:11,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash 739926681, now seen corresponding path program 1 times [2024-11-09 07:06:11,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:06:11,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787475531] [2024-11-09 07:06:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:11,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:11,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:06:11,216 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:06:11,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 07:06:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:06:11,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:06:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:06:11,417 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 07:06:11,417 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:06:11,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-11-09 07:06:11,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-09 07:06:11,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-09 07:06:11,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-09 07:06:11,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-09 07:06:11,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-09 07:06:11,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-09 07:06:11,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-11-09 07:06:11,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-09 07:06:11,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-09 07:06:11,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-09 07:06:11,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-09 07:06:11,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-09 07:06:11,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-09 07:06:11,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-09 07:06:11,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-09 07:06:11,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:06:11,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:06:11,623 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:11,697 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:06:11,697 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:06:11,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:06:11 BasicIcfg [2024-11-09 07:06:11,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:06:11,703 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:06:11,703 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:06:11,703 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:06:11,704 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:59" (3/4) ... [2024-11-09 07:06:11,705 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 07:06:11,788 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:06:11,788 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:06:11,789 INFO L158 Benchmark]: Toolchain (without parser) took 13955.60ms. Allocated memory was 79.7MB in the beginning and 146.8MB in the end (delta: 67.1MB). Free memory was 44.1MB in the beginning and 109.5MB in the end (delta: -65.4MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2024-11-09 07:06:11,789 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 56.6MB. Free memory was 35.6MB in the beginning and 35.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:06:11,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.72ms. Allocated memory is still 79.7MB. Free memory was 43.9MB in the beginning and 32.8MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:06:11,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.69ms. Allocated memory is still 79.7MB. Free memory was 32.8MB in the beginning and 55.0MB in the end (delta: -22.2MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-09 07:06:11,790 INFO L158 Benchmark]: Boogie Preprocessor took 68.30ms. Allocated memory is still 79.7MB. Free memory was 55.0MB in the beginning and 53.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:06:11,790 INFO L158 Benchmark]: RCFGBuilder took 630.44ms. Allocated memory is still 79.7MB. Free memory was 52.9MB in the beginning and 31.5MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 07:06:11,790 INFO L158 Benchmark]: TraceAbstraction took 12344.79ms. Allocated memory was 79.7MB in the beginning and 146.8MB in the end (delta: 67.1MB). Free memory was 31.0MB in the beginning and 116.8MB in the end (delta: -85.9MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2024-11-09 07:06:11,791 INFO L158 Benchmark]: Witness Printer took 85.36ms. Allocated memory is still 146.8MB. Free memory was 116.8MB in the beginning and 109.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:06:11,792 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 56.6MB. Free memory was 35.6MB in the beginning and 35.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 739.72ms. Allocated memory is still 79.7MB. Free memory was 43.9MB in the beginning and 32.8MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.69ms. Allocated memory is still 79.7MB. Free memory was 32.8MB in the beginning and 55.0MB in the end (delta: -22.2MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.30ms. Allocated memory is still 79.7MB. Free memory was 55.0MB in the beginning and 53.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 630.44ms. Allocated memory is still 79.7MB. Free memory was 52.9MB in the beginning and 31.5MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12344.79ms. Allocated memory was 79.7MB in the beginning and 146.8MB in the end (delta: 67.1MB). Free memory was 31.0MB in the beginning and 116.8MB in the end (delta: -85.9MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * Witness Printer took 85.36ms. Allocated memory is still 146.8MB. Free memory was 116.8MB in the beginning and 109.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1058]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=16] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=16, tids={1:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={2:0}, threads_mask=-1, threads_total=16, tids={1:0}] [L1057] 0 int i = 0; VAL [datas={2:0}, i=0, threads_mask=-1, threads_total=16, tids={1:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={2:0}, i=0, threads_mask=-1, threads_total=16, tids={1:0}] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={2:0}, i=0, threads_mask=-1, threads_total=16, tids={1:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={2:0}, i=0, j=0, threads_mask=-1, threads_total=16, tids={1:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={2:0}, i=0, j=0, threads_mask=-2, threads_total=16, tids={1:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={2:0}, i=0, j=0, threads_mask=-2, threads_total=16, tids={1:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:0}, datas={2:0}, i=0, j=0, threads_mask=-2, threads_total=16, tids={1:0}] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2] [L1057] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, i=1, j=0, threads_mask=-2, threads_total=16, tids={1:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, i=1, j=0, threads_mask=-2, threads_total=16, tids={1:0}] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, i=1, j=0, threads_mask=-1, threads_total=16, tids={1:0}] Now there is a data race on ~threads_mask~0 between C: threads_mask |= 1 << j [1048] and C: ffs(threads_mask) [1058] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 157 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 982 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 703 mSDsluCounter, 1023 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2567 IncrementalHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 57 mSDtfsCounter, 2567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 707 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1206occurred in iteration=11, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 2764 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1084 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 07:06:11,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE