./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9c9074e122b1777f395c954ed30ab626f529c102cb2614b7e83435b6d498a843 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:39:07,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:39:07,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:39:07,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:39:07,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:39:07,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:39:07,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:39:07,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:39:07,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:39:07,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:39:07,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:39:07,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:39:07,314 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:39:07,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:39:07,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:39:07,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:39:07,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:39:07,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:39:07,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:39:07,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:39:07,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:39:07,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:39:07,316 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:39:07,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:39:07,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:39:07,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:39:07,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:39:07,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:39:07,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:39:07,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:07,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:07,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:07,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:39:07,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:07,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:07,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:39:07,318 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 9c9074e122b1777f395c954ed30ab626f529c102cb2614b7e83435b6d498a843 [2025-01-09 21:39:07,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:39:07,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:39:07,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:39:07,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:39:07,620 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:39:07,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i [2025-01-09 21:39:08,992 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/373dd4da7/33d0244ce0584582aa7ce6242790cbcb/FLAG3fea8b3bc [2025-01-09 21:39:09,317 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:39:09,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i [2025-01-09 21:39:09,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/373dd4da7/33d0244ce0584582aa7ce6242790cbcb/FLAG3fea8b3bc [2025-01-09 21:39:09,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/373dd4da7/33d0244ce0584582aa7ce6242790cbcb [2025-01-09 21:39:09,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:39:09,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:39:09,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:09,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:39:09,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:39:09,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60592373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09, skipping insertion in model container [2025-01-09 21:39:09,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:39:09,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:09,709 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:39:09,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:09,781 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:39:09,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09 WrapperNode [2025-01-09 21:39:09,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:09,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:09,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:39:09,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:39:09,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,817 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 179 [2025-01-09 21:39:09,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:09,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:39:09,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:39:09,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:39:09,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:39:09,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:39:09,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:39:09,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:39:09,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (1/1) ... [2025-01-09 21:39:09,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:09,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:39:09,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:39:09,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:39:09,917 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:39:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:39:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:39:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:39:09,918 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:39:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:39:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:39:09,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:39:09,919 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:39:10,080 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:39:10,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:39:10,428 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:39:10,428 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:39:10,486 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:39:10,488 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:39:10,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:10 BoogieIcfgContainer [2025-01-09 21:39:10,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:39:10,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:39:10,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:39:10,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:39:10,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:09" (1/3) ... [2025-01-09 21:39:10,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e4c54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:10, skipping insertion in model container [2025-01-09 21:39:10,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:09" (2/3) ... [2025-01-09 21:39:10,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e4c54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:10, skipping insertion in model container [2025-01-09 21:39:10,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:10" (3/3) ... [2025-01-09 21:39:10,500 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-inner-race-5.i [2025-01-09 21:39:10,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:39:10,520 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-inner-race-5.i that has 2 procedures, 230 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-01-09 21:39:10,520 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:39:10,599 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:10,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 233 transitions, 470 flow [2025-01-09 21:39:10,775 INFO L124 PetriNetUnfolderBase]: 5/259 cut-off events. [2025-01-09 21:39:10,778 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:10,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 259 events. 5/259 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 177. Up to 4 conditions per place. [2025-01-09 21:39:10,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 233 transitions, 470 flow [2025-01-09 21:39:10,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 233 transitions, 470 flow [2025-01-09 21:39:10,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:10,818 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;@78131b89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:10,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 21:39:10,871 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:10,872 INFO L124 PetriNetUnfolderBase]: 1/163 cut-off events. [2025-01-09 21:39:10,872 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:10,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:10,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:10,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-01-09 21:39:10,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash 596135461, now seen corresponding path program 1 times [2025-01-09 21:39:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233827440] [2025-01-09 21:39:10,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:11,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 21:39:11,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 21:39:11,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:11,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:11,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233827440] [2025-01-09 21:39:11,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233827440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:11,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:11,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:11,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156491126] [2025-01-09 21:39:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:11,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:11,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:11,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:11,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-01-09 21:39:11,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 233 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:11,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:11,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-01-09 21:39:11,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:11,697 INFO L124 PetriNetUnfolderBase]: 122/754 cut-off events. [2025-01-09 21:39:11,697 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:39:11,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 754 events. 122/754 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3249 event pairs, 29 based on Foata normal form. 1/690 useless extension candidates. Maximal degree in co-relation 832. Up to 167 conditions per place. [2025-01-09 21:39:11,706 INFO L140 encePairwiseOnDemand]: 222/233 looper letters, 28 selfloop transitions, 6 changer transitions 1/243 dead transitions. [2025-01-09 21:39:11,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 243 transitions, 558 flow [2025-01-09 21:39:11,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-01-09 21:39:11,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9542203147353362 [2025-01-09 21:39:11,728 INFO L175 Difference]: Start difference. First operand has 233 places, 233 transitions, 470 flow. Second operand 3 states and 667 transitions. [2025-01-09 21:39:11,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 243 transitions, 558 flow [2025-01-09 21:39:11,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 243 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:11,746 INFO L231 Difference]: Finished difference. Result has 235 places, 232 transitions, 502 flow [2025-01-09 21:39:11,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=235, PETRI_TRANSITIONS=232} [2025-01-09 21:39:11,754 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2025-01-09 21:39:11,756 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 232 transitions, 502 flow [2025-01-09 21:39:11,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:11,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:11,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:11,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:39:11,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-01-09 21:39:11,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1038939146, now seen corresponding path program 1 times [2025-01-09 21:39:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:11,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200982389] [2025-01-09 21:39:11,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:11,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:39:11,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:39:11,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:11,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:11,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:11,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200982389] [2025-01-09 21:39:11,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200982389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:11,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817575805] [2025-01-09 21:39:11,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:11,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:11,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:11,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:12,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 233 [2025-01-09 21:39:12,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 232 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:12,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 233 [2025-01-09 21:39:12,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:12,171 INFO L124 PetriNetUnfolderBase]: 122/847 cut-off events. [2025-01-09 21:39:12,172 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-09 21:39:12,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 847 events. 122/847 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4147 event pairs, 56 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 1010. Up to 170 conditions per place. [2025-01-09 21:39:12,179 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 19 selfloop transitions, 3 changer transitions 1/240 dead transitions. [2025-01-09 21:39:12,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 240 transitions, 564 flow [2025-01-09 21:39:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2025-01-09 21:39:12,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9613733905579399 [2025-01-09 21:39:12,182 INFO L175 Difference]: Start difference. First operand has 235 places, 232 transitions, 502 flow. Second operand 3 states and 672 transitions. [2025-01-09 21:39:12,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 240 transitions, 564 flow [2025-01-09 21:39:12,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 240 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:12,190 INFO L231 Difference]: Finished difference. Result has 236 places, 234 transitions, 512 flow [2025-01-09 21:39:12,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=236, PETRI_TRANSITIONS=234} [2025-01-09 21:39:12,191 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 3 predicate places. [2025-01-09 21:39:12,191 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 234 transitions, 512 flow [2025-01-09 21:39:12,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:12,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:12,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:39:12,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-01-09 21:39:12,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash -385699640, now seen corresponding path program 1 times [2025-01-09 21:39:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:12,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201259347] [2025-01-09 21:39:12,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:12,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:39:12,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:39:12,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:12,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:12,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:12,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201259347] [2025-01-09 21:39:12,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201259347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:12,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:12,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:12,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619321688] [2025-01-09 21:39:12,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:12,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:12,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:12,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:12,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:12,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-01-09 21:39:12,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 234 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:12,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-01-09 21:39:12,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:12,521 INFO L124 PetriNetUnfolderBase]: 146/883 cut-off events. [2025-01-09 21:39:12,521 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-09 21:39:12,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 883 events. 146/883 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4251 event pairs, 73 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1150. Up to 267 conditions per place. [2025-01-09 21:39:12,526 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 26 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2025-01-09 21:39:12,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 242 transitions, 594 flow [2025-01-09 21:39:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2025-01-09 21:39:12,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456366237482118 [2025-01-09 21:39:12,528 INFO L175 Difference]: Start difference. First operand has 236 places, 234 transitions, 512 flow. Second operand 3 states and 661 transitions. [2025-01-09 21:39:12,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 242 transitions, 594 flow [2025-01-09 21:39:12,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 242 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:12,534 INFO L231 Difference]: Finished difference. Result has 238 places, 238 transitions, 548 flow [2025-01-09 21:39:12,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=238, PETRI_TRANSITIONS=238} [2025-01-09 21:39:12,535 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2025-01-09 21:39:12,535 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 238 transitions, 548 flow [2025-01-09 21:39:12,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:12,536 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:12,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:39:12,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-01-09 21:39:12,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1371749897, now seen corresponding path program 1 times [2025-01-09 21:39:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:12,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446556976] [2025-01-09 21:39:12,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:12,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:12,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:39:12,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:39:12,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:12,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:12,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:39:12,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:39:12,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:39:12,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:12,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:12,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:39:12,724 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:39:12,725 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-09 21:39:12,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-01-09 21:39:12,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-01-09 21:39:12,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-01-09 21:39:12,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-01-09 21:39:12,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-01-09 21:39:12,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-01-09 21:39:12,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-01-09 21:39:12,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-01-09 21:39:12,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-01-09 21:39:12,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-01-09 21:39:12,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-01-09 21:39:12,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-01-09 21:39:12,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:39:12,733 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:39:12,737 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:39:12,737 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:39:12,781 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:12,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 280 transitions, 570 flow [2025-01-09 21:39:12,852 INFO L124 PetriNetUnfolderBase]: 7/340 cut-off events. [2025-01-09 21:39:12,852 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:39:12,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 340 events. 7/340 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 464 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 260. Up to 6 conditions per place. [2025-01-09 21:39:12,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 280 transitions, 570 flow [2025-01-09 21:39:12,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 280 transitions, 570 flow [2025-01-09 21:39:12,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:12,861 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;@78131b89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:12,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-09 21:39:12,873 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:12,873 INFO L124 PetriNetUnfolderBase]: 1/163 cut-off events. [2025-01-09 21:39:12,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:12,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:12,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:12,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-01-09 21:39:12,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1984354243, now seen corresponding path program 1 times [2025-01-09 21:39:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:12,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531105533] [2025-01-09 21:39:12,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:12,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 21:39:12,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 21:39:12,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:12,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:12,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531105533] [2025-01-09 21:39:12,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531105533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:12,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:12,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734924782] [2025-01-09 21:39:12,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:12,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:12,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:12,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:13,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 280 [2025-01-09 21:39:13,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 280 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:13,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:13,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 280 [2025-01-09 21:39:13,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:14,904 INFO L124 PetriNetUnfolderBase]: 4627/13176 cut-off events. [2025-01-09 21:39:14,904 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-09 21:39:14,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20586 conditions, 13176 events. 4627/13176 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 131186 event pairs, 1551 based on Foata normal form. 1/11688 useless extension candidates. Maximal degree in co-relation 19499. Up to 4243 conditions per place. [2025-01-09 21:39:15,032 INFO L140 encePairwiseOnDemand]: 259/280 looper letters, 54 selfloop transitions, 14 changer transitions 1/309 dead transitions. [2025-01-09 21:39:15,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 309 transitions, 769 flow [2025-01-09 21:39:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2025-01-09 21:39:15,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511904761904761 [2025-01-09 21:39:15,035 INFO L175 Difference]: Start difference. First operand has 282 places, 280 transitions, 570 flow. Second operand 3 states and 799 transitions. [2025-01-09 21:39:15,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 309 transitions, 769 flow [2025-01-09 21:39:15,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 309 transitions, 769 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:15,041 INFO L231 Difference]: Finished difference. Result has 286 places, 291 transitions, 686 flow [2025-01-09 21:39:15,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=286, PETRI_TRANSITIONS=291} [2025-01-09 21:39:15,042 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 4 predicate places. [2025-01-09 21:39:15,042 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 291 transitions, 686 flow [2025-01-09 21:39:15,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:15,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:15,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:15,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:39:15,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-01-09 21:39:15,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1863705610, now seen corresponding path program 1 times [2025-01-09 21:39:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:15,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294079129] [2025-01-09 21:39:15,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:15,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:39:15,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:39:15,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:15,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:15,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294079129] [2025-01-09 21:39:15,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294079129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:15,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:15,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394531130] [2025-01-09 21:39:15,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:15,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:15,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:15,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:15,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:15,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 280 [2025-01-09 21:39:15,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 291 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:15,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:15,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 280 [2025-01-09 21:39:15,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:17,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [Black: 285#true, 281#true, 99#L699-1true, 224#L713-1true, 283#true, 290#true, 216#L699-6true, 287#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:17,269 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-01-09 21:39:17,269 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-01-09 21:39:17,270 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:17,270 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:17,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 24#L699-2true, 224#L713-1true, 283#true, 290#true, 216#L699-6true, 287#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:17,287 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-01-09 21:39:17,287 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:17,287 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:17,287 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:17,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [Black: 285#true, 281#true, 224#L713-1true, 283#true, 169#L699-6true, 290#true, 216#L699-6true, 287#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:17,346 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-01-09 21:39:17,347 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:17,347 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-01-09 21:39:17,347 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-01-09 21:39:17,398 INFO L124 PetriNetUnfolderBase]: 4195/15297 cut-off events. [2025-01-09 21:39:17,398 INFO L125 PetriNetUnfolderBase]: For 824/865 co-relation queries the response was YES. [2025-01-09 21:39:17,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24305 conditions, 15297 events. 4195/15297 cut-off events. For 824/865 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 173389 event pairs, 2308 based on Foata normal form. 0/13662 useless extension candidates. Maximal degree in co-relation 23033. Up to 4051 conditions per place. [2025-01-09 21:39:17,511 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 34 selfloop transitions, 4 changer transitions 0/306 dead transitions. [2025-01-09 21:39:17,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 306 transitions, 792 flow [2025-01-09 21:39:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2025-01-09 21:39:17,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571428571428572 [2025-01-09 21:39:17,515 INFO L175 Difference]: Start difference. First operand has 286 places, 291 transitions, 686 flow. Second operand 3 states and 804 transitions. [2025-01-09 21:39:17,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 306 transitions, 792 flow [2025-01-09 21:39:17,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 306 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:17,536 INFO L231 Difference]: Finished difference. Result has 287 places, 294 transitions, 688 flow [2025-01-09 21:39:17,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=287, PETRI_TRANSITIONS=294} [2025-01-09 21:39:17,538 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 5 predicate places. [2025-01-09 21:39:17,539 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 294 transitions, 688 flow [2025-01-09 21:39:17,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:17,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:17,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:17,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:39:17,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-01-09 21:39:17,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:17,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1930093938, now seen corresponding path program 1 times [2025-01-09 21:39:17,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:17,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057364441] [2025-01-09 21:39:17,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:17,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:39:17,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:39:17,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:17,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:17,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:17,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057364441] [2025-01-09 21:39:17,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057364441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:17,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:17,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:17,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253107391] [2025-01-09 21:39:17,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:17,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:17,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:17,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:17,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 280 [2025-01-09 21:39:17,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 294 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:17,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:17,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 280 [2025-01-09 21:39:17,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:18,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][237], [281#true, Black: 285#true, 69#L692-7true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 259#L692-2true, 290#true, 295#true]) [2025-01-09 21:39:18,069 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-01-09 21:39:18,069 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:39:18,069 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:39:18,069 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:39:18,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 225#L694true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 259#L692-2true, 290#true, 295#true]) [2025-01-09 21:39:18,123 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-01-09 21:39:18,123 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-01-09 21:39:18,123 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-01-09 21:39:18,123 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:39:18,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 122#L694-3true, 259#L692-2true, 290#true, 295#true]) [2025-01-09 21:39:18,145 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-01-09 21:39:18,145 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:39:18,145 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-01-09 21:39:18,145 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:39:18,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 259#L692-2true, 290#true, 238#L695-3true, 295#true]) [2025-01-09 21:39:18,267 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2025-01-09 21:39:18,267 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-01-09 21:39:18,267 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:39:18,267 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:39:18,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 259#L692-2true, 290#true, 279#L697-3true, 295#true]) [2025-01-09 21:39:18,599 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-01-09 21:39:18,599 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-01-09 21:39:18,599 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-01-09 21:39:18,599 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-01-09 21:39:18,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 65#L698-3true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 259#L692-2true, 290#true, 295#true]) [2025-01-09 21:39:18,674 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-01-09 21:39:18,674 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:39:18,674 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-01-09 21:39:18,674 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:39:18,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][237], [281#true, 69#L692-7true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 290#true, 252#L699-2true, 295#true]) [2025-01-09 21:39:18,979 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-01-09 21:39:18,979 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-01-09 21:39:18,979 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-01-09 21:39:18,979 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-01-09 21:39:19,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 225#L694true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 290#true, 252#L699-2true, 295#true]) [2025-01-09 21:39:19,110 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-01-09 21:39:19,110 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-01-09 21:39:19,110 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-01-09 21:39:19,110 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-01-09 21:39:19,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 122#L694-3true, 283#true, 290#true, 252#L699-2true, 295#true]) [2025-01-09 21:39:19,148 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-01-09 21:39:19,148 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-01-09 21:39:19,148 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-01-09 21:39:19,148 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-01-09 21:39:19,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [Black: 285#true, 281#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 290#true, 238#L695-3true, 252#L699-2true, 295#true]) [2025-01-09 21:39:19,218 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-01-09 21:39:19,218 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-01-09 21:39:19,218 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-01-09 21:39:19,219 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-01-09 21:39:19,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [Black: 285#true, 281#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 290#true, 252#L699-2true, 279#L697-3true, 295#true]) [2025-01-09 21:39:19,481 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-01-09 21:39:19,481 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-01-09 21:39:19,481 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-01-09 21:39:19,481 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:39:19,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [281#true, Black: 285#true, 65#L698-3true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 290#true, 252#L699-2true, 295#true]) [2025-01-09 21:39:19,519 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2025-01-09 21:39:19,519 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-01-09 21:39:19,519 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-01-09 21:39:19,519 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-01-09 21:39:19,873 INFO L124 PetriNetUnfolderBase]: 5624/18320 cut-off events. [2025-01-09 21:39:19,873 INFO L125 PetriNetUnfolderBase]: For 2760/3027 co-relation queries the response was YES. [2025-01-09 21:39:19,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32070 conditions, 18320 events. 5624/18320 cut-off events. For 2760/3027 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 203952 event pairs, 2938 based on Foata normal form. 94/16589 useless extension candidates. Maximal degree in co-relation 25962. Up to 7539 conditions per place. [2025-01-09 21:39:19,955 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 49 selfloop transitions, 14 changer transitions 0/317 dead transitions. [2025-01-09 21:39:19,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 317 transitions, 885 flow [2025-01-09 21:39:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-01-09 21:39:19,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2025-01-09 21:39:19,957 INFO L175 Difference]: Start difference. First operand has 287 places, 294 transitions, 688 flow. Second operand 3 states and 791 transitions. [2025-01-09 21:39:19,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 317 transitions, 885 flow [2025-01-09 21:39:19,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 317 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:19,971 INFO L231 Difference]: Finished difference. Result has 289 places, 306 transitions, 806 flow [2025-01-09 21:39:19,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=289, PETRI_TRANSITIONS=306} [2025-01-09 21:39:19,973 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 7 predicate places. [2025-01-09 21:39:19,973 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 306 transitions, 806 flow [2025-01-09 21:39:19,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:19,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:19,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:19,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:39:19,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-01-09 21:39:19,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 913822549, now seen corresponding path program 1 times [2025-01-09 21:39:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:19,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386283618] [2025-01-09 21:39:19,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:19,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:39:20,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:39:20,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:20,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:20,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386283618] [2025-01-09 21:39:20,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386283618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:20,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:20,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:20,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481560194] [2025-01-09 21:39:20,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:20,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:20,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:20,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:20,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 280 [2025-01-09 21:39:20,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 306 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:20,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:20,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 280 [2025-01-09 21:39:20,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:20,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][233], [Black: 285#true, 69#L692-7true, 281#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 300#true, 259#L692-2true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 295#true]) [2025-01-09 21:39:20,356 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-01-09 21:39:20,356 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:39:20,357 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:39:20,357 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:39:20,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [Black: 285#true, 281#true, 225#L694true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 259#L692-2true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 295#true]) [2025-01-09 21:39:20,440 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-01-09 21:39:20,440 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-01-09 21:39:20,440 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:39:20,440 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-01-09 21:39:21,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L699-->L699-1: Formula: (= |v_#race~threads_alive~0_14| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_14|} AuxVars[] AssignedVars[#race~threads_alive~0][318], [69#L692-7true, Black: 285#true, 281#true, 15#L713-2true, Black: 292#(= |#race~data~0| 0), 78#L699-1true, 283#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 295#true]) [2025-01-09 21:39:21,352 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-01-09 21:39:21,353 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-01-09 21:39:21,353 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-01-09 21:39:21,353 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-01-09 21:39:21,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][233], [Black: 285#true, 69#L692-7true, 281#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 78#L699-1true, 283#true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 295#true]) [2025-01-09 21:39:21,388 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][233], [69#L692-7true, Black: 285#true, 281#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 252#L699-2true, 295#true]) [2025-01-09 21:39:21,388 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][233], [Black: 285#true, 69#L692-7true, 281#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 252#L699-2true, 295#true]) [2025-01-09 21:39:21,388 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-01-09 21:39:21,388 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-01-09 21:39:21,389 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-01-09 21:39:21,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [Black: 285#true, 281#true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 13#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 252#L699-2true, 295#true]) [2025-01-09 21:39:21,449 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-01-09 21:39:21,449 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-01-09 21:39:21,449 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-01-09 21:39:21,449 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-01-09 21:39:21,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L714-5-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [Black: 285#true, 281#true, 225#L694true, Black: 292#(= |#race~data~0| 0), 224#L713-1true, 283#true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 252#L699-2true, 295#true]) [2025-01-09 21:39:21,456 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-01-09 21:39:21,456 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-01-09 21:39:21,456 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-01-09 21:39:21,456 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-01-09 21:39:22,201 INFO L124 PetriNetUnfolderBase]: 5599/20226 cut-off events. [2025-01-09 21:39:22,201 INFO L125 PetriNetUnfolderBase]: For 3183/3543 co-relation queries the response was YES. [2025-01-09 21:39:22,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34706 conditions, 20226 events. 5599/20226 cut-off events. For 3183/3543 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 239626 event pairs, 3099 based on Foata normal form. 21/18165 useless extension candidates. Maximal degree in co-relation 33125. Up to 6066 conditions per place. [2025-01-09 21:39:22,311 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 36 selfloop transitions, 7 changer transitions 0/322 dead transitions. [2025-01-09 21:39:22,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 322 transitions, 935 flow [2025-01-09 21:39:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2025-01-09 21:39:22,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-01-09 21:39:22,314 INFO L175 Difference]: Start difference. First operand has 289 places, 306 transitions, 806 flow. Second operand 3 states and 800 transitions. [2025-01-09 21:39:22,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 322 transitions, 935 flow [2025-01-09 21:39:22,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 322 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:22,327 INFO L231 Difference]: Finished difference. Result has 291 places, 311 transitions, 834 flow [2025-01-09 21:39:22,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=291, PETRI_TRANSITIONS=311} [2025-01-09 21:39:22,328 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 9 predicate places. [2025-01-09 21:39:22,328 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 311 transitions, 834 flow [2025-01-09 21:39:22,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:22,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:22,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:22,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:39:22,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-01-09 21:39:22,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash -79537274, now seen corresponding path program 1 times [2025-01-09 21:39:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454443277] [2025-01-09 21:39:22,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:22,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 21:39:22,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 21:39:22,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:22,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:22,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454443277] [2025-01-09 21:39:22,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454443277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:22,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:39:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611663376] [2025-01-09 21:39:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:22,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:22,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:22,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:22,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:22,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 280 [2025-01-09 21:39:22,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 311 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:22,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:22,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 280 [2025-01-09 21:39:22,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:24,294 INFO L124 PetriNetUnfolderBase]: 1939/10763 cut-off events. [2025-01-09 21:39:24,294 INFO L125 PetriNetUnfolderBase]: For 1679/1960 co-relation queries the response was YES. [2025-01-09 21:39:24,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17785 conditions, 10763 events. 1939/10763 cut-off events. For 1679/1960 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 127729 event pairs, 546 based on Foata normal form. 260/10107 useless extension candidates. Maximal degree in co-relation 16781. Up to 1517 conditions per place. [2025-01-09 21:39:24,326 INFO L140 encePairwiseOnDemand]: 266/280 looper letters, 16 selfloop transitions, 14 changer transitions 0/318 dead transitions. [2025-01-09 21:39:24,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 318 transitions, 897 flow [2025-01-09 21:39:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2025-01-09 21:39:24,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9678571428571429 [2025-01-09 21:39:24,329 INFO L175 Difference]: Start difference. First operand has 291 places, 311 transitions, 834 flow. Second operand 3 states and 813 transitions. [2025-01-09 21:39:24,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 318 transitions, 897 flow [2025-01-09 21:39:24,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 318 transitions, 883 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:24,338 INFO L231 Difference]: Finished difference. Result has 292 places, 315 transitions, 870 flow [2025-01-09 21:39:24,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=292, PETRI_TRANSITIONS=315} [2025-01-09 21:39:24,340 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 10 predicate places. [2025-01-09 21:39:24,340 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 315 transitions, 870 flow [2025-01-09 21:39:24,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:24,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:24,341 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:24,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:39:24,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-01-09 21:39:24,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1192471986, now seen corresponding path program 1 times [2025-01-09 21:39:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140503014] [2025-01-09 21:39:24,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:24,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:24,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:39:24,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:39:24,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:24,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:24,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140503014] [2025-01-09 21:39:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140503014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:24,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:24,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:24,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34690175] [2025-01-09 21:39:24,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:24,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:24,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:24,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:24,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:24,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 280 [2025-01-09 21:39:24,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 315 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:24,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:24,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 280 [2025-01-09 21:39:24,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:25,593 INFO L124 PetriNetUnfolderBase]: 3011/13203 cut-off events. [2025-01-09 21:39:25,594 INFO L125 PetriNetUnfolderBase]: For 6976/7613 co-relation queries the response was YES. [2025-01-09 21:39:25,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27760 conditions, 13203 events. 3011/13203 cut-off events. For 6976/7613 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 154971 event pairs, 1192 based on Foata normal form. 50/12222 useless extension candidates. Maximal degree in co-relation 26513. Up to 4906 conditions per place. [2025-01-09 21:39:25,650 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 60 selfloop transitions, 10 changer transitions 0/331 dead transitions. [2025-01-09 21:39:25,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 331 transitions, 1079 flow [2025-01-09 21:39:25,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:25,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2025-01-09 21:39:25,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357142857142857 [2025-01-09 21:39:25,652 INFO L175 Difference]: Start difference. First operand has 292 places, 315 transitions, 870 flow. Second operand 3 states and 786 transitions. [2025-01-09 21:39:25,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 331 transitions, 1079 flow [2025-01-09 21:39:25,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 331 transitions, 1058 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:39:25,662 INFO L231 Difference]: Finished difference. Result has 295 places, 323 transitions, 946 flow [2025-01-09 21:39:25,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=295, PETRI_TRANSITIONS=323} [2025-01-09 21:39:25,663 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 13 predicate places. [2025-01-09 21:39:25,663 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 323 transitions, 946 flow [2025-01-09 21:39:25,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:25,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:25,664 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:25,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:39:25,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-01-09 21:39:25,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:25,665 INFO L85 PathProgramCache]: Analyzing trace with hash -703503537, now seen corresponding path program 1 times [2025-01-09 21:39:25,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:25,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266523833] [2025-01-09 21:39:25,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:25,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 21:39:25,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 21:39:25,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:25,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:25,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:39:25,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 21:39:25,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 21:39:25,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:25,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:25,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:39:25,762 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:39:25,762 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-01-09 21:39:25,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-01-09 21:39:25,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-01-09 21:39:25,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-01-09 21:39:25,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-01-09 21:39:25,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-01-09 21:39:25,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-01-09 21:39:25,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-01-09 21:39:25,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:39:25,763 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:25,764 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:39:25,764 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:39:25,796 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:25,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 327 transitions, 672 flow [2025-01-09 21:39:25,842 INFO L124 PetriNetUnfolderBase]: 9/421 cut-off events. [2025-01-09 21:39:25,842 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:39:25,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 421 events. 9/421 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 800 event pairs, 0 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 344. Up to 8 conditions per place. [2025-01-09 21:39:25,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 327 transitions, 672 flow [2025-01-09 21:39:25,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 327 transitions, 672 flow [2025-01-09 21:39:25,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:25,850 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;@78131b89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:25,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:39:25,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:25,857 INFO L124 PetriNetUnfolderBase]: 1/163 cut-off events. [2025-01-09 21:39:25,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:25,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:25,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:25,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2025-01-09 21:39:25,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1577362908, now seen corresponding path program 1 times [2025-01-09 21:39:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162578347] [2025-01-09 21:39:25,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:25,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 21:39:25,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 21:39:25,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:25,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:25,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162578347] [2025-01-09 21:39:25,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162578347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:25,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:25,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:25,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40189398] [2025-01-09 21:39:25,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:25,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:25,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:25,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:25,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:25,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 327 [2025-01-09 21:39:25,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 327 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:25,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:25,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 327 [2025-01-09 21:39:25,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:52,832 INFO L124 PetriNetUnfolderBase]: 119918/257925 cut-off events. [2025-01-09 21:39:52,833 INFO L125 PetriNetUnfolderBase]: For 1618/1618 co-relation queries the response was YES. [2025-01-09 21:39:53,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426303 conditions, 257925 events. 119918/257925 cut-off events. For 1618/1618 co-relation queries the response was YES. Maximal size of possible extension queue 5110. Compared 3349677 event pairs, 42479 based on Foata normal form. 1/227128 useless extension candidates. Maximal degree in co-relation 332503. Up to 93558 conditions per place. [2025-01-09 21:39:54,686 INFO L140 encePairwiseOnDemand]: 298/327 looper letters, 76 selfloop transitions, 20 changer transitions 1/369 dead transitions. [2025-01-09 21:39:54,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 369 transitions, 960 flow [2025-01-09 21:39:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-01-09 21:39:54,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9429153924566769 [2025-01-09 21:39:54,689 INFO L175 Difference]: Start difference. First operand has 331 places, 327 transitions, 672 flow. Second operand 3 states and 925 transitions. [2025-01-09 21:39:54,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 369 transitions, 960 flow [2025-01-09 21:39:54,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 369 transitions, 956 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:54,695 INFO L231 Difference]: Finished difference. Result has 335 places, 344 transitions, 838 flow [2025-01-09 21:39:54,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=335, PETRI_TRANSITIONS=344} [2025-01-09 21:39:54,696 INFO L279 CegarLoopForPetriNet]: 331 programPoint places, 4 predicate places. [2025-01-09 21:39:54,697 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 344 transitions, 838 flow [2025-01-09 21:39:54,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:54,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:54,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:39:54,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2025-01-09 21:39:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1783851530, now seen corresponding path program 1 times [2025-01-09 21:39:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672067917] [2025-01-09 21:39:54,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:54,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:39:54,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:39:54,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:54,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:54,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672067917] [2025-01-09 21:39:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672067917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:54,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623015516] [2025-01-09 21:39:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:54,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:54,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:54,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:54,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 327 [2025-01-09 21:39:54,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 344 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:54,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:54,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 327 [2025-01-09 21:39:54,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand