./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.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 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:50:20,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:50:20,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:50:20,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:50:20,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:50:20,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:50:20,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:50:20,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:50:20,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:50:20,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:50:20,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:50:20,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:50:20,746 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:50:20,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:50:20,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:50:20,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:50:20,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:50:20,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:50:20,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:50:20,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:50:20,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:50:20,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:50:20,754 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:50:20,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:50:20,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:50:20,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:50:20,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:50:20,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:50:20,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:50:20,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:50:20,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:50:20,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:50:20,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:50:20,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:50:20,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:50:20,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:50:20,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:50:20,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:50:20,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:50:20,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:50:20,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:50:20,758 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 -> 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 [2024-11-09 06:50:21,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:50:21,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:50:21,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:50:21,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:50:21,046 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:50:21,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2024-11-09 06:50:22,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:50:22,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:50:22,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2024-11-09 06:50:22,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c87e7ea4/cf107fe22e5446bd82c7015db9b05530/FLAGa7e664ec2 [2024-11-09 06:50:23,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c87e7ea4/cf107fe22e5446bd82c7015db9b05530 [2024-11-09 06:50:23,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:50:23,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:50:23,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:50:23,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:50:23,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:50:23,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42288f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23, skipping insertion in model container [2024-11-09 06:50:23,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:50:23,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:50:23,524 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:50:23,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:50:23,634 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:50:23,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23 WrapperNode [2024-11-09 06:50:23,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:50:23,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:50:23,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:50:23,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:50:23,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,682 INFO L138 Inliner]: procedures = 171, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2024-11-09 06:50:23,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:50:23,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:50:23,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:50:23,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:50:23,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:50:23,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:50:23,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:50:23,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:50:23,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (1/1) ... [2024-11-09 06:50:23,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:50:23,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:50:23,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:50:23,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:50:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-09 06:50:23,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-09 06:50:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-09 06:50:23,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-09 06:50:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:50:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:50:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:50:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:50:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:50:23,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:50:23,819 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:50:23,935 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:50:23,936 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:50:24,199 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:50:24,200 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:50:24,237 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:50:24,237 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:50:24,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:24 BoogieIcfgContainer [2024-11-09 06:50:24,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:50:24,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:50:24,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:50:24,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:50:24,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:50:23" (1/3) ... [2024-11-09 06:50:24,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373e5bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:50:24, skipping insertion in model container [2024-11-09 06:50:24,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:23" (2/3) ... [2024-11-09 06:50:24,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373e5bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:50:24, skipping insertion in model container [2024-11-09 06:50:24,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:24" (3/3) ... [2024-11-09 06:50:24,245 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-1.i [2024-11-09 06:50:24,259 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:50:24,259 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-09 06:50:24,259 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:50:24,332 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:50:24,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 138 transitions, 284 flow [2024-11-09 06:50:24,445 INFO L124 PetriNetUnfolderBase]: 8/152 cut-off events. [2024-11-09 06:50:24,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:24,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 152 events. 8/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 99. Up to 4 conditions per place. [2024-11-09 06:50:24,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 138 transitions, 284 flow [2024-11-09 06:50:24,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 281 flow [2024-11-09 06:50:24,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:50:24,477 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;@4865b063, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:50:24,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-09 06:50:24,485 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:50:24,485 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-09 06:50:24,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:24,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:24,486 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] [2024-11-09 06:50:24,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 06:50:24,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:24,495 INFO L85 PathProgramCache]: Analyzing trace with hash 318874204, now seen corresponding path program 1 times [2024-11-09 06:50:24,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:24,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620308301] [2024-11-09 06:50:24,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:24,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620308301] [2024-11-09 06:50:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620308301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:24,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:24,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:24,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509806157] [2024-11-09 06:50:24,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:24,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:24,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:24,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:24,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-11-09 06:50:24,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 137 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:24,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:24,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-11-09 06:50:24,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:24,965 INFO L124 PetriNetUnfolderBase]: 23/314 cut-off events. [2024-11-09 06:50:24,966 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:50:24,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 314 events. 23/314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1248 event pairs, 19 based on Foata normal form. 38/300 useless extension candidates. Maximal degree in co-relation 304. Up to 47 conditions per place. [2024-11-09 06:50:24,971 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 11 selfloop transitions, 2 changer transitions 1/129 dead transitions. [2024-11-09 06:50:24,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 291 flow [2024-11-09 06:50:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-11-09 06:50:24,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2024-11-09 06:50:24,987 INFO L175 Difference]: Start difference. First operand has 136 places, 137 transitions, 281 flow. Second operand 3 states and 373 transitions. [2024-11-09 06:50:24,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 291 flow [2024-11-09 06:50:24,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:24,995 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 266 flow [2024-11-09 06:50:24,997 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=134, PETRI_TRANSITIONS=128} [2024-11-09 06:50:25,003 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-11-09 06:50:25,004 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 266 flow [2024-11-09 06:50:25,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:25,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:25,005 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] [2024-11-09 06:50:25,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:50:25,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 06:50:25,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1708883970, now seen corresponding path program 1 times [2024-11-09 06:50:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:25,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651192763] [2024-11-09 06:50:25,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:25,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:25,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651192763] [2024-11-09 06:50:25,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651192763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:25,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:25,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389810086] [2024-11-09 06:50:25,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:25,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:25,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:25,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:25,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:25,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2024-11-09 06:50:25,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 128 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:25,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:25,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2024-11-09 06:50:25,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:25,239 INFO L124 PetriNetUnfolderBase]: 28/394 cut-off events. [2024-11-09 06:50:25,239 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 06:50:25,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 394 events. 28/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1722 event pairs, 26 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 436. Up to 62 conditions per place. [2024-11-09 06:50:25,244 INFO L140 encePairwiseOnDemand]: 135/138 looper letters, 13 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-11-09 06:50:25,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 127 transitions, 294 flow [2024-11-09 06:50:25,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2024-11-09 06:50:25,251 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8792270531400966 [2024-11-09 06:50:25,251 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 266 flow. Second operand 3 states and 364 transitions. [2024-11-09 06:50:25,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 127 transitions, 294 flow [2024-11-09 06:50:25,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 127 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:25,255 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 264 flow [2024-11-09 06:50:25,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2024-11-09 06:50:25,257 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -4 predicate places. [2024-11-09 06:50:25,257 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 264 flow [2024-11-09 06:50:25,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:25,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:25,258 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] [2024-11-09 06:50:25,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:50:25,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 06:50:25,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash -197903269, now seen corresponding path program 1 times [2024-11-09 06:50:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:25,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769709729] [2024-11-09 06:50:25,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:25,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:25,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769709729] [2024-11-09 06:50:25,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769709729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:25,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:25,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829973115] [2024-11-09 06:50:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:25,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:25,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:25,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:25,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:25,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2024-11-09 06:50:25,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:25,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:25,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2024-11-09 06:50:25,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:25,479 INFO L124 PetriNetUnfolderBase]: 68/518 cut-off events. [2024-11-09 06:50:25,482 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:50:25,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 518 events. 68/518 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2788 event pairs, 58 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 609. Up to 116 conditions per place. [2024-11-09 06:50:25,487 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2024-11-09 06:50:25,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 284 flow [2024-11-09 06:50:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-11-09 06:50:25,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8599033816425121 [2024-11-09 06:50:25,489 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 264 flow. Second operand 3 states and 356 transitions. [2024-11-09 06:50:25,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 284 flow [2024-11-09 06:50:25,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:25,495 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 252 flow [2024-11-09 06:50:25,495 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2024-11-09 06:50:25,496 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -9 predicate places. [2024-11-09 06:50:25,497 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 252 flow [2024-11-09 06:50:25,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:25,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:25,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:25,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:50:25,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 06:50:25,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1810485791, now seen corresponding path program 1 times [2024-11-09 06:50:25,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:25,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126670381] [2024-11-09 06:50:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:25,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126670381] [2024-11-09 06:50:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126670381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:25,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:25,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319357282] [2024-11-09 06:50:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:25,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:25,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:25,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:25,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:25,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 138 [2024-11-09 06:50:25,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:25,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:25,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 138 [2024-11-09 06:50:25,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:25,716 INFO L124 PetriNetUnfolderBase]: 17/278 cut-off events. [2024-11-09 06:50:25,716 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:50:25,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 278 events. 17/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 883 event pairs, 6 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 296. Up to 32 conditions per place. [2024-11-09 06:50:25,719 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 13 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2024-11-09 06:50:25,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 299 flow [2024-11-09 06:50:25,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2024-11-09 06:50:25,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2024-11-09 06:50:25,722 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 252 flow. Second operand 3 states and 379 transitions. [2024-11-09 06:50:25,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 299 flow [2024-11-09 06:50:25,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:25,727 INFO L231 Difference]: Finished difference. Result has 129 places, 124 transitions, 279 flow [2024-11-09 06:50:25,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=129, PETRI_TRANSITIONS=124} [2024-11-09 06:50:25,728 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -7 predicate places. [2024-11-09 06:50:25,729 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 124 transitions, 279 flow [2024-11-09 06:50:25,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:25,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:25,730 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:25,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:50:25,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 06:50:25,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1295306118, now seen corresponding path program 1 times [2024-11-09 06:50:25,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:25,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511919131] [2024-11-09 06:50:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 06:50:25,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:25,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511919131] [2024-11-09 06:50:25,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511919131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:25,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:25,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:25,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294909905] [2024-11-09 06:50:25,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:25,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:50:25,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:25,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:50:25,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:50:25,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2024-11-09 06:50:25,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 124 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:25,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:25,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2024-11-09 06:50:25,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:26,024 INFO L124 PetriNetUnfolderBase]: 12/280 cut-off events. [2024-11-09 06:50:26,025 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 06:50:26,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 280 events. 12/280 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 916 event pairs, 8 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 325. Up to 34 conditions per place. [2024-11-09 06:50:26,026 INFO L140 encePairwiseOnDemand]: 134/138 looper letters, 16 selfloop transitions, 0 changer transitions 4/127 dead transitions. [2024-11-09 06:50:26,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 127 transitions, 325 flow [2024-11-09 06:50:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:50:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:50:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2024-11-09 06:50:26,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8565217391304348 [2024-11-09 06:50:26,029 INFO L175 Difference]: Start difference. First operand has 129 places, 124 transitions, 279 flow. Second operand 5 states and 591 transitions. [2024-11-09 06:50:26,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 127 transitions, 325 flow [2024-11-09 06:50:26,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 127 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:26,032 INFO L231 Difference]: Finished difference. Result has 134 places, 123 transitions, 275 flow [2024-11-09 06:50:26,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=134, PETRI_TRANSITIONS=123} [2024-11-09 06:50:26,033 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-11-09 06:50:26,034 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 275 flow [2024-11-09 06:50:26,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:26,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:26,035 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:26,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:50:26,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-09 06:50:26,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1292053806, now seen corresponding path program 1 times [2024-11-09 06:50:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718768514] [2024-11-09 06:50:26,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:26,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:50:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:26,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:50:26,119 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:50:26,121 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2024-11-09 06:50:26,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2024-11-09 06:50:26,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2024-11-09 06:50:26,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2024-11-09 06:50:26,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2024-11-09 06:50:26,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2024-11-09 06:50:26,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2024-11-09 06:50:26,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2024-11-09 06:50:26,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2024-11-09 06:50:26,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2024-11-09 06:50:26,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2024-11-09 06:50:26,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2024-11-09 06:50:26,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2024-11-09 06:50:26,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2024-11-09 06:50:26,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2024-11-09 06:50:26,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2024-11-09 06:50:26,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2024-11-09 06:50:26,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:50:26,129 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 06:50:26,132 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:50:26,133 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 06:50:26,172 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:50:26,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 194 transitions, 408 flow [2024-11-09 06:50:26,198 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2024-11-09 06:50:26,198 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 06:50:26,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 206 events. 11/206 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 213. Up to 6 conditions per place. [2024-11-09 06:50:26,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 194 transitions, 408 flow [2024-11-09 06:50:26,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 171 transitions, 355 flow [2024-11-09 06:50:26,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:50:26,204 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;@4865b063, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:50:26,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-09 06:50:26,207 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:50:26,207 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-09 06:50:26,207 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:26,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:26,207 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] [2024-11-09 06:50:26,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-09 06:50:26,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1484849122, now seen corresponding path program 1 times [2024-11-09 06:50:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:26,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152821586] [2024-11-09 06:50:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:26,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:26,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:26,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152821586] [2024-11-09 06:50:26,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152821586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:26,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:26,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:26,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434424379] [2024-11-09 06:50:26,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:26,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:26,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:26,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:26,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:26,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2024-11-09 06:50:26,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 171 transitions, 355 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-09 06:50:26,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:26,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2024-11-09 06:50:26,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:26,427 INFO L124 PetriNetUnfolderBase]: 216/1072 cut-off events. [2024-11-09 06:50:26,427 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-09 06:50:26,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1072 events. 216/1072 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7354 event pairs, 189 based on Foata normal form. 226/1128 useless extension candidates. Maximal degree in co-relation 1362. Up to 317 conditions per place. [2024-11-09 06:50:26,439 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 16 selfloop transitions, 2 changer transitions 1/162 dead transitions. [2024-11-09 06:50:26,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 373 flow [2024-11-09 06:50:26,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-11-09 06:50:26,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8831615120274914 [2024-11-09 06:50:26,441 INFO L175 Difference]: Start difference. First operand has 170 places, 171 transitions, 355 flow. Second operand 3 states and 514 transitions. [2024-11-09 06:50:26,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 373 flow [2024-11-09 06:50:26,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:26,445 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 338 flow [2024-11-09 06:50:26,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2024-11-09 06:50:26,447 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -2 predicate places. [2024-11-09 06:50:26,447 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 338 flow [2024-11-09 06:50:26,447 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-09 06:50:26,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:26,448 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] [2024-11-09 06:50:26,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:50:26,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-09 06:50:26,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 754326784, now seen corresponding path program 1 times [2024-11-09 06:50:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953624911] [2024-11-09 06:50:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:26,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953624911] [2024-11-09 06:50:26,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953624911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:26,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:26,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:26,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253968775] [2024-11-09 06:50:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:26,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:26,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:26,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:26,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-11-09 06:50:26,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:26,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:26,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-11-09 06:50:26,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:26,692 INFO L124 PetriNetUnfolderBase]: 205/1268 cut-off events. [2024-11-09 06:50:26,693 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-09 06:50:26,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 1268 events. 205/1268 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9006 event pairs, 194 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 1598. Up to 326 conditions per place. [2024-11-09 06:50:26,706 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 17 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2024-11-09 06:50:26,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 160 transitions, 374 flow [2024-11-09 06:50:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-09 06:50:26,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8694158075601375 [2024-11-09 06:50:26,709 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 338 flow. Second operand 3 states and 506 transitions. [2024-11-09 06:50:26,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 160 transitions, 374 flow [2024-11-09 06:50:26,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:26,713 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 336 flow [2024-11-09 06:50:26,713 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2024-11-09 06:50:26,714 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -4 predicate places. [2024-11-09 06:50:26,715 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 336 flow [2024-11-09 06:50:26,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:26,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:26,715 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] [2024-11-09 06:50:26,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:50:26,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-09 06:50:26,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:26,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1533454557, now seen corresponding path program 1 times [2024-11-09 06:50:26,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:26,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445245434] [2024-11-09 06:50:26,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:26,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:26,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:26,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445245434] [2024-11-09 06:50:26,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445245434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:26,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:26,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:26,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069479625] [2024-11-09 06:50:26,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:26,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:26,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:26,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:26,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 194 [2024-11-09 06:50:26,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:26,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:26,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 194 [2024-11-09 06:50:26,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:27,068 INFO L124 PetriNetUnfolderBase]: 590/2395 cut-off events. [2024-11-09 06:50:27,069 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-09 06:50:27,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 2395 events. 590/2395 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 19525 event pairs, 508 based on Foata normal form. 0/2106 useless extension candidates. Maximal degree in co-relation 3206. Up to 791 conditions per place. [2024-11-09 06:50:27,096 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 19 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2024-11-09 06:50:27,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 364 flow [2024-11-09 06:50:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2024-11-09 06:50:27,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384879725085911 [2024-11-09 06:50:27,099 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 336 flow. Second operand 3 states and 488 transitions. [2024-11-09 06:50:27,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 364 flow [2024-11-09 06:50:27,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 154 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:27,103 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 322 flow [2024-11-09 06:50:27,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2024-11-09 06:50:27,105 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -10 predicate places. [2024-11-09 06:50:27,105 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 322 flow [2024-11-09 06:50:27,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:27,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:27,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:27,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:50:27,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-09 06:50:27,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:27,107 INFO L85 PathProgramCache]: Analyzing trace with hash 874493411, now seen corresponding path program 1 times [2024-11-09 06:50:27,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:27,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314762478] [2024-11-09 06:50:27,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:27,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314762478] [2024-11-09 06:50:27,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314762478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:27,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:27,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483721445] [2024-11-09 06:50:27,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:27,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:27,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 194 [2024-11-09 06:50:27,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:27,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:27,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 194 [2024-11-09 06:50:27,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:27,377 INFO L124 PetriNetUnfolderBase]: 347/1375 cut-off events. [2024-11-09 06:50:27,378 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-09 06:50:27,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1375 events. 347/1375 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9674 event pairs, 117 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 2016. Up to 382 conditions per place. [2024-11-09 06:50:27,392 INFO L140 encePairwiseOnDemand]: 183/194 looper letters, 25 selfloop transitions, 8 changer transitions 0/168 dead transitions. [2024-11-09 06:50:27,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 424 flow [2024-11-09 06:50:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2024-11-09 06:50:27,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8917525773195877 [2024-11-09 06:50:27,394 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 322 flow. Second operand 3 states and 519 transitions. [2024-11-09 06:50:27,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 424 flow [2024-11-09 06:50:27,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 168 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:27,397 INFO L231 Difference]: Finished difference. Result has 163 places, 162 transitions, 391 flow [2024-11-09 06:50:27,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=163, PETRI_TRANSITIONS=162} [2024-11-09 06:50:27,399 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -7 predicate places. [2024-11-09 06:50:27,399 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 391 flow [2024-11-09 06:50:27,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:27,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:27,399 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:27,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:50:27,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-09 06:50:27,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:27,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1452864569, now seen corresponding path program 1 times [2024-11-09 06:50:27,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:27,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181443407] [2024-11-09 06:50:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:27,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:27,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:27,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181443407] [2024-11-09 06:50:27,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181443407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:27,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:27,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:27,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716131601] [2024-11-09 06:50:27,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:27,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:27,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:27,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:27,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:27,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2024-11-09 06:50:27,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:27,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:27,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2024-11-09 06:50:27,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:27,793 INFO L124 PetriNetUnfolderBase]: 447/1925 cut-off events. [2024-11-09 06:50:27,793 INFO L125 PetriNetUnfolderBase]: For 612/632 co-relation queries the response was YES. [2024-11-09 06:50:27,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 1925 events. 447/1925 cut-off events. For 612/632 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15444 event pairs, 158 based on Foata normal form. 2/1715 useless extension candidates. Maximal degree in co-relation 3321. Up to 585 conditions per place. [2024-11-09 06:50:27,816 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 23 selfloop transitions, 10 changer transitions 0/173 dead transitions. [2024-11-09 06:50:27,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 173 transitions, 502 flow [2024-11-09 06:50:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2024-11-09 06:50:27,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8951890034364262 [2024-11-09 06:50:27,819 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 391 flow. Second operand 3 states and 521 transitions. [2024-11-09 06:50:27,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 173 transitions, 502 flow [2024-11-09 06:50:27,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 173 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:27,824 INFO L231 Difference]: Finished difference. Result has 165 places, 170 transitions, 461 flow [2024-11-09 06:50:27,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=165, PETRI_TRANSITIONS=170} [2024-11-09 06:50:27,825 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -5 predicate places. [2024-11-09 06:50:27,825 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 170 transitions, 461 flow [2024-11-09 06:50:27,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:27,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:27,826 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:27,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:50:27,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-09 06:50:27,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash 930759383, now seen corresponding path program 1 times [2024-11-09 06:50:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239206164] [2024-11-09 06:50:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 06:50:27,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:27,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239206164] [2024-11-09 06:50:27,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239206164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:27,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:27,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:27,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824384900] [2024-11-09 06:50:27,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:27,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:50:27,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:27,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:50:27,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:50:27,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-11-09 06:50:27,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 170 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:27,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:27,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-11-09 06:50:27,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:28,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([535] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread2of2ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of2ForFork1_#t~ret6#1=|v_thr2Thread2of2ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of2ForFork1_#t~ret6#1][153], [Black: 205#true, Black: 212#(= |#race~x~0| |thr2Thread1of2ForFork1_#t~nondet5#1|), 190#true, 210#true, 21#L705-2true, 192#true, 168#L705-2true, 36#$Ultimate##0true, 43#L714-4true, 215#true, 204#(= |#race~n~0| 0), 188#true]) [2024-11-09 06:50:28,164 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-09 06:50:28,164 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-09 06:50:28,164 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-09 06:50:28,164 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-09 06:50:28,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([568] L702-4-->L705-2: Formula: (and (= |v_thr2Thread1of2ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of2ForFork1_#t~ret6#1=|v_thr2Thread1of2ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of2ForFork1_#t~ret6#1][125], [Black: 205#true, 60#L-1-4true, Black: 212#(= |#race~x~0| |thr2Thread1of2ForFork1_#t~nondet5#1|), 190#true, 210#true, 21#L705-2true, 192#true, 168#L705-2true, 36#$Ultimate##0true, 215#true, 204#(= |#race~n~0| 0), 188#true]) [2024-11-09 06:50:28,303 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-09 06:50:28,303 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:50:28,303 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:50:28,303 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-09 06:50:28,337 INFO L124 PetriNetUnfolderBase]: 540/2956 cut-off events. [2024-11-09 06:50:28,338 INFO L125 PetriNetUnfolderBase]: For 548/791 co-relation queries the response was YES. [2024-11-09 06:50:28,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 2956 events. 540/2956 cut-off events. For 548/791 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 27757 event pairs, 215 based on Foata normal form. 1/2597 useless extension candidates. Maximal degree in co-relation 4700. Up to 443 conditions per place. [2024-11-09 06:50:28,367 INFO L140 encePairwiseOnDemand]: 190/194 looper letters, 19 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2024-11-09 06:50:28,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 173 transitions, 513 flow [2024-11-09 06:50:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:50:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:50:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2024-11-09 06:50:28,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8597938144329897 [2024-11-09 06:50:28,371 INFO L175 Difference]: Start difference. First operand has 165 places, 170 transitions, 461 flow. Second operand 5 states and 834 transitions. [2024-11-09 06:50:28,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 173 transitions, 513 flow [2024-11-09 06:50:28,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 173 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:28,378 INFO L231 Difference]: Finished difference. Result has 170 places, 169 transitions, 445 flow [2024-11-09 06:50:28,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=170, PETRI_TRANSITIONS=169} [2024-11-09 06:50:28,379 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, 0 predicate places. [2024-11-09 06:50:28,379 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 169 transitions, 445 flow [2024-11-09 06:50:28,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:28,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:28,380 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:28,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:50:28,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-09 06:50:28,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1137224819, now seen corresponding path program 1 times [2024-11-09 06:50:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:28,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59786117] [2024-11-09 06:50:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:28,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:28,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:50:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:28,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:50:28,423 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:50:28,423 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2024-11-09 06:50:28,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2024-11-09 06:50:28,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2024-11-09 06:50:28,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2024-11-09 06:50:28,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2024-11-09 06:50:28,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2024-11-09 06:50:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2024-11-09 06:50:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2024-11-09 06:50:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2024-11-09 06:50:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2024-11-09 06:50:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2024-11-09 06:50:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2024-11-09 06:50:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2024-11-09 06:50:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2024-11-09 06:50:28,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2024-11-09 06:50:28,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2024-11-09 06:50:28,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2024-11-09 06:50:28,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2024-11-09 06:50:28,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2024-11-09 06:50:28,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2024-11-09 06:50:28,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2024-11-09 06:50:28,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2024-11-09 06:50:28,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:50:28,427 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:28,428 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:50:28,428 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 06:50:28,470 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:50:28,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 250 transitions, 536 flow [2024-11-09 06:50:28,501 INFO L124 PetriNetUnfolderBase]: 14/260 cut-off events. [2024-11-09 06:50:28,501 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 06:50:28,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 260 events. 14/260 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 533 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 271. Up to 8 conditions per place. [2024-11-09 06:50:28,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 250 transitions, 536 flow [2024-11-09 06:50:28,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 205 transitions, 431 flow [2024-11-09 06:50:28,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:50:28,507 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;@4865b063, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:50:28,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-11-09 06:50:28,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:50:28,509 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-09 06:50:28,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:28,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:28,509 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] [2024-11-09 06:50:28,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:50:28,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1636960792, now seen corresponding path program 1 times [2024-11-09 06:50:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:28,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154996952] [2024-11-09 06:50:28,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:28,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:28,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:28,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154996952] [2024-11-09 06:50:28,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154996952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:28,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:28,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:28,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752934406] [2024-11-09 06:50:28,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:28,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:28,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:28,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:28,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:28,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2024-11-09 06:50:28,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 205 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:28,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:28,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2024-11-09 06:50:28,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:29,360 INFO L124 PetriNetUnfolderBase]: 1589/4910 cut-off events. [2024-11-09 06:50:29,360 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2024-11-09 06:50:29,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7220 conditions, 4910 events. 1589/4910 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 44703 event pairs, 1439 based on Foata normal form. 1274/5496 useless extension candidates. Maximal degree in co-relation 7150. Up to 2067 conditions per place. [2024-11-09 06:50:29,420 INFO L140 encePairwiseOnDemand]: 240/250 looper letters, 21 selfloop transitions, 2 changer transitions 1/195 dead transitions. [2024-11-09 06:50:29,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 195 transitions, 457 flow [2024-11-09 06:50:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2024-11-09 06:50:29,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8733333333333333 [2024-11-09 06:50:29,423 INFO L175 Difference]: Start difference. First operand has 204 places, 205 transitions, 431 flow. Second operand 3 states and 655 transitions. [2024-11-09 06:50:29,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 195 transitions, 457 flow [2024-11-09 06:50:29,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 195 transitions, 454 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:29,428 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 410 flow [2024-11-09 06:50:29,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=202, PETRI_TRANSITIONS=194} [2024-11-09 06:50:29,428 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -2 predicate places. [2024-11-09 06:50:29,429 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 410 flow [2024-11-09 06:50:29,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:29,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:29,430 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] [2024-11-09 06:50:29,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:50:29,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:50:29,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1183330618, now seen corresponding path program 1 times [2024-11-09 06:50:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612090833] [2024-11-09 06:50:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:29,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:29,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:29,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612090833] [2024-11-09 06:50:29,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612090833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:29,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:29,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561904393] [2024-11-09 06:50:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:29,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:29,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:29,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:29,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2024-11-09 06:50:29,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 194 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:29,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:29,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2024-11-09 06:50:29,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:30,338 INFO L124 PetriNetUnfolderBase]: 1197/5332 cut-off events. [2024-11-09 06:50:30,339 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2024-11-09 06:50:30,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7137 conditions, 5332 events. 1197/5332 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 52785 event pairs, 1154 based on Foata normal form. 0/4734 useless extension candidates. Maximal degree in co-relation 7102. Up to 1670 conditions per place. [2024-11-09 06:50:30,395 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 21 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2024-11-09 06:50:30,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 193 transitions, 454 flow [2024-11-09 06:50:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2024-11-09 06:50:30,401 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.864 [2024-11-09 06:50:30,401 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 410 flow. Second operand 3 states and 648 transitions. [2024-11-09 06:50:30,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 193 transitions, 454 flow [2024-11-09 06:50:30,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 193 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:30,406 INFO L231 Difference]: Finished difference. Result has 200 places, 193 transitions, 408 flow [2024-11-09 06:50:30,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=200, PETRI_TRANSITIONS=193} [2024-11-09 06:50:30,407 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -4 predicate places. [2024-11-09 06:50:30,408 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 193 transitions, 408 flow [2024-11-09 06:50:30,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:30,408 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:30,408 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] [2024-11-09 06:50:30,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:50:30,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:50:30,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2037743255, now seen corresponding path program 1 times [2024-11-09 06:50:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:30,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447246554] [2024-11-09 06:50:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:30,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:30,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447246554] [2024-11-09 06:50:30,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447246554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:30,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:30,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825502368] [2024-11-09 06:50:30,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:30,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:30,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:30,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:30,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:30,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 250 [2024-11-09 06:50:30,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 193 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:30,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:30,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 250 [2024-11-09 06:50:30,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:32,104 INFO L124 PetriNetUnfolderBase]: 4181/12619 cut-off events. [2024-11-09 06:50:32,105 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2024-11-09 06:50:32,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17972 conditions, 12619 events. 4181/12619 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 133571 event pairs, 3658 based on Foata normal form. 0/10992 useless extension candidates. Maximal degree in co-relation 17930. Up to 5066 conditions per place. [2024-11-09 06:50:32,219 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 24 selfloop transitions, 1 changer transitions 0/186 dead transitions. [2024-11-09 06:50:32,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 444 flow [2024-11-09 06:50:32,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2024-11-09 06:50:32,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2024-11-09 06:50:32,221 INFO L175 Difference]: Start difference. First operand has 200 places, 193 transitions, 408 flow. Second operand 3 states and 620 transitions. [2024-11-09 06:50:32,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 444 flow [2024-11-09 06:50:32,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 186 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:32,226 INFO L231 Difference]: Finished difference. Result has 193 places, 186 transitions, 392 flow [2024-11-09 06:50:32,226 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=193, PETRI_TRANSITIONS=186} [2024-11-09 06:50:32,227 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -11 predicate places. [2024-11-09 06:50:32,227 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 186 transitions, 392 flow [2024-11-09 06:50:32,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:32,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:32,228 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:32,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:50:32,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:50:32,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash 127606184, now seen corresponding path program 1 times [2024-11-09 06:50:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459569739] [2024-11-09 06:50:32,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:32,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:32,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459569739] [2024-11-09 06:50:32,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459569739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:32,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:32,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745905399] [2024-11-09 06:50:32,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:32,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:32,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:32,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:32,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 250 [2024-11-09 06:50:32,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 186 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:32,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:32,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 250 [2024-11-09 06:50:32,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:33,956 INFO L124 PetriNetUnfolderBase]: 4747/12923 cut-off events. [2024-11-09 06:50:33,956 INFO L125 PetriNetUnfolderBase]: For 840/840 co-relation queries the response was YES. [2024-11-09 06:50:33,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20480 conditions, 12923 events. 4747/12923 cut-off events. For 840/840 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 135251 event pairs, 1658 based on Foata normal form. 0/11283 useless extension candidates. Maximal degree in co-relation 20438. Up to 4100 conditions per place. [2024-11-09 06:50:34,070 INFO L140 encePairwiseOnDemand]: 235/250 looper letters, 35 selfloop transitions, 11 changer transitions 0/206 dead transitions. [2024-11-09 06:50:34,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 206 transitions, 537 flow [2024-11-09 06:50:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2024-11-09 06:50:34,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8746666666666667 [2024-11-09 06:50:34,074 INFO L175 Difference]: Start difference. First operand has 193 places, 186 transitions, 392 flow. Second operand 3 states and 656 transitions. [2024-11-09 06:50:34,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 206 transitions, 537 flow [2024-11-09 06:50:34,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 206 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:34,080 INFO L231 Difference]: Finished difference. Result has 196 places, 197 transitions, 487 flow [2024-11-09 06:50:34,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=196, PETRI_TRANSITIONS=197} [2024-11-09 06:50:34,081 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -8 predicate places. [2024-11-09 06:50:34,081 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 197 transitions, 487 flow [2024-11-09 06:50:34,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:34,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:34,082 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:34,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:50:34,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:50:34,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:34,083 INFO L85 PathProgramCache]: Analyzing trace with hash 719291507, now seen corresponding path program 1 times [2024-11-09 06:50:34,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:34,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858291845] [2024-11-09 06:50:34,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:34,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:34,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858291845] [2024-11-09 06:50:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858291845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:34,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450263577] [2024-11-09 06:50:34,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:34,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:34,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:34,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:34,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:34,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2024-11-09 06:50:34,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 197 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:34,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:34,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2024-11-09 06:50:34,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:35,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][122], [113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 132#L700-3true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 244#true, 242#true]) [2024-11-09 06:50:35,383 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-11-09 06:50:35,383 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-09 06:50:35,383 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-09 06:50:35,383 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-09 06:50:35,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [113#L705-2true, 132#L700-3true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 180#L694-2true, 244#true, 242#true]) [2024-11-09 06:50:35,399 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-09 06:50:35,399 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:35,399 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:50:35,399 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:50:35,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][212], [24#L694-1true, 132#L700-3true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 192#L703-4true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true]) [2024-11-09 06:50:35,768 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-09 06:50:35,768 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-09 06:50:35,768 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-09 06:50:35,768 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-09 06:50:36,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [130#L705-2true, 113#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 180#L694-2true, 244#true, 242#true]) [2024-11-09 06:50:36,169 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-09 06:50:36,169 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-09 06:50:36,169 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-09 06:50:36,169 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-09 06:50:36,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][202], [130#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 192#L703-4true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 180#L694-2true, 244#true, 242#true]) [2024-11-09 06:50:36,414 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-11-09 06:50:36,414 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-09 06:50:36,415 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-09 06:50:36,415 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-09 06:50:36,461 INFO L124 PetriNetUnfolderBase]: 6575/18065 cut-off events. [2024-11-09 06:50:36,461 INFO L125 PetriNetUnfolderBase]: For 7625/8178 co-relation queries the response was YES. [2024-11-09 06:50:36,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35123 conditions, 18065 events. 6575/18065 cut-off events. For 7625/8178 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 202860 event pairs, 2466 based on Foata normal form. 44/15760 useless extension candidates. Maximal degree in co-relation 35080. Up to 7191 conditions per place. [2024-11-09 06:50:36,646 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 33 selfloop transitions, 14 changer transitions 0/215 dead transitions. [2024-11-09 06:50:36,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 215 transitions, 657 flow [2024-11-09 06:50:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2024-11-09 06:50:36,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.888 [2024-11-09 06:50:36,649 INFO L175 Difference]: Start difference. First operand has 196 places, 197 transitions, 487 flow. Second operand 3 states and 666 transitions. [2024-11-09 06:50:36,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 215 transitions, 657 flow [2024-11-09 06:50:36,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 215 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:36,671 INFO L231 Difference]: Finished difference. Result has 198 places, 209 transitions, 591 flow [2024-11-09 06:50:36,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=198, PETRI_TRANSITIONS=209} [2024-11-09 06:50:36,673 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -6 predicate places. [2024-11-09 06:50:36,674 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 209 transitions, 591 flow [2024-11-09 06:50:36,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:36,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:36,675 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:36,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:50:36,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:50:36,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:36,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1139370770, now seen corresponding path program 1 times [2024-11-09 06:50:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:36,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825026029] [2024-11-09 06:50:36,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:36,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825026029] [2024-11-09 06:50:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825026029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:36,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:36,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:36,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789584019] [2024-11-09 06:50:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:36,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:50:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:36,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:50:36,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:50:36,793 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2024-11-09 06:50:36,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 209 transitions, 591 flow. Second operand has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:36,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:36,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2024-11-09 06:50:36,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:37,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 113#L705-2true, 170#$Ultimate##0true, 26#L714-4true, 240#true, 243#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 242#true]) [2024-11-09 06:50:37,195 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-09 06:50:37,195 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-09 06:50:37,196 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-09 06:50:37,196 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-09 06:50:37,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 67#$Ultimate##0true, 244#true, 242#true]) [2024-11-09 06:50:37,468 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-09 06:50:37,468 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:50:37,468 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:50:37,468 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-09 06:50:37,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 170#$Ultimate##0true, 240#true, 243#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 242#true]) [2024-11-09 06:50:37,492 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-09 06:50:37,492 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-09 06:50:37,493 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:50:37,493 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:50:37,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 17#$Ultimate##0true, 271#true, 244#true, 242#true]) [2024-11-09 06:50:37,494 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-09 06:50:37,494 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:50:37,494 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:50:37,494 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-09 06:50:38,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [113#L705-2true, 132#L700-3true, 26#L714-4true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-11-09 06:50:38,043 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,043 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,043 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,043 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:50:38,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 170#$Ultimate##0true, 240#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 17#$Ultimate##0true, 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-11-09 06:50:38,180 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,180 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,180 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:50:38,180 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 67#$Ultimate##0true, 244#true, 242#true]) [2024-11-09 06:50:38,184 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,184 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,184 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:50:38,184 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 198#L700-3true]) [2024-11-09 06:50:38,188 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,189 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:50:38,189 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,189 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 24#L694-1true, 26#L714-4true, 132#L700-3true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-11-09 06:50:38,284 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-09 06:50:38,284 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-09 06:50:38,441 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-09 06:50:38,442 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-09 06:50:38,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 26#L714-4true, 132#L700-3true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 180#L694-2true, 244#true, 242#true]) [2024-11-09 06:50:38,510 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-11-09 06:50:38,510 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-09 06:50:38,510 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-09 06:50:38,511 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-09 06:50:38,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][199], [26#L714-4true, 240#true, 70#L705-2true, 192#L703-4true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 180#L694-2true, 244#true, 242#true, 207#L701-1true]) [2024-11-09 06:50:38,677 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-09 06:50:38,677 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-09 06:50:38,677 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-09 06:50:38,677 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-09 06:50:38,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [113#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 141#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true, 207#L701-1true]) [2024-11-09 06:50:38,744 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-11-09 06:50:38,744 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-09 06:50:38,744 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-09 06:50:38,745 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-09 06:50:38,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 240#true, Black: 263#(= |#race~x~0| 0), 70#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 67#$Ultimate##0true, 244#true, 242#true]) [2024-11-09 06:50:38,776 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-11-09 06:50:38,776 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-09 06:50:38,776 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,776 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-09 06:50:38,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [113#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 208#L701-2true, 271#true, 141#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true]) [2024-11-09 06:50:38,836 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-11-09 06:50:38,836 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-09 06:50:38,836 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-09 06:50:38,836 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-09 06:50:38,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [130#L705-2true, 113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-11-09 06:50:38,866 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-09 06:50:38,866 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-09 06:50:38,866 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-09 06:50:38,866 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-09 06:50:38,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 24#L694-1true, 26#L714-4true, 132#L700-3true, 240#true, 70#L705-2true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-11-09 06:50:38,909 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-11-09 06:50:38,909 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-09 06:50:38,910 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-09 06:50:38,910 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-09 06:50:38,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 26#L714-4true, 132#L700-3true, 240#true, 70#L705-2true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 180#L694-2true, 244#true, 242#true]) [2024-11-09 06:50:38,962 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-09 06:50:38,962 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-09 06:50:38,963 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-09 06:50:38,963 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-09 06:50:39,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-11-09 06:50:39,013 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-09 06:50:39,013 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-09 06:50:39,013 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-09 06:50:39,013 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-09 06:50:39,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [130#L705-2true, 113#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 141#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true]) [2024-11-09 06:50:39,064 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-11-09 06:50:39,064 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-09 06:50:39,064 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-09 06:50:39,064 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-09 06:50:39,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 141#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true]) [2024-11-09 06:50:39,234 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-11-09 06:50:39,235 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-09 06:50:39,235 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-09 06:50:39,235 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-09 06:50:39,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 170#$Ultimate##0true, 240#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true, 198#L700-3true]) [2024-11-09 06:50:39,311 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-09 06:50:39,311 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-09 06:50:39,311 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-09 06:50:39,311 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-09 06:50:39,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 132#L700-3true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-11-09 06:50:39,312 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-09 06:50:39,312 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-09 06:50:39,312 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-09 06:50:39,312 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-09 06:50:39,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, Black: 263#(= |#race~x~0| 0), 70#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-11-09 06:50:39,594 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-09 06:50:39,595 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-09 06:50:39,595 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-09 06:50:39,595 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-09 06:50:39,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true, 207#L701-1true]) [2024-11-09 06:50:39,631 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2024-11-09 06:50:39,631 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-09 06:50:39,631 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-09 06:50:39,631 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-09 06:50:39,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 24#L694-1true, 26#L714-4true, 240#true, Black: 263#(= |#race~x~0| 0), 70#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-11-09 06:50:39,673 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,673 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-09 06:50:39,673 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-09 06:50:39,674 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 208#L701-2true, 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-11-09 06:50:39,677 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,677 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,677 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-09 06:50:39,677 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 240#true, Black: 263#(= |#race~x~0| 0), 70#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 180#L694-2true, 244#true, 242#true]) [2024-11-09 06:50:39,700 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-09 06:50:39,700 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-09 06:50:39,700 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-09 06:50:39,700 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-09 06:50:39,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][208], [130#L705-2true, 240#true, Black: 261#true, 192#L703-4true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 237#L701-1true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 180#L694-2true, 244#true, 242#true]) [2024-11-09 06:50:39,727 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-11-09 06:50:39,727 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,727 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,727 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-09 06:50:39,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 113#L705-2true, 24#L694-1true, 240#true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true, 198#L700-3true]) [2024-11-09 06:50:39,747 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-11-09 06:50:39,747 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-09 06:50:39,747 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-09 06:50:39,747 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-09 06:50:39,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 132#L700-3true, 240#true, Black: 263#(= |#race~x~0| 0), 70#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-11-09 06:50:39,770 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-09 06:50:39,770 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-09 06:50:39,770 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-09 06:50:39,770 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-09 06:50:39,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 113#L705-2true, 240#true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 180#L694-2true, 244#true, 242#true, 198#L700-3true]) [2024-11-09 06:50:39,779 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-11-09 06:50:39,779 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,780 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,780 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,805 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][178], [130#L705-2true, 240#true, Black: 261#true, 266#true, 246#true, 52#L702-4true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 237#L701-1true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 180#L694-2true, 244#true, 242#true]) [2024-11-09 06:50:39,805 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-09 06:50:39,805 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-09 06:50:39,805 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-09 06:50:39,805 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-09 06:50:39,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 24#L694-1true, 132#L700-3true, 240#true, 70#L705-2true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-11-09 06:50:39,826 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-11-09 06:50:39,826 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-11-09 06:50:39,826 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-09 06:50:39,826 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-09 06:50:39,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 132#L700-3true, 240#true, 70#L705-2true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 180#L694-2true, 244#true, 242#true]) [2024-11-09 06:50:39,846 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-11-09 06:50:39,846 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,846 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-09 06:50:39,846 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-09 06:50:39,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 128#L703-3true, 244#true, 242#true]) [2024-11-09 06:50:39,862 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-09 06:50:39,862 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-09 06:50:39,862 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-09 06:50:39,862 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-09 06:50:39,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 170#$Ultimate##0true, 240#true, Black: 261#true, 100#L703-3true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-11-09 06:50:39,864 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-09 06:50:39,864 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-09 06:50:39,864 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-09 06:50:39,864 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-09 06:50:39,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 24#L694-1true, 240#true, 70#L705-2true, Black: 261#true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 128#L703-3true]) [2024-11-09 06:50:39,897 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2024-11-09 06:50:39,897 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-11-09 06:50:39,897 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-11-09 06:50:39,897 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2024-11-09 06:50:39,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 240#true, 70#L705-2true, Black: 261#true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 180#L694-2true, 244#true, 242#true, 128#L703-3true]) [2024-11-09 06:50:39,910 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-11-09 06:50:39,910 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-09 06:50:39,910 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-09 06:50:39,910 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-09 06:50:39,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 240#true, 70#L705-2true, Black: 261#true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 141#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true, 128#L703-3true]) [2024-11-09 06:50:39,915 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-11-09 06:50:39,915 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-09 06:50:39,915 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-09 06:50:39,915 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-09 06:50:39,963 INFO L124 PetriNetUnfolderBase]: 7489/26528 cut-off events. [2024-11-09 06:50:39,963 INFO L125 PetriNetUnfolderBase]: For 6257/10949 co-relation queries the response was YES. [2024-11-09 06:50:40,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45827 conditions, 26528 events. 7489/26528 cut-off events. For 6257/10949 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 346271 event pairs, 2957 based on Foata normal form. 10/22488 useless extension candidates. Maximal degree in co-relation 45783. Up to 4917 conditions per place. [2024-11-09 06:50:40,181 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 22 selfloop transitions, 0 changer transitions 4/212 dead transitions. [2024-11-09 06:50:40,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 212 transitions, 649 flow [2024-11-09 06:50:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:50:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:50:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1077 transitions. [2024-11-09 06:50:40,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8616 [2024-11-09 06:50:40,184 INFO L175 Difference]: Start difference. First operand has 198 places, 209 transitions, 591 flow. Second operand 5 states and 1077 transitions. [2024-11-09 06:50:40,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 212 transitions, 649 flow [2024-11-09 06:50:40,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 212 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:40,240 INFO L231 Difference]: Finished difference. Result has 203 places, 208 transitions, 567 flow [2024-11-09 06:50:40,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=203, PETRI_TRANSITIONS=208} [2024-11-09 06:50:40,241 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -1 predicate places. [2024-11-09 06:50:40,241 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 208 transitions, 567 flow [2024-11-09 06:50:40,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:40,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:40,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:40,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:50:40,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:50:40,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1285094176, now seen corresponding path program 1 times [2024-11-09 06:50:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:40,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108794497] [2024-11-09 06:50:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:40,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:50:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:40,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:50:40,277 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:50:40,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2024-11-09 06:50:40,277 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2024-11-09 06:50:40,277 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2024-11-09 06:50:40,277 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2024-11-09 06:50:40,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2024-11-09 06:50:40,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2024-11-09 06:50:40,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2024-11-09 06:50:40,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2024-11-09 06:50:40,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2024-11-09 06:50:40,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2024-11-09 06:50:40,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2024-11-09 06:50:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 27 remaining) [2024-11-09 06:50:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 27 remaining) [2024-11-09 06:50:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2024-11-09 06:50:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2024-11-09 06:50:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2024-11-09 06:50:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2024-11-09 06:50:40,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2024-11-09 06:50:40,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2024-11-09 06:50:40,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2024-11-09 06:50:40,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2024-11-09 06:50:40,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2024-11-09 06:50:40,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2024-11-09 06:50:40,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2024-11-09 06:50:40,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2024-11-09 06:50:40,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2024-11-09 06:50:40,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2024-11-09 06:50:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:50:40,281 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:40,405 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2024-11-09 06:50:40,405 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:50:40,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:50:40 BasicIcfg [2024-11-09 06:50:40,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:50:40,414 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:50:40,414 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:50:40,415 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:50:40,415 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:24" (3/4) ... [2024-11-09 06:50:40,416 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 06:50:40,697 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:50:40,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:50:40,700 INFO L158 Benchmark]: Toolchain (without parser) took 17599.92ms. Allocated memory was 138.4MB in the beginning and 9.5GB in the end (delta: 9.4GB). Free memory was 65.1MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-09 06:50:40,700 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 138.4MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:50:40,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.24ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 64.7MB in the beginning and 163.8MB in the end (delta: -99.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:40,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.31ms. Allocated memory is still 197.1MB. Free memory was 163.8MB in the beginning and 161.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:40,701 INFO L158 Benchmark]: Boogie Preprocessor took 37.24ms. Allocated memory is still 197.1MB. Free memory was 161.7MB in the beginning and 159.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:40,701 INFO L158 Benchmark]: RCFGBuilder took 516.65ms. Allocated memory is still 197.1MB. Free memory was 159.6MB in the beginning and 141.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 06:50:40,702 INFO L158 Benchmark]: TraceAbstraction took 16173.51ms. Allocated memory was 197.1MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 140.8MB in the beginning and 8.4GB in the end (delta: -8.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-09 06:50:40,702 INFO L158 Benchmark]: Witness Printer took 286.22ms. Allocated memory is still 9.5GB. Free memory was 8.4GB in the beginning and 8.7GB in the end (delta: -338.7MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:40,703 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.25ms. Allocated memory is still 138.4MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.24ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 64.7MB in the beginning and 163.8MB in the end (delta: -99.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.31ms. Allocated memory is still 197.1MB. Free memory was 163.8MB in the beginning and 161.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.24ms. Allocated memory is still 197.1MB. Free memory was 161.7MB in the beginning and 159.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.65ms. Allocated memory is still 197.1MB. Free memory was 159.6MB in the beginning and 141.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16173.51ms. Allocated memory was 197.1MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 140.8MB in the beginning and 8.4GB in the end (delta: -8.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 286.22ms. Allocated memory is still 9.5GB. Free memory was 8.4GB in the beginning and 8.7GB in the end (delta: -338.7MB). Peak memory consumption was 88.1MB. 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: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L692] 0 pthread_mutex_t mut = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mut={3:0}, n=0, x=0] [L708] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=0, x=0] [L709] 0 x = 0 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=0, x=0] [L710] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, x=0] [L711] EXPR 0 n >= (10/2) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, x=0] [L711] EXPR 0 n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, x=0] [L711] CALL 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=5, x=0] [L711] RET 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, t1=-1, x=0] [L713] 0 int i = 0; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=5, t1=-1, x=0] [L713] 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=5, t1=-1, x=0] [L713] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=5, t1=-1, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=5, t1=-1, t2=0, x=0] [L697] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=5, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [\old(arg)={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, x=0] [L699] CALL 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L687] COND FALSE 2 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=5, x=0] [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L694] 1 x < n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=5, x=0] [L701] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x=0] [L702] 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x=0] [L702] COND TRUE 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x=0] [L703] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x=1] [L694] 1 x < n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=5, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [703] and C: x < n [694] - 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: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: 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: 711]: 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: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: 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: 712]: 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, 185 locations, 17 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: 1.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 45 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=0, InterpolantAutomatonStates: 17, 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.4s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 7/7 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 237 locations, 22 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.3s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 36 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=5, InterpolantAutomatonStates: 20, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 26/26 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 9 procedures, 289 locations, 27 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: 11.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 392 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 22 mSDtfsCounter, 392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=5, InterpolantAutomatonStates: 20, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-09 06:50:40,742 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