./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/dekker-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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-atomic/dekker-b.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 ee2c91df2652a75c113f2667be77b799d83dae8d01b1c36baa45b8c25ceec25f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:28:18,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:28:18,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:28:18,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:28:18,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:28:18,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:28:18,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:28:18,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:28:18,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:28:18,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:28:18,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:28:18,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:28:18,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:28:18,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:28:18,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:28:18,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:28:18,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:28:18,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:28:18,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:28:18,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:28:18,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:28:18,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:28:18,473 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:28:18,473 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:28:18,474 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:28:18,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:28:18,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:28:18,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:28:18,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:28:18,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:28:18,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:28:18,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:28:18,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:28:18,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:28:18,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:28:18,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:28:18,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:28:18,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:28:18,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:28:18,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:28:18,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:28:18,477 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 -> ee2c91df2652a75c113f2667be77b799d83dae8d01b1c36baa45b8c25ceec25f [2024-11-19 05:28:18,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:28:18,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:28:18,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:28:18,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:28:18,688 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:28:18,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/dekker-b.i [2024-11-19 05:28:19,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:28:20,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:28:20,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-b.i [2024-11-19 05:28:20,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530248e95/5dba2a3c739d4759aacb689acd92ed6f/FLAG81ffb3bb2 [2024-11-19 05:28:20,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530248e95/5dba2a3c739d4759aacb689acd92ed6f [2024-11-19 05:28:20,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:28:20,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:28:20,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:28:20,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:28:20,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:28:20,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9e5df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20, skipping insertion in model container [2024-11-19 05:28:20,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:28:20,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:28:20,466 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:28:20,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:28:20,532 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:28:20,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20 WrapperNode [2024-11-19 05:28:20,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:28:20,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:28:20,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:28:20,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:28:20,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,573 INFO L138 Inliner]: procedures = 161, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2024-11-19 05:28:20,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:28:20,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:28:20,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:28:20,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:28:20,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:28:20,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:28:20,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:28:20,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:28:20,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:28:20,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:28:20,622 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-19 05:28:20,624 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-19 05:28:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-19 05:28:20,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-19 05:28:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-19 05:28:20,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-19 05:28:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:28:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:28:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:28:20,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:28:20,655 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:28:20,756 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:28:20,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:28:20,965 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:28:20,965 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:28:20,982 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:28:20,983 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 05:28:20,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:28:20 BoogieIcfgContainer [2024-11-19 05:28:20,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:28:20,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:28:20,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:28:20,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:28:20,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:28:20" (1/3) ... [2024-11-19 05:28:20,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3af663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:28:20, skipping insertion in model container [2024-11-19 05:28:20,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (2/3) ... [2024-11-19 05:28:20,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3af663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:28:20, skipping insertion in model container [2024-11-19 05:28:20,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:28:20" (3/3) ... [2024-11-19 05:28:20,989 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker-b.i [2024-11-19 05:28:21,001 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:28:21,002 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-19 05:28:21,002 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:28:21,071 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:28:21,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 185 transitions, 384 flow [2024-11-19 05:28:21,152 INFO L124 PetriNetUnfolderBase]: 16/183 cut-off events. [2024-11-19 05:28:21,153 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:28:21,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 16/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 435 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 142. Up to 3 conditions per place. [2024-11-19 05:28:21,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 185 transitions, 384 flow [2024-11-19 05:28:21,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 178 transitions, 365 flow [2024-11-19 05:28:21,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:28:21,184 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;@7bf42e0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:28:21,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-19 05:28:21,188 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:28:21,188 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-11-19 05:28:21,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:28:21,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:21,189 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:21,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:21,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1850524738, now seen corresponding path program 1 times [2024-11-19 05:28:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:21,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934542574] [2024-11-19 05:28:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:21,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:21,345 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-19 05:28:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934542574] [2024-11-19 05:28:21,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934542574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:21,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:21,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418016046] [2024-11-19 05:28:21,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:21,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:21,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:21,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:21,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 185 [2024-11-19 05:28:21,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 178 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:21,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:21,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 185 [2024-11-19 05:28:21,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:21,567 INFO L124 PetriNetUnfolderBase]: 98/790 cut-off events. [2024-11-19 05:28:21,568 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2024-11-19 05:28:21,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 790 events. 98/790 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4984 event pairs, 23 based on Foata normal form. 66/687 useless extension candidates. Maximal degree in co-relation 812. Up to 99 conditions per place. [2024-11-19 05:28:21,578 INFO L140 encePairwiseOnDemand]: 159/185 looper letters, 22 selfloop transitions, 11 changer transitions 1/177 dead transitions. [2024-11-19 05:28:21,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 435 flow [2024-11-19 05:28:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2024-11-19 05:28:21,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9225225225225225 [2024-11-19 05:28:21,596 INFO L175 Difference]: Start difference. First operand has 169 places, 178 transitions, 365 flow. Second operand 3 states and 512 transitions. [2024-11-19 05:28:21,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 177 transitions, 435 flow [2024-11-19 05:28:21,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 177 transitions, 427 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 05:28:21,605 INFO L231 Difference]: Finished difference. Result has 166 places, 174 transitions, 424 flow [2024-11-19 05:28:21,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=166, PETRI_TRANSITIONS=174} [2024-11-19 05:28:21,611 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, -3 predicate places. [2024-11-19 05:28:21,613 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 174 transitions, 424 flow [2024-11-19 05:28:21,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:21,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:21,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] [2024-11-19 05:28:21,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:28:21,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:21,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 857512282, now seen corresponding path program 1 times [2024-11-19 05:28:21,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:21,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546555090] [2024-11-19 05:28:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:21,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:21,749 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-19 05:28:21,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:21,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546555090] [2024-11-19 05:28:21,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546555090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:21,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:21,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:28:21,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039755284] [2024-11-19 05:28:21,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:21,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:28:21,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:21,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:28:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:28:21,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 185 [2024-11-19 05:28:21,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 174 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 0 states have call successors, (0), 0 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-19 05:28:21,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:21,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 185 [2024-11-19 05:28:21,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:21,870 INFO L124 PetriNetUnfolderBase]: 63/589 cut-off events. [2024-11-19 05:28:21,870 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-19 05:28:21,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 589 events. 63/589 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3384 event pairs, 13 based on Foata normal form. 6/488 useless extension candidates. Maximal degree in co-relation 686. Up to 53 conditions per place. [2024-11-19 05:28:21,876 INFO L140 encePairwiseOnDemand]: 176/185 looper letters, 12 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2024-11-19 05:28:21,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 156 transitions, 411 flow [2024-11-19 05:28:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:28:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 05:28:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2024-11-19 05:28:21,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8716216216216216 [2024-11-19 05:28:21,880 INFO L175 Difference]: Start difference. First operand has 166 places, 174 transitions, 424 flow. Second operand 4 states and 645 transitions. [2024-11-19 05:28:21,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 156 transitions, 411 flow [2024-11-19 05:28:21,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 156 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:21,885 INFO L231 Difference]: Finished difference. Result has 152 places, 154 transitions, 376 flow [2024-11-19 05:28:21,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=376, PETRI_PLACES=152, PETRI_TRANSITIONS=154} [2024-11-19 05:28:21,887 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, -17 predicate places. [2024-11-19 05:28:21,887 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 154 transitions, 376 flow [2024-11-19 05:28:21,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 0 states have call successors, (0), 0 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-19 05:28:21,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:21,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:21,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:28:21,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:21,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1088403536, now seen corresponding path program 1 times [2024-11-19 05:28:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:21,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430729787] [2024-11-19 05:28:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:21,947 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-19 05:28:21,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430729787] [2024-11-19 05:28:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430729787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:21,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:21,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:21,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807028960] [2024-11-19 05:28:21,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:21,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:21,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:21,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:21,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:21,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2024-11-19 05:28:21,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 154 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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-19 05:28:21,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:21,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2024-11-19 05:28:21,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,067 INFO L124 PetriNetUnfolderBase]: 65/767 cut-off events. [2024-11-19 05:28:22,068 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-19 05:28:22,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 767 events. 65/767 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4831 event pairs, 15 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 777. Up to 64 conditions per place. [2024-11-19 05:28:22,072 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 10 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2024-11-19 05:28:22,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 158 transitions, 414 flow [2024-11-19 05:28:22,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2024-11-19 05:28:22,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9081081081081082 [2024-11-19 05:28:22,073 INFO L175 Difference]: Start difference. First operand has 152 places, 154 transitions, 376 flow. Second operand 3 states and 504 transitions. [2024-11-19 05:28:22,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 158 transitions, 414 flow [2024-11-19 05:28:22,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 158 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:22,079 INFO L231 Difference]: Finished difference. Result has 154 places, 157 transitions, 399 flow [2024-11-19 05:28:22,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=154, PETRI_TRANSITIONS=157} [2024-11-19 05:28:22,080 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, -15 predicate places. [2024-11-19 05:28:22,080 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 157 transitions, 399 flow [2024-11-19 05:28:22,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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-19 05:28:22,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:22,081 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] [2024-11-19 05:28:22,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:28:22,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:22,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1922159727, now seen corresponding path program 1 times [2024-11-19 05:28:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740351169] [2024-11-19 05:28:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:22,117 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-19 05:28:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:22,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740351169] [2024-11-19 05:28:22,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740351169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:22,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:22,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:22,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50372631] [2024-11-19 05:28:22,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:22,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:22,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:22,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:22,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:22,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2024-11-19 05:28:22,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 157 transitions, 399 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-19 05:28:22,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:22,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2024-11-19 05:28:22,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,247 INFO L124 PetriNetUnfolderBase]: 121/1159 cut-off events. [2024-11-19 05:28:22,249 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-19 05:28:22,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 1159 events. 121/1159 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 8857 event pairs, 19 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1424. Up to 104 conditions per place. [2024-11-19 05:28:22,258 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 12 selfloop transitions, 6 changer transitions 0/165 dead transitions. [2024-11-19 05:28:22,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 165 transitions, 454 flow [2024-11-19 05:28:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-11-19 05:28:22,260 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9261261261261261 [2024-11-19 05:28:22,260 INFO L175 Difference]: Start difference. First operand has 154 places, 157 transitions, 399 flow. Second operand 3 states and 514 transitions. [2024-11-19 05:28:22,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 165 transitions, 454 flow [2024-11-19 05:28:22,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 165 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:22,266 INFO L231 Difference]: Finished difference. Result has 156 places, 163 transitions, 441 flow [2024-11-19 05:28:22,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=156, PETRI_TRANSITIONS=163} [2024-11-19 05:28:22,267 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, -13 predicate places. [2024-11-19 05:28:22,268 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 163 transitions, 441 flow [2024-11-19 05:28:22,268 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-19 05:28:22,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:22,269 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:22,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:28:22,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:22,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1443001506, now seen corresponding path program 1 times [2024-11-19 05:28:22,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:22,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564089425] [2024-11-19 05:28:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:22,315 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-19 05:28:22,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564089425] [2024-11-19 05:28:22,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564089425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:22,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:22,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608866221] [2024-11-19 05:28:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:22,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:22,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:22,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:22,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:22,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2024-11-19 05:28:22,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 163 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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-19 05:28:22,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:22,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2024-11-19 05:28:22,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,427 INFO L124 PetriNetUnfolderBase]: 157/1271 cut-off events. [2024-11-19 05:28:22,428 INFO L125 PetriNetUnfolderBase]: For 200/214 co-relation queries the response was YES. [2024-11-19 05:28:22,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1271 events. 157/1271 cut-off events. For 200/214 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 9986 event pairs, 29 based on Foata normal form. 0/1042 useless extension candidates. Maximal degree in co-relation 1078. Up to 133 conditions per place. [2024-11-19 05:28:22,436 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 16 selfloop transitions, 6 changer transitions 0/168 dead transitions. [2024-11-19 05:28:22,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 168 transitions, 502 flow [2024-11-19 05:28:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-19 05:28:22,437 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2024-11-19 05:28:22,437 INFO L175 Difference]: Start difference. First operand has 156 places, 163 transitions, 441 flow. Second operand 3 states and 506 transitions. [2024-11-19 05:28:22,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 168 transitions, 502 flow [2024-11-19 05:28:22,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 168 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:22,441 INFO L231 Difference]: Finished difference. Result has 158 places, 167 transitions, 475 flow [2024-11-19 05:28:22,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=475, PETRI_PLACES=158, PETRI_TRANSITIONS=167} [2024-11-19 05:28:22,444 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, -11 predicate places. [2024-11-19 05:28:22,444 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 167 transitions, 475 flow [2024-11-19 05:28:22,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 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-19 05:28:22,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:22,445 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] [2024-11-19 05:28:22,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:28:22,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:22,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 535479866, now seen corresponding path program 1 times [2024-11-19 05:28:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433972892] [2024-11-19 05:28:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:22,491 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-19 05:28:22,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:22,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433972892] [2024-11-19 05:28:22,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433972892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:22,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:22,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:22,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046076069] [2024-11-19 05:28:22,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:22,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:22,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:22,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:22,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:22,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2024-11-19 05:28:22,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 167 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 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-19 05:28:22,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:22,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2024-11-19 05:28:22,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,624 INFO L124 PetriNetUnfolderBase]: 178/1523 cut-off events. [2024-11-19 05:28:22,624 INFO L125 PetriNetUnfolderBase]: For 85/88 co-relation queries the response was YES. [2024-11-19 05:28:22,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 1523 events. 178/1523 cut-off events. For 85/88 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 12953 event pairs, 40 based on Foata normal form. 0/1250 useless extension candidates. Maximal degree in co-relation 1606. Up to 146 conditions per place. [2024-11-19 05:28:22,632 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 11 selfloop transitions, 5 changer transitions 0/172 dead transitions. [2024-11-19 05:28:22,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 172 transitions, 519 flow [2024-11-19 05:28:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-11-19 05:28:22,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9171171171171171 [2024-11-19 05:28:22,634 INFO L175 Difference]: Start difference. First operand has 158 places, 167 transitions, 475 flow. Second operand 3 states and 509 transitions. [2024-11-19 05:28:22,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 172 transitions, 519 flow [2024-11-19 05:28:22,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 172 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:22,638 INFO L231 Difference]: Finished difference. Result has 160 places, 171 transitions, 501 flow [2024-11-19 05:28:22,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=160, PETRI_TRANSITIONS=171} [2024-11-19 05:28:22,640 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, -9 predicate places. [2024-11-19 05:28:22,640 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 171 transitions, 501 flow [2024-11-19 05:28:22,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 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-19 05:28:22,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:22,641 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-19 05:28:22,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:28:22,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:22,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 130670299, now seen corresponding path program 1 times [2024-11-19 05:28:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239045005] [2024-11-19 05:28:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:22,674 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-19 05:28:22,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:22,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239045005] [2024-11-19 05:28:22,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239045005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:22,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:22,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:22,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217280232] [2024-11-19 05:28:22,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:22,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:22,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:22,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:22,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:22,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2024-11-19 05:28:22,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 171 transitions, 501 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-19 05:28:22,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:22,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2024-11-19 05:28:22,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L710-->L710-1: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][133], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 125#L710-1true, 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 179#true, 207#true, 184#true, Black: 186#(= ~turn~0 0), 23#L703-2true]) [2024-11-19 05:28:22,767 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:22,767 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,767 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,767 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([548] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 125#L710-1true, 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 207#true, 184#true, Black: 186#(= ~turn~0 0), 23#L703-2true]) [2024-11-19 05:28:22,772 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:22,772 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,772 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,773 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([548] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 207#true, 184#true, Black: 186#(= ~turn~0 0), 121#L710-2true, 23#L703-2true]) [2024-11-19 05:28:22,777 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-11-19 05:28:22,777 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:22,777 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:22,777 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:22,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L710-2-->L710-4: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][128], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 90#L703true, Black: 179#true, 160#L710-4true, 207#true, 184#true, Black: 186#(= ~turn~0 0)]) [2024-11-19 05:28:22,777 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:22,778 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,778 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,778 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L704-2-->L704-3: Formula: (= |v_#race~flag1~0_7| |v_thr1Thread1of1ForFork1_#t~nondet6#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|} OutVars{thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|, #race~flag1~0=|v_#race~flag1~0_7|} AuxVars[] AssignedVars[#race~flag1~0][146], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), 114#L704-3true, Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 177#true, 106#L709-2true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 207#true, 184#true, Black: 186#(= ~turn~0 0), 212#true]) [2024-11-19 05:28:22,778 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:28:22,779 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:22,779 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:22,779 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:22,845 INFO L124 PetriNetUnfolderBase]: 289/2283 cut-off events. [2024-11-19 05:28:22,846 INFO L125 PetriNetUnfolderBase]: For 166/175 co-relation queries the response was YES. [2024-11-19 05:28:22,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3345 conditions, 2283 events. 289/2283 cut-off events. For 166/175 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 21778 event pairs, 40 based on Foata normal form. 2/1879 useless extension candidates. Maximal degree in co-relation 3224. Up to 193 conditions per place. [2024-11-19 05:28:22,854 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 9 selfloop transitions, 5 changer transitions 0/176 dead transitions. [2024-11-19 05:28:22,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 176 transitions, 544 flow [2024-11-19 05:28:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-11-19 05:28:22,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9171171171171171 [2024-11-19 05:28:22,856 INFO L175 Difference]: Start difference. First operand has 160 places, 171 transitions, 501 flow. Second operand 3 states and 509 transitions. [2024-11-19 05:28:22,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 176 transitions, 544 flow [2024-11-19 05:28:22,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 176 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:22,859 INFO L231 Difference]: Finished difference. Result has 162 places, 175 transitions, 533 flow [2024-11-19 05:28:22,859 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=162, PETRI_TRANSITIONS=175} [2024-11-19 05:28:22,860 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, -7 predicate places. [2024-11-19 05:28:22,860 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 175 transitions, 533 flow [2024-11-19 05:28:22,861 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-19 05:28:22,861 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:22,861 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-19 05:28:22,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:28:22,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:22,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash 972703830, now seen corresponding path program 1 times [2024-11-19 05:28:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:22,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634862392] [2024-11-19 05:28:22,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:22,889 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-19 05:28:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634862392] [2024-11-19 05:28:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634862392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:22,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:22,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:22,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905187561] [2024-11-19 05:28:22,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:22,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:22,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:22,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:22,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2024-11-19 05:28:22,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 175 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 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-19 05:28:22,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:22,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2024-11-19 05:28:22,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L710-->L710-1: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][137], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 125#L710-1true, 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 179#true, Black: 212#true, 184#true, Black: 186#(= ~turn~0 0), 23#L703-2true]) [2024-11-19 05:28:22,981 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:22,981 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,981 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,981 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([548] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 125#L710-1true, 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), Black: 212#true, 184#true, Black: 186#(= ~turn~0 0), 23#L703-2true]) [2024-11-19 05:28:22,987 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:22,987 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,988 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,988 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([548] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), Black: 212#true, 184#true, Black: 186#(= ~turn~0 0), 121#L710-2true, 23#L703-2true]) [2024-11-19 05:28:22,995 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-11-19 05:28:22,995 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:22,995 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:22,996 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:22,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L710-2-->L710-4: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][140], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 90#L703true, Black: 179#true, Black: 212#true, 160#L710-4true, 184#true, Black: 186#(= ~turn~0 0)]) [2024-11-19 05:28:22,996 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:22,996 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,996 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,996 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L704-2-->L704-3: Formula: (= |v_#race~flag1~0_7| |v_thr1Thread1of1ForFork1_#t~nondet6#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|} OutVars{thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|, #race~flag1~0=|v_#race~flag1~0_7|} AuxVars[] AssignedVars[#race~flag1~0][147], [114#L704-3true, Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 177#true, 106#L709-2true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 214#(= |#race~flag1~0| 0), Black: 181#(= |#race~turn~0| 0), 184#true, Black: 186#(= ~turn~0 0), 212#true]) [2024-11-19 05:28:22,997 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:28:22,997 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:22,997 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:22,998 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:23,091 INFO L124 PetriNetUnfolderBase]: 335/2658 cut-off events. [2024-11-19 05:28:23,092 INFO L125 PetriNetUnfolderBase]: For 322/347 co-relation queries the response was YES. [2024-11-19 05:28:23,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4053 conditions, 2658 events. 335/2658 cut-off events. For 322/347 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 26967 event pairs, 54 based on Foata normal form. 1/2228 useless extension candidates. Maximal degree in co-relation 3266. Up to 215 conditions per place. [2024-11-19 05:28:23,101 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 14 selfloop transitions, 7 changer transitions 0/183 dead transitions. [2024-11-19 05:28:23,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 183 transitions, 600 flow [2024-11-19 05:28:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2024-11-19 05:28:23,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9243243243243243 [2024-11-19 05:28:23,104 INFO L175 Difference]: Start difference. First operand has 162 places, 175 transitions, 533 flow. Second operand 3 states and 513 transitions. [2024-11-19 05:28:23,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 183 transitions, 600 flow [2024-11-19 05:28:23,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 183 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:23,107 INFO L231 Difference]: Finished difference. Result has 164 places, 181 transitions, 585 flow [2024-11-19 05:28:23,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=164, PETRI_TRANSITIONS=181} [2024-11-19 05:28:23,109 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, -5 predicate places. [2024-11-19 05:28:23,110 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 181 transitions, 585 flow [2024-11-19 05:28:23,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 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-19 05:28:23,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:23,110 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] [2024-11-19 05:28:23,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:28:23,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:23,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash 105334337, now seen corresponding path program 1 times [2024-11-19 05:28:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:23,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695653147] [2024-11-19 05:28:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:28:23,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:28:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:28:23,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:28:23,152 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:28:23,153 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (43 of 44 remaining) [2024-11-19 05:28:23,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2024-11-19 05:28:23,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2024-11-19 05:28:23,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2024-11-19 05:28:23,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2024-11-19 05:28:23,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2024-11-19 05:28:23,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2024-11-19 05:28:23,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2024-11-19 05:28:23,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2024-11-19 05:28:23,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2024-11-19 05:28:23,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2024-11-19 05:28:23,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2024-11-19 05:28:23,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2024-11-19 05:28:23,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2024-11-19 05:28:23,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2024-11-19 05:28:23,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2024-11-19 05:28:23,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2024-11-19 05:28:23,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2024-11-19 05:28:23,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2024-11-19 05:28:23,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2024-11-19 05:28:23,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2024-11-19 05:28:23,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2024-11-19 05:28:23,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2024-11-19 05:28:23,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 44 remaining) [2024-11-19 05:28:23,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 44 remaining) [2024-11-19 05:28:23,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2024-11-19 05:28:23,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2024-11-19 05:28:23,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2024-11-19 05:28:23,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2024-11-19 05:28:23,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2024-11-19 05:28:23,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2024-11-19 05:28:23,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2024-11-19 05:28:23,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2024-11-19 05:28:23,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2024-11-19 05:28:23,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2024-11-19 05:28:23,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2024-11-19 05:28:23,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2024-11-19 05:28:23,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2024-11-19 05:28:23,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2024-11-19 05:28:23,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2024-11-19 05:28:23,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2024-11-19 05:28:23,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2024-11-19 05:28:23,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2024-11-19 05:28:23,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2024-11-19 05:28:23,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:28:23,163 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:23,199 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:28:23,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:28:23,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:28:23 BasicIcfg [2024-11-19 05:28:23,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:28:23,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:28:23,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:28:23,207 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:28:23,208 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:28:20" (3/4) ... [2024-11-19 05:28:23,209 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 05:28:23,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:28:23,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:28:23,249 INFO L158 Benchmark]: Toolchain (without parser) took 3169.49ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 91.5MB in the beginning and 168.0MB in the end (delta: -76.5MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,249 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 159.4MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:28:23,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.27ms. Allocated memory is still 159.4MB. Free memory was 91.2MB in the beginning and 122.1MB in the end (delta: -30.9MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 159.4MB. Free memory was 121.5MB in the beginning and 119.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,250 INFO L158 Benchmark]: Boogie Preprocessor took 23.36ms. Allocated memory is still 159.4MB. Free memory was 119.4MB in the beginning and 117.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,250 INFO L158 Benchmark]: RCFGBuilder took 385.94ms. Allocated memory is still 159.4MB. Free memory was 117.9MB in the beginning and 100.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,250 INFO L158 Benchmark]: TraceAbstraction took 2221.89ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 99.6MB in the beginning and 173.3MB in the end (delta: -73.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,250 INFO L158 Benchmark]: Witness Printer took 41.33ms. Allocated memory is still 237.0MB. Free memory was 173.3MB in the beginning and 168.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,251 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.10ms. Allocated memory is still 159.4MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.27ms. Allocated memory is still 159.4MB. Free memory was 91.2MB in the beginning and 122.1MB in the end (delta: -30.9MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 159.4MB. Free memory was 121.5MB in the beginning and 119.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.36ms. Allocated memory is still 159.4MB. Free memory was 119.4MB in the beginning and 117.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.94ms. Allocated memory is still 159.4MB. Free memory was 117.9MB in the beginning and 100.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2221.89ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 99.6MB in the beginning and 173.3MB in the end (delta: -73.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Witness Printer took 41.33ms. Allocated memory is still 237.0MB. Free memory was 173.3MB in the beginning and 168.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L689] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L690] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L691] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L723] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L724] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L725] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1=-1, turn=0, x=0] [L693] 1 flag1 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L694] 1 flag2 >= 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L726] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, t1=-1, t2=0, turn=0, x=0] [L708] 2 flag2 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L694] 1 flag2 >= 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] Now there is a data race on ~flag2~0 between C: flag2 = 1 [708] and C: flag2 >= 1 [694] - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: 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: 726]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 292 locations, 44 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: 2.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 246 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 47 mSDtfsCounter, 246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=585occurred in iteration=8, InterpolantAutomatonStates: 25, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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-19 05:28:23,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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