./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/reorder_c11_good-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/reorder_c11_good-40.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc410c23b8a40101ed787fe72a0515ef047b7022a45484b309d3277414201100 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:57:36,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:57:36,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:57:36,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:57:36,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:57:36,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:57:36,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:57:36,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:57:36,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:57:36,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:57:36,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:57:36,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:57:36,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:57:36,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:36,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:57:36,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:57:36,388 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/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 -> bc410c23b8a40101ed787fe72a0515ef047b7022a45484b309d3277414201100 [2025-03-04 06:57:36,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:57:36,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:57:36,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:57:36,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:57:36,646 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:57:36,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/reorder_c11_good-40.i [2025-03-04 06:57:37,840 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d54f6a1/b85ef97dad1c4ff1a13d618eb6e4795e/FLAG838dc718b [2025-03-04 06:57:38,098 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:57:38,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/reorder_c11_good-40.i [2025-03-04 06:57:38,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d54f6a1/b85ef97dad1c4ff1a13d618eb6e4795e/FLAG838dc718b [2025-03-04 06:57:38,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d54f6a1/b85ef97dad1c4ff1a13d618eb6e4795e [2025-03-04 06:57:38,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:57:38,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:57:38,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:38,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:57:38,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:57:38,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@811b0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38, skipping insertion in model container [2025-03-04 06:57:38,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:57:38,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:38,404 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:57:38,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:38,477 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:57:38,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38 WrapperNode [2025-03-04 06:57:38,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:38,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:38,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:57:38,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:57:38,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,510 INFO L138 Inliner]: procedures = 163, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2025-03-04 06:57:38,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:38,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:57:38,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:57:38,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:57:38,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:57:38,551 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:57:38,551 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:57:38,551 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:57:38,552 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (1/1) ... [2025-03-04 06:57:38,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:38,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:57:38,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:57:38,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:57:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:57:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-04 06:57:38,604 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-04 06:57:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:57:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:57:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:57:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:57:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:57:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-04 06:57:38,605 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-04 06:57:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:57:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:57:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:57:38,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:57:38,606 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:57:38,701 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:57:38,703 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:57:39,011 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:57:39,011 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:57:39,040 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:57:39,040 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:57:39,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:39 BoogieIcfgContainer [2025-03-04 06:57:39,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:57:39,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:57:39,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:57:39,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:57:39,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:57:38" (1/3) ... [2025-03-04 06:57:39,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5134a0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:39, skipping insertion in model container [2025-03-04 06:57:39,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:38" (2/3) ... [2025-03-04 06:57:39,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5134a0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:39, skipping insertion in model container [2025-03-04 06:57:39,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:39" (3/3) ... [2025-03-04 06:57:39,051 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_c11_good-40.i [2025-03-04 06:57:39,066 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:57:39,068 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_c11_good-40.i that has 3 procedures, 203 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-03-04 06:57:39,068 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:57:39,134 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:57:39,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 217 transitions, 454 flow [2025-03-04 06:57:39,383 INFO L124 PetriNetUnfolderBase]: 32/556 cut-off events. [2025-03-04 06:57:39,385 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 06:57:39,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 556 events. 32/556 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2267 event pairs, 0 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 266. Up to 8 conditions per place. [2025-03-04 06:57:39,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 217 transitions, 454 flow [2025-03-04 06:57:39,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 217 transitions, 454 flow [2025-03-04 06:57:39,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:39,425 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;@6cc91ec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:39,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 06:57:39,431 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:39,431 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:39,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:39,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:39,432 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] [2025-03-04 06:57:39,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:39,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:39,441 INFO L85 PathProgramCache]: Analyzing trace with hash 952124489, now seen corresponding path program 1 times [2025-03-04 06:57:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:39,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112971937] [2025-03-04 06:57:39,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:39,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:39,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:39,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:39,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:39,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:39,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112971937] [2025-03-04 06:57:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112971937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:39,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:39,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77589026] [2025-03-04 06:57:39,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:39,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:39,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:39,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:39,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:39,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 217 [2025-03-04 06:57:39,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 217 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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-03-04 06:57:39,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:39,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 217 [2025-03-04 06:57:39,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:39,952 INFO L124 PetriNetUnfolderBase]: 85/973 cut-off events. [2025-03-04 06:57:39,953 INFO L125 PetriNetUnfolderBase]: For 42/44 co-relation queries the response was YES. [2025-03-04 06:57:39,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 973 events. 85/973 cut-off events. For 42/44 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5341 event pairs, 64 based on Foata normal form. 45/837 useless extension candidates. Maximal degree in co-relation 872. Up to 207 conditions per place. [2025-03-04 06:57:39,960 INFO L140 encePairwiseOnDemand]: 207/217 looper letters, 31 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2025-03-04 06:57:39,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 200 transitions, 486 flow [2025-03-04 06:57:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2025-03-04 06:57:39,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8602150537634409 [2025-03-04 06:57:39,974 INFO L175 Difference]: Start difference. First operand has 209 places, 217 transitions, 454 flow. Second operand 3 states and 560 transitions. [2025-03-04 06:57:39,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 200 transitions, 486 flow [2025-03-04 06:57:39,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:39,998 INFO L231 Difference]: Finished difference. Result has 200 places, 200 transitions, 424 flow [2025-03-04 06:57:40,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=200, PETRI_TRANSITIONS=200} [2025-03-04 06:57:40,002 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -9 predicate places. [2025-03-04 06:57:40,002 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 200 transitions, 424 flow [2025-03-04 06:57:40,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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-03-04 06:57:40,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:40,003 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] [2025-03-04 06:57:40,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:57:40,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:40,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash 776962255, now seen corresponding path program 1 times [2025-03-04 06:57:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:40,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609751383] [2025-03-04 06:57:40,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:40,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:40,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:40,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:40,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:40,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:40,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:40,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609751383] [2025-03-04 06:57:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609751383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:40,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:40,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104666576] [2025-03-04 06:57:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:40,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:40,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:40,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:40,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:40,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 217 [2025-03-04 06:57:40,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 200 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-03-04 06:57:40,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:40,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 217 [2025-03-04 06:57:40,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:40,276 INFO L124 PetriNetUnfolderBase]: 117/982 cut-off events. [2025-03-04 06:57:40,276 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 06:57:40,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 982 events. 117/982 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5250 event pairs, 78 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1281. Up to 243 conditions per place. [2025-03-04 06:57:40,284 INFO L140 encePairwiseOnDemand]: 194/217 looper letters, 31 selfloop transitions, 11 changer transitions 0/190 dead transitions. [2025-03-04 06:57:40,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 190 transitions, 488 flow [2025-03-04 06:57:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-03-04 06:57:40,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972350230414746 [2025-03-04 06:57:40,288 INFO L175 Difference]: Start difference. First operand has 200 places, 200 transitions, 424 flow. Second operand 3 states and 519 transitions. [2025-03-04 06:57:40,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 190 transitions, 488 flow [2025-03-04 06:57:40,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 190 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:40,293 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 418 flow [2025-03-04 06:57:40,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=188, PETRI_TRANSITIONS=188} [2025-03-04 06:57:40,294 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -21 predicate places. [2025-03-04 06:57:40,294 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 418 flow [2025-03-04 06:57:40,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-03-04 06:57:40,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:40,295 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] [2025-03-04 06:57:40,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:57:40,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:40,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1245964000, now seen corresponding path program 1 times [2025-03-04 06:57:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:40,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268515409] [2025-03-04 06:57:40,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:40,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:57:40,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:57:40,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:40,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:40,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:40,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268515409] [2025-03-04 06:57:40,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268515409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:40,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:40,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:40,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680144215] [2025-03-04 06:57:40,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:40,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:40,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:40,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:40,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 217 [2025-03-04 06:57:40,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 188 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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-03-04 06:57:40,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:40,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 217 [2025-03-04 06:57:40,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:40,586 INFO L124 PetriNetUnfolderBase]: 27/504 cut-off events. [2025-03-04 06:57:40,586 INFO L125 PetriNetUnfolderBase]: For 32/36 co-relation queries the response was YES. [2025-03-04 06:57:40,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 504 events. 27/504 cut-off events. For 32/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1554 event pairs, 10 based on Foata normal form. 6/459 useless extension candidates. Maximal degree in co-relation 436. Up to 39 conditions per place. [2025-03-04 06:57:40,590 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 17 selfloop transitions, 8 changer transitions 9/193 dead transitions. [2025-03-04 06:57:40,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 193 transitions, 486 flow [2025-03-04 06:57:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2025-03-04 06:57:40,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032258064516129 [2025-03-04 06:57:40,593 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 418 flow. Second operand 3 states and 588 transitions. [2025-03-04 06:57:40,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 193 transitions, 486 flow [2025-03-04 06:57:40,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 193 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:40,604 INFO L231 Difference]: Finished difference. Result has 189 places, 180 transitions, 412 flow [2025-03-04 06:57:40,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=189, PETRI_TRANSITIONS=180} [2025-03-04 06:57:40,605 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -20 predicate places. [2025-03-04 06:57:40,605 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 180 transitions, 412 flow [2025-03-04 06:57:40,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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-03-04 06:57:40,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:40,605 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] [2025-03-04 06:57:40,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:57:40,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:40,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1828300772, now seen corresponding path program 1 times [2025-03-04 06:57:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954689060] [2025-03-04 06:57:40,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:40,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:57:40,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:57:40,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:40,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:41,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:41,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954689060] [2025-03-04 06:57:41,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954689060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:41,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:41,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:41,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147641364] [2025-03-04 06:57:41,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:41,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:41,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:41,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:41,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:41,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 217 [2025-03-04 06:57:41,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 180 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 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-03-04 06:57:41,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:41,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 217 [2025-03-04 06:57:41,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:41,380 INFO L124 PetriNetUnfolderBase]: 83/713 cut-off events. [2025-03-04 06:57:41,380 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 06:57:41,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 713 events. 83/713 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2703 event pairs, 5 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 794. Up to 193 conditions per place. [2025-03-04 06:57:41,386 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 42 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2025-03-04 06:57:41,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 187 transitions, 520 flow [2025-03-04 06:57:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2025-03-04 06:57:41,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8010752688172043 [2025-03-04 06:57:41,392 INFO L175 Difference]: Start difference. First operand has 189 places, 180 transitions, 412 flow. Second operand 6 states and 1043 transitions. [2025-03-04 06:57:41,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 187 transitions, 520 flow [2025-03-04 06:57:41,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 187 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:41,397 INFO L231 Difference]: Finished difference. Result has 183 places, 179 transitions, 412 flow [2025-03-04 06:57:41,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=183, PETRI_TRANSITIONS=179} [2025-03-04 06:57:41,399 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -26 predicate places. [2025-03-04 06:57:41,399 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 179 transitions, 412 flow [2025-03-04 06:57:41,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 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-03-04 06:57:41,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:41,400 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] [2025-03-04 06:57:41,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:57:41,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:41,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:41,401 INFO L85 PathProgramCache]: Analyzing trace with hash 68137568, now seen corresponding path program 1 times [2025-03-04 06:57:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:41,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427332577] [2025-03-04 06:57:41,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:41,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:57:41,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:57:41,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:41,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:41,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:41,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427332577] [2025-03-04 06:57:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427332577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:41,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:41,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033140337] [2025-03-04 06:57:41,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:41,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:41,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:41,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:41,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:41,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 217 [2025-03-04 06:57:41,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 179 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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-03-04 06:57:41,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:41,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 217 [2025-03-04 06:57:41,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:41,607 INFO L124 PetriNetUnfolderBase]: 63/695 cut-off events. [2025-03-04 06:57:41,607 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 06:57:41,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 695 events. 63/695 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2656 event pairs, 49 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 728. Up to 151 conditions per place. [2025-03-04 06:57:41,611 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 32 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2025-03-04 06:57:41,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 180 transitions, 482 flow [2025-03-04 06:57:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2025-03-04 06:57:41,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509984639016898 [2025-03-04 06:57:41,613 INFO L175 Difference]: Start difference. First operand has 183 places, 179 transitions, 412 flow. Second operand 3 states and 554 transitions. [2025-03-04 06:57:41,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 180 transitions, 482 flow [2025-03-04 06:57:41,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 180 transitions, 472 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:41,616 INFO L231 Difference]: Finished difference. Result has 179 places, 178 transitions, 404 flow [2025-03-04 06:57:41,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=179, PETRI_TRANSITIONS=178} [2025-03-04 06:57:41,617 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -30 predicate places. [2025-03-04 06:57:41,617 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 178 transitions, 404 flow [2025-03-04 06:57:41,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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-03-04 06:57:41,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:41,618 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:41,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:57:41,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:41,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1237272241, now seen corresponding path program 1 times [2025-03-04 06:57:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:41,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951240409] [2025-03-04 06:57:41,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:41,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:57:41,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:57:41,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:41,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:41,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:41,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951240409] [2025-03-04 06:57:41,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951240409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:41,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:41,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:41,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804660131] [2025-03-04 06:57:41,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:41,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:57:41,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:41,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:57:41,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:57:41,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2025-03-04 06:57:41,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 178 transitions, 404 flow. Second operand has 5 states, 5 states have (on average 181.8) internal successors, (909), 5 states have internal predecessors, (909), 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-03-04 06:57:41,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:41,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2025-03-04 06:57:41,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:41,879 INFO L124 PetriNetUnfolderBase]: 6/115 cut-off events. [2025-03-04 06:57:41,880 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:57:41,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 115 events. 6/115 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs, 0 based on Foata normal form. 3/118 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2025-03-04 06:57:41,880 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 11 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-04 06:57:41,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 156 flow [2025-03-04 06:57:41,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1096 transitions. [2025-03-04 06:57:41,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8417818740399385 [2025-03-04 06:57:41,882 INFO L175 Difference]: Start difference. First operand has 179 places, 178 transitions, 404 flow. Second operand 6 states and 1096 transitions. [2025-03-04 06:57:41,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 156 flow [2025-03-04 06:57:41,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:57:41,883 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 114 flow [2025-03-04 06:57:41,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-03-04 06:57:41,884 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -149 predicate places. [2025-03-04 06:57:41,884 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 114 flow [2025-03-04 06:57:41,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 181.8) internal successors, (909), 5 states have internal predecessors, (909), 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-03-04 06:57:41,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:41,885 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:41,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:57:41,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:41,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1324501467, now seen corresponding path program 1 times [2025-03-04 06:57:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:41,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936957634] [2025-03-04 06:57:41,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:41,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:41,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:57:41,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:57:41,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:41,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:41,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:57:41,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:57:41,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:57:41,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:41,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:41,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:57:41,945 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:57:41,946 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-03-04 06:57:41,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-03-04 06:57:41,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-03-04 06:57:41,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-03-04 06:57:41,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-03-04 06:57:41,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-03-04 06:57:41,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-03-04 06:57:41,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-03-04 06:57:41,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-03-04 06:57:41,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-03-04 06:57:41,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-03-04 06:57:41,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-03-04 06:57:41,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-03-04 06:57:41,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-03-04 06:57:41,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 38 remaining) [2025-03-04 06:57:41,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-03-04 06:57:41,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-03-04 06:57:41,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-03-04 06:57:41,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-03-04 06:57:41,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-03-04 06:57:41,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-03-04 06:57:41,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:57:41,950 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:41,953 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:57:41,953 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:57:41,980 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-04 06:57:41,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 270 transitions, 584 flow [2025-03-04 06:57:42,117 INFO L124 PetriNetUnfolderBase]: 131/1806 cut-off events. [2025-03-04 06:57:42,118 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 06:57:42,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 1806 events. 131/1806 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 10508 event pairs, 2 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 1024. Up to 32 conditions per place. [2025-03-04 06:57:42,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 270 transitions, 584 flow [2025-03-04 06:57:42,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 270 transitions, 584 flow [2025-03-04 06:57:42,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:42,144 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;@6cc91ec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:42,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 06:57:42,146 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:42,146 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:42,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:42,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:42,146 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] [2025-03-04 06:57:42,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:42,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1981199177, now seen corresponding path program 1 times [2025-03-04 06:57:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:42,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353465962] [2025-03-04 06:57:42,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:42,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:42,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:42,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:42,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:42,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:42,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353465962] [2025-03-04 06:57:42,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353465962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:42,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:42,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381249167] [2025-03-04 06:57:42,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:42,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:42,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:42,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:42,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-03-04 06:57:42,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 270 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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-03-04 06:57:42,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:42,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-03-04 06:57:42,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:42,937 INFO L124 PetriNetUnfolderBase]: 1200/6906 cut-off events. [2025-03-04 06:57:42,937 INFO L125 PetriNetUnfolderBase]: For 670/704 co-relation queries the response was YES. [2025-03-04 06:57:42,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 6906 events. 1200/6906 cut-off events. For 670/704 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 60475 event pairs, 985 based on Foata normal form. 836/6537 useless extension candidates. Maximal degree in co-relation 4715. Up to 2070 conditions per place. [2025-03-04 06:57:42,995 INFO L140 encePairwiseOnDemand]: 257/270 looper letters, 39 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2025-03-04 06:57:42,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 241 transitions, 608 flow [2025-03-04 06:57:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-03-04 06:57:42,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8493827160493828 [2025-03-04 06:57:42,997 INFO L175 Difference]: Start difference. First operand has 257 places, 270 transitions, 584 flow. Second operand 3 states and 688 transitions. [2025-03-04 06:57:42,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 241 transitions, 608 flow [2025-03-04 06:57:43,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 241 transitions, 608 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:43,003 INFO L231 Difference]: Finished difference. Result has 238 places, 241 transitions, 530 flow [2025-03-04 06:57:43,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=238, PETRI_TRANSITIONS=241} [2025-03-04 06:57:43,004 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -19 predicate places. [2025-03-04 06:57:43,004 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 241 transitions, 530 flow [2025-03-04 06:57:43,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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-03-04 06:57:43,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:43,004 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] [2025-03-04 06:57:43,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:57:43,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:43,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:43,005 INFO L85 PathProgramCache]: Analyzing trace with hash 464699739, now seen corresponding path program 1 times [2025-03-04 06:57:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:43,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913222141] [2025-03-04 06:57:43,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:43,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:43,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:43,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:43,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:43,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:43,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913222141] [2025-03-04 06:57:43,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913222141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:43,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:43,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:43,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132783237] [2025-03-04 06:57:43,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:43,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:43,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:43,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:43,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 270 [2025-03-04 06:57:43,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 241 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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-03-04 06:57:43,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:43,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 270 [2025-03-04 06:57:43,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:43,872 INFO L124 PetriNetUnfolderBase]: 1650/7274 cut-off events. [2025-03-04 06:57:43,872 INFO L125 PetriNetUnfolderBase]: For 671/689 co-relation queries the response was YES. [2025-03-04 06:57:43,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10494 conditions, 7274 events. 1650/7274 cut-off events. For 671/689 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 60591 event pairs, 1169 based on Foata normal form. 0/6508 useless extension candidates. Maximal degree in co-relation 10463. Up to 2412 conditions per place. [2025-03-04 06:57:43,942 INFO L140 encePairwiseOnDemand]: 247/270 looper letters, 41 selfloop transitions, 11 changer transitions 0/233 dead transitions. [2025-03-04 06:57:43,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 233 transitions, 618 flow [2025-03-04 06:57:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-03-04 06:57:43,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975308641975308 [2025-03-04 06:57:43,945 INFO L175 Difference]: Start difference. First operand has 238 places, 241 transitions, 530 flow. Second operand 3 states and 646 transitions. [2025-03-04 06:57:43,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 233 transitions, 618 flow [2025-03-04 06:57:43,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 233 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:43,949 INFO L231 Difference]: Finished difference. Result has 226 places, 229 transitions, 524 flow [2025-03-04 06:57:43,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=226, PETRI_TRANSITIONS=229} [2025-03-04 06:57:43,952 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -31 predicate places. [2025-03-04 06:57:43,952 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 229 transitions, 524 flow [2025-03-04 06:57:43,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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-03-04 06:57:43,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:43,952 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] [2025-03-04 06:57:43,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:57:43,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:43,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:43,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1997380576, now seen corresponding path program 1 times [2025-03-04 06:57:43,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:43,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44474343] [2025-03-04 06:57:43,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:43,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:57:43,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:57:43,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:43,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44474343] [2025-03-04 06:57:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44474343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:43,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:43,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:43,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888151088] [2025-03-04 06:57:43,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:43,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:43,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:43,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:44,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 270 [2025-03-04 06:57:44,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 229 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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-03-04 06:57:44,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:44,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 270 [2025-03-04 06:57:44,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:44,652 INFO L124 PetriNetUnfolderBase]: 630/4749 cut-off events. [2025-03-04 06:57:44,652 INFO L125 PetriNetUnfolderBase]: For 775/817 co-relation queries the response was YES. [2025-03-04 06:57:44,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6431 conditions, 4749 events. 630/4749 cut-off events. For 775/817 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 39508 event pairs, 228 based on Foata normal form. 42/4288 useless extension candidates. Maximal degree in co-relation 4117. Up to 682 conditions per place. [2025-03-04 06:57:44,701 INFO L140 encePairwiseOnDemand]: 258/270 looper letters, 37 selfloop transitions, 8 changer transitions 0/245 dead transitions. [2025-03-04 06:57:44,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 245 transitions, 670 flow [2025-03-04 06:57:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-03-04 06:57:44,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8938271604938272 [2025-03-04 06:57:44,704 INFO L175 Difference]: Start difference. First operand has 226 places, 229 transitions, 524 flow. Second operand 3 states and 724 transitions. [2025-03-04 06:57:44,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 245 transitions, 670 flow [2025-03-04 06:57:44,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 245 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:44,710 INFO L231 Difference]: Finished difference. Result has 227 places, 233 transitions, 550 flow [2025-03-04 06:57:44,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=227, PETRI_TRANSITIONS=233} [2025-03-04 06:57:44,711 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -30 predicate places. [2025-03-04 06:57:44,711 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 233 transitions, 550 flow [2025-03-04 06:57:44,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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-03-04 06:57:44,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:44,712 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] [2025-03-04 06:57:44,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:57:44,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:44,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:44,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1784782704, now seen corresponding path program 1 times [2025-03-04 06:57:44,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:44,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453445260] [2025-03-04 06:57:44,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:44,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:57:44,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:57:44,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:44,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:44,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:44,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453445260] [2025-03-04 06:57:44,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453445260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:44,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:44,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:44,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335293938] [2025-03-04 06:57:44,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:44,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:44,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:44,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:44,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:45,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 270 [2025-03-04 06:57:45,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 233 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 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-03-04 06:57:45,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:45,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 270 [2025-03-04 06:57:45,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:46,020 INFO L124 PetriNetUnfolderBase]: 1558/7334 cut-off events. [2025-03-04 06:57:46,021 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2025-03-04 06:57:46,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10976 conditions, 7334 events. 1558/7334 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 61173 event pairs, 74 based on Foata normal form. 0/6827 useless extension candidates. Maximal degree in co-relation 4981. Up to 2728 conditions per place. [2025-03-04 06:57:46,064 INFO L140 encePairwiseOnDemand]: 264/270 looper letters, 62 selfloop transitions, 6 changer transitions 0/248 dead transitions. [2025-03-04 06:57:46,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 248 transitions, 716 flow [2025-03-04 06:57:46,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2025-03-04 06:57:46,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7993827160493827 [2025-03-04 06:57:46,067 INFO L175 Difference]: Start difference. First operand has 227 places, 233 transitions, 550 flow. Second operand 6 states and 1295 transitions. [2025-03-04 06:57:46,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 248 transitions, 716 flow [2025-03-04 06:57:46,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 248 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:46,071 INFO L231 Difference]: Finished difference. Result has 230 places, 232 transitions, 552 flow [2025-03-04 06:57:46,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=230, PETRI_TRANSITIONS=232} [2025-03-04 06:57:46,072 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -27 predicate places. [2025-03-04 06:57:46,072 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 232 transitions, 552 flow [2025-03-04 06:57:46,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 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-03-04 06:57:46,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:46,073 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] [2025-03-04 06:57:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:57:46,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:46,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash -760815395, now seen corresponding path program 1 times [2025-03-04 06:57:46,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:46,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128322151] [2025-03-04 06:57:46,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:46,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:46,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:57:46,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:57:46,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:46,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:46,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128322151] [2025-03-04 06:57:46,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128322151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:46,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:46,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83918319] [2025-03-04 06:57:46,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:46,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:46,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:46,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:46,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:46,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-03-04 06:57:46,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 232 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:46,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:46,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-03-04 06:57:46,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:46,902 INFO L124 PetriNetUnfolderBase]: 1177/6824 cut-off events. [2025-03-04 06:57:46,902 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2025-03-04 06:57:46,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 6824 events. 1177/6824 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 58412 event pairs, 990 based on Foata normal form. 0/6258 useless extension candidates. Maximal degree in co-relation 4313. Up to 2049 conditions per place. [2025-03-04 06:57:46,939 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 43 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2025-03-04 06:57:46,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 235 transitions, 648 flow [2025-03-04 06:57:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-03-04 06:57:46,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419753086419753 [2025-03-04 06:57:46,941 INFO L175 Difference]: Start difference. First operand has 230 places, 232 transitions, 552 flow. Second operand 3 states and 682 transitions. [2025-03-04 06:57:46,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 235 transitions, 648 flow [2025-03-04 06:57:46,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 235 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:46,945 INFO L231 Difference]: Finished difference. Result has 226 places, 231 transitions, 542 flow [2025-03-04 06:57:46,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=226, PETRI_TRANSITIONS=231} [2025-03-04 06:57:46,946 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -31 predicate places. [2025-03-04 06:57:46,946 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 231 transitions, 542 flow [2025-03-04 06:57:46,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:46,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:46,946 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:46,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:57:46,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:46,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:46,947 INFO L85 PathProgramCache]: Analyzing trace with hash 212861566, now seen corresponding path program 1 times [2025-03-04 06:57:46,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:46,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814704855] [2025-03-04 06:57:46,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:46,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:46,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:57:46,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:57:46,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:46,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:47,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:47,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814704855] [2025-03-04 06:57:47,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814704855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:47,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:47,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:47,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685058724] [2025-03-04 06:57:47,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:47,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:57:47,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:47,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:57:47,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:57:47,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 270 [2025-03-04 06:57:47,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 231 transitions, 542 flow. Second operand has 5 states, 5 states have (on average 220.8) internal successors, (1104), 5 states have internal predecessors, (1104), 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-03-04 06:57:47,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:47,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 270 [2025-03-04 06:57:47,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:47,519 INFO L124 PetriNetUnfolderBase]: 765/5100 cut-off events. [2025-03-04 06:57:47,519 INFO L125 PetriNetUnfolderBase]: For 986/1024 co-relation queries the response was YES. [2025-03-04 06:57:47,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7086 conditions, 5100 events. 765/5100 cut-off events. For 986/1024 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 42278 event pairs, 156 based on Foata normal form. 3/4609 useless extension candidates. Maximal degree in co-relation 5036. Up to 647 conditions per place. [2025-03-04 06:57:47,555 INFO L140 encePairwiseOnDemand]: 257/270 looper letters, 48 selfloop transitions, 15 changer transitions 0/255 dead transitions. [2025-03-04 06:57:47,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 255 transitions, 740 flow [2025-03-04 06:57:47,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1378 transitions. [2025-03-04 06:57:47,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8506172839506173 [2025-03-04 06:57:47,558 INFO L175 Difference]: Start difference. First operand has 226 places, 231 transitions, 542 flow. Second operand 6 states and 1378 transitions. [2025-03-04 06:57:47,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 255 transitions, 740 flow [2025-03-04 06:57:47,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 255 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:47,563 INFO L231 Difference]: Finished difference. Result has 233 places, 235 transitions, 614 flow [2025-03-04 06:57:47,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=233, PETRI_TRANSITIONS=235} [2025-03-04 06:57:47,563 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-03-04 06:57:47,563 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 235 transitions, 614 flow [2025-03-04 06:57:47,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 220.8) internal successors, (1104), 5 states have internal predecessors, (1104), 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-03-04 06:57:47,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:47,564 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:47,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:57:47,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:47,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:47,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2122724067, now seen corresponding path program 1 times [2025-03-04 06:57:47,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:47,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789955574] [2025-03-04 06:57:47,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:47,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:47,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:57:47,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:57:47,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:47,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:47,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:47,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789955574] [2025-03-04 06:57:47,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789955574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:47,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:47,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:47,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559120703] [2025-03-04 06:57:47,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:47,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:47,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:47,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:47,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-03-04 06:57:47,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 235 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-03-04 06:57:47,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:47,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-03-04 06:57:47,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:48,505 INFO L124 PetriNetUnfolderBase]: 1105/6273 cut-off events. [2025-03-04 06:57:48,505 INFO L125 PetriNetUnfolderBase]: For 1132/1132 co-relation queries the response was YES. [2025-03-04 06:57:48,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9376 conditions, 6273 events. 1105/6273 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 52764 event pairs, 944 based on Foata normal form. 0/5756 useless extension candidates. Maximal degree in co-relation 5170. Up to 1922 conditions per place. [2025-03-04 06:57:48,585 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 43 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-03-04 06:57:48,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 238 transitions, 710 flow [2025-03-04 06:57:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-03-04 06:57:48,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419753086419753 [2025-03-04 06:57:48,588 INFO L175 Difference]: Start difference. First operand has 233 places, 235 transitions, 614 flow. Second operand 3 states and 682 transitions. [2025-03-04 06:57:48,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 238 transitions, 710 flow [2025-03-04 06:57:48,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 238 transitions, 696 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:48,599 INFO L231 Difference]: Finished difference. Result has 233 places, 234 transitions, 602 flow [2025-03-04 06:57:48,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=233, PETRI_TRANSITIONS=234} [2025-03-04 06:57:48,600 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-03-04 06:57:48,600 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 234 transitions, 602 flow [2025-03-04 06:57:48,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-03-04 06:57:48,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:48,601 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:48,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:57:48,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:48,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 768341464, now seen corresponding path program 1 times [2025-03-04 06:57:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920229731] [2025-03-04 06:57:48,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:48,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:57:48,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:57:48,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:48,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:48,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:57:48,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:57:48,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:57:48,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:48,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:48,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:57:48,665 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:57:48,665 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2025-03-04 06:57:48,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-03-04 06:57:48,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-03-04 06:57:48,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-03-04 06:57:48,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-03-04 06:57:48,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-03-04 06:57:48,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2025-03-04 06:57:48,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-03-04 06:57:48,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-03-04 06:57:48,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-03-04 06:57:48,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-03-04 06:57:48,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-03-04 06:57:48,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-03-04 06:57:48,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-03-04 06:57:48,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-03-04 06:57:48,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-03-04 06:57:48,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-03-04 06:57:48,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:57:48,669 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:48,669 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:57:48,669 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:57:48,714 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-03-04 06:57:48,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 323 transitions, 718 flow [2025-03-04 06:57:49,533 INFO L124 PetriNetUnfolderBase]: 544/5922 cut-off events. [2025-03-04 06:57:49,533 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-03-04 06:57:49,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6358 conditions, 5922 events. 544/5922 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 46453 event pairs, 64 based on Foata normal form. 0/4701 useless extension candidates. Maximal degree in co-relation 3404. Up to 192 conditions per place. [2025-03-04 06:57:49,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 305 places, 323 transitions, 718 flow [2025-03-04 06:57:49,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 323 transitions, 718 flow [2025-03-04 06:57:49,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:49,641 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;@6cc91ec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:49,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 06:57:49,642 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:49,642 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:49,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:49,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:49,642 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] [2025-03-04 06:57:49,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:49,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1770300279, now seen corresponding path program 1 times [2025-03-04 06:57:49,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:49,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816176217] [2025-03-04 06:57:49,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:49,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:49,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:49,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:49,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:49,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:49,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:49,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816176217] [2025-03-04 06:57:49,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816176217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:49,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:49,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067110765] [2025-03-04 06:57:49,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:49,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:49,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:49,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:49,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:49,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2025-03-04 06:57:49,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 323 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-03-04 06:57:49,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:49,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2025-03-04 06:57:49,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:56,436 INFO L124 PetriNetUnfolderBase]: 12815/48824 cut-off events. [2025-03-04 06:57:56,436 INFO L125 PetriNetUnfolderBase]: For 7844/8390 co-relation queries the response was YES. [2025-03-04 06:57:56,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70847 conditions, 48824 events. 12815/48824 cut-off events. For 7844/8390 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 564068 event pairs, 10886 based on Foata normal form. 9883/50640 useless extension candidates. Maximal degree in co-relation 36613. Up to 19303 conditions per place. [2025-03-04 06:57:57,284 INFO L140 encePairwiseOnDemand]: 307/323 looper letters, 47 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-04 06:57:57,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 282 transitions, 734 flow [2025-03-04 06:57:57,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-03-04 06:57:57,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2025-03-04 06:57:57,286 INFO L175 Difference]: Start difference. First operand has 305 places, 323 transitions, 718 flow. Second operand 3 states and 816 transitions. [2025-03-04 06:57:57,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 282 transitions, 734 flow [2025-03-04 06:57:57,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 282 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:57,295 INFO L231 Difference]: Finished difference. Result has 276 places, 282 transitions, 640 flow [2025-03-04 06:57:57,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=276, PETRI_TRANSITIONS=282} [2025-03-04 06:57:57,296 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -29 predicate places. [2025-03-04 06:57:57,296 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 282 transitions, 640 flow [2025-03-04 06:57:57,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-03-04 06:57:57,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:57,296 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] [2025-03-04 06:57:57,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:57:57,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:57,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1111265988, now seen corresponding path program 1 times [2025-03-04 06:57:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:57,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731928131] [2025-03-04 06:57:57,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:57,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:57,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:57,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:57,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731928131] [2025-03-04 06:57:57,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731928131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:57,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:57,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289223467] [2025-03-04 06:57:57,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:57,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:57,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:57,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:57,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:57,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 323 [2025-03-04 06:57:57,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 282 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-03-04 06:57:57,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:57,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 323 [2025-03-04 06:57:57,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:05,332 INFO L124 PetriNetUnfolderBase]: 17515/54343 cut-off events. [2025-03-04 06:58:05,332 INFO L125 PetriNetUnfolderBase]: For 7819/8267 co-relation queries the response was YES. [2025-03-04 06:58:05,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83910 conditions, 54343 events. 17515/54343 cut-off events. For 7819/8267 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 587120 event pairs, 12762 based on Foata normal form. 0/49193 useless extension candidates. Maximal degree in co-relation 83877. Up to 22195 conditions per place. [2025-03-04 06:58:06,067 INFO L140 encePairwiseOnDemand]: 300/323 looper letters, 51 selfloop transitions, 11 changer transitions 0/276 dead transitions. [2025-03-04 06:58:06,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 276 transitions, 752 flow [2025-03-04 06:58:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-03-04 06:58:06,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7977296181630547 [2025-03-04 06:58:06,069 INFO L175 Difference]: Start difference. First operand has 276 places, 282 transitions, 640 flow. Second operand 3 states and 773 transitions. [2025-03-04 06:58:06,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 276 transitions, 752 flow [2025-03-04 06:58:06,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 276 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:06,082 INFO L231 Difference]: Finished difference. Result has 264 places, 270 transitions, 634 flow [2025-03-04 06:58:06,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=264, PETRI_TRANSITIONS=270} [2025-03-04 06:58:06,082 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -41 predicate places. [2025-03-04 06:58:06,082 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 270 transitions, 634 flow [2025-03-04 06:58:06,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-03-04 06:58:06,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:06,083 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] [2025-03-04 06:58:06,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:58:06,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:58:06,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:06,083 INFO L85 PathProgramCache]: Analyzing trace with hash -35359328, now seen corresponding path program 1 times [2025-03-04 06:58:06,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:06,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092433333] [2025-03-04 06:58:06,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:06,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:58:06,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:58:06,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:06,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:06,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:06,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092433333] [2025-03-04 06:58:06,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092433333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:06,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:06,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:58:06,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709344693] [2025-03-04 06:58:06,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:06,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:06,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:06,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:06,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:06,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 323 [2025-03-04 06:58:06,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 270 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-04 06:58:06,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:06,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 323 [2025-03-04 06:58:06,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:11,567 INFO L124 PetriNetUnfolderBase]: 8365/37548 cut-off events. [2025-03-04 06:58:11,568 INFO L125 PetriNetUnfolderBase]: For 10422/10976 co-relation queries the response was YES. [2025-03-04 06:58:11,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55379 conditions, 37548 events. 8365/37548 cut-off events. For 10422/10976 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 455032 event pairs, 3344 based on Foata normal form. 300/33580 useless extension candidates. Maximal degree in co-relation 37016. Up to 8245 conditions per place. [2025-03-04 06:58:12,088 INFO L140 encePairwiseOnDemand]: 311/323 looper letters, 51 selfloop transitions, 8 changer transitions 0/292 dead transitions. [2025-03-04 06:58:12,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 292 transitions, 832 flow [2025-03-04 06:58:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-04 06:58:12,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2025-03-04 06:58:12,090 INFO L175 Difference]: Start difference. First operand has 264 places, 270 transitions, 634 flow. Second operand 3 states and 855 transitions. [2025-03-04 06:58:12,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 292 transitions, 832 flow [2025-03-04 06:58:12,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 292 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:12,111 INFO L231 Difference]: Finished difference. Result has 265 places, 274 transitions, 660 flow [2025-03-04 06:58:12,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=265, PETRI_TRANSITIONS=274} [2025-03-04 06:58:12,112 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -40 predicate places. [2025-03-04 06:58:12,112 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 274 transitions, 660 flow [2025-03-04 06:58:12,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-04 06:58:12,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:12,112 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] [2025-03-04 06:58:12,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:58:12,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:58:12,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash -110331247, now seen corresponding path program 1 times [2025-03-04 06:58:12,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:12,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196647196] [2025-03-04 06:58:12,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:12,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:58:12,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:58:12,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:12,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:12,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:12,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196647196] [2025-03-04 06:58:12,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196647196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:12,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:12,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563938507] [2025-03-04 06:58:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:12,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:12,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:12,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:12,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 323 [2025-03-04 06:58:12,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 274 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 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-03-04 06:58:12,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:12,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 323 [2025-03-04 06:58:12,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:21,924 INFO L124 PetriNetUnfolderBase]: 19159/63586 cut-off events. [2025-03-04 06:58:21,924 INFO L125 PetriNetUnfolderBase]: For 9276/9276 co-relation queries the response was YES. [2025-03-04 06:58:22,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100914 conditions, 63586 events. 19159/63586 cut-off events. For 9276/9276 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 733955 event pairs, 801 based on Foata normal form. 0/60077 useless extension candidates. Maximal degree in co-relation 49119. Up to 29355 conditions per place. [2025-03-04 06:58:22,868 INFO L140 encePairwiseOnDemand]: 317/323 looper letters, 78 selfloop transitions, 6 changer transitions 0/297 dead transitions. [2025-03-04 06:58:22,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 297 transitions, 874 flow [2025-03-04 06:58:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1545 transitions. [2025-03-04 06:58:22,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972136222910217 [2025-03-04 06:58:22,871 INFO L175 Difference]: Start difference. First operand has 265 places, 274 transitions, 660 flow. Second operand 6 states and 1545 transitions. [2025-03-04 06:58:22,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 297 transitions, 874 flow [2025-03-04 06:58:22,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 297 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:58:22,881 INFO L231 Difference]: Finished difference. Result has 268 places, 273 transitions, 662 flow [2025-03-04 06:58:22,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=662, PETRI_PLACES=268, PETRI_TRANSITIONS=273} [2025-03-04 06:58:22,882 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -37 predicate places. [2025-03-04 06:58:22,883 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 273 transitions, 662 flow [2025-03-04 06:58:22,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 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-03-04 06:58:22,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:22,883 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] [2025-03-04 06:58:22,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:58:22,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:58:22,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1038071919, now seen corresponding path program 1 times [2025-03-04 06:58:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:22,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516316462] [2025-03-04 06:58:22,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:22,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:58:22,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:58:22,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:22,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:22,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:22,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516316462] [2025-03-04 06:58:22,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516316462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:22,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:22,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:22,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577848542] [2025-03-04 06:58:22,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:22,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:22,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:22,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:22,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:22,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2025-03-04 06:58:22,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 273 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 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-03-04 06:58:22,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:22,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2025-03-04 06:58:22,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand