./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/weaver/popl20-three-array-min.wvr.c -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 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:14:56,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:14:56,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:14:56,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:14:56,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:14:56,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:14:56,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:14:56,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:14:56,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:14:56,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:14:56,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:14:56,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:14:56,356 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:14:56,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:14:56,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:14:56,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:14:56,358 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:14:56,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:14:56,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:14:56,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:56,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:14:56,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:14:56,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:14:56,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:14:56,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:14:56,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:14:56,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:14:56,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:14:56,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:14:56,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:14:56,359 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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-03-17 11:14:56,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:14:56,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:14:56,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:14:56,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:14:56,580 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:14:56,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-17 11:14:57,728 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0782e3079/9c07c2a6aa9640bfb71197f4c1c6bdeb/FLAG317564507 [2025-03-17 11:14:57,966 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:14:57,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-17 11:14:58,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0782e3079/9c07c2a6aa9640bfb71197f4c1c6bdeb/FLAG317564507 [2025-03-17 11:14:58,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0782e3079/9c07c2a6aa9640bfb71197f4c1c6bdeb [2025-03-17 11:14:58,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:14:58,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:14:58,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:58,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:14:58,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:14:58,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb81497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58, skipping insertion in model container [2025-03-17 11:14:58,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:14:58,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:58,442 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:14:58,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:58,483 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:14:58,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58 WrapperNode [2025-03-17 11:14:58,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:58,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:58,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:14:58,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:14:58,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,514 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 338 [2025-03-17 11:14:58,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:58,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:14:58,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:14:58,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:14:58,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:14:58,554 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:14:58,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:14:58,555 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:14:58,555 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (1/1) ... [2025-03-17 11:14:58,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:58,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:14:58,588 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-17 11:14:58,592 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-17 11:14:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:14:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:14:58,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:14:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:14:58,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:14:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:14:58,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:14:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:14:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:14:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:14:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:14:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:14:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:14:58,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:14:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:14:58,610 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:14:58,701 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:14:58,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:14:59,309 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:14:59,309 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:14:59,474 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:14:59,475 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:14:59,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:59 BoogieIcfgContainer [2025-03-17 11:14:59,477 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:14:59,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:14:59,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:14:59,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:14:59,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:14:58" (1/3) ... [2025-03-17 11:14:59,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb34de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:59, skipping insertion in model container [2025-03-17 11:14:59,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:58" (2/3) ... [2025-03-17 11:14:59,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb34de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:59, skipping insertion in model container [2025-03-17 11:14:59,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:59" (3/3) ... [2025-03-17 11:14:59,485 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-03-17 11:14:59,496 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:14:59,498 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 484 locations, 1 initial locations, 6 loop locations, and 55 error locations. [2025-03-17 11:14:59,499 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:14:59,581 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:14:59,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 507 transitions, 1035 flow [2025-03-17 11:14:59,718 INFO L124 PetriNetUnfolderBase]: 24/504 cut-off events. [2025-03-17 11:14:59,721 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:14:59,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 504 events. 24/504 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 658 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 425. Up to 2 conditions per place. [2025-03-17 11:14:59,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 507 transitions, 1035 flow [2025-03-17 11:14:59,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 460 transitions, 938 flow [2025-03-17 11:14:59,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:14:59,745 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;@3b51a683, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:14:59,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2025-03-17 11:14:59,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:14:59,750 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-17 11:14:59,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:14:59,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:59,750 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] [2025-03-17 11:14:59,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:14:59,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:59,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1296788447, now seen corresponding path program 1 times [2025-03-17 11:14:59,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:59,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420683579] [2025-03-17 11:14:59,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:59,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:14:59,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:14:59,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:59,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:59,874 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-17 11:14:59,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:59,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420683579] [2025-03-17 11:14:59,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420683579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:59,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:59,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:59,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301741436] [2025-03-17 11:14:59,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:59,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:59,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:59,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:59,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 507 [2025-03-17 11:14:59,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 460 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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-17 11:14:59,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:59,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 507 [2025-03-17 11:14:59,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:00,230 INFO L124 PetriNetUnfolderBase]: 101/1214 cut-off events. [2025-03-17 11:15:00,231 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 11:15:00,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1214 events. 101/1214 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6544 event pairs, 51 based on Foata normal form. 9/1015 useless extension candidates. Maximal degree in co-relation 955. Up to 135 conditions per place. [2025-03-17 11:15:00,245 INFO L140 encePairwiseOnDemand]: 478/507 looper letters, 19 selfloop transitions, 2 changer transitions 9/433 dead transitions. [2025-03-17 11:15:00,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 926 flow [2025-03-17 11:15:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1410 transitions. [2025-03-17 11:15:00,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9270216962524654 [2025-03-17 11:15:00,264 INFO L175 Difference]: Start difference. First operand has 449 places, 460 transitions, 938 flow. Second operand 3 states and 1410 transitions. [2025-03-17 11:15:00,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 926 flow [2025-03-17 11:15:00,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 433 transitions, 914 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:15:00,280 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 858 flow [2025-03-17 11:15:00,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2025-03-17 11:15:00,285 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -19 predicate places. [2025-03-17 11:15:00,286 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 858 flow [2025-03-17 11:15:00,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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-17 11:15:00,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:00,287 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] [2025-03-17 11:15:00,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:15:00,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:00,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1636113030, now seen corresponding path program 1 times [2025-03-17 11:15:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:00,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851227944] [2025-03-17 11:15:00,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:00,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:15:00,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:15:00,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:00,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:00,345 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-17 11:15:00,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:00,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851227944] [2025-03-17 11:15:00,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851227944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:00,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:00,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:00,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73674732] [2025-03-17 11:15:00,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:00,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:00,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:00,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:00,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 507 [2025-03-17 11:15:00,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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-17 11:15:00,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:00,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 507 [2025-03-17 11:15:00,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:00,549 INFO L124 PetriNetUnfolderBase]: 223/1237 cut-off events. [2025-03-17 11:15:00,549 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-17 11:15:00,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1237 events. 223/1237 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6596 event pairs, 128 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1525. Up to 299 conditions per place. [2025-03-17 11:15:00,560 INFO L140 encePairwiseOnDemand]: 499/507 looper letters, 23 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2025-03-17 11:15:00,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 417 transitions, 892 flow [2025-03-17 11:15:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1369 transitions. [2025-03-17 11:15:00,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9000657462195923 [2025-03-17 11:15:00,565 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 858 flow. Second operand 3 states and 1369 transitions. [2025-03-17 11:15:00,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 417 transitions, 892 flow [2025-03-17 11:15:00,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 417 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:00,572 INFO L231 Difference]: Finished difference. Result has 414 places, 417 transitions, 842 flow [2025-03-17 11:15:00,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=414, PETRI_TRANSITIONS=417} [2025-03-17 11:15:00,573 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -35 predicate places. [2025-03-17 11:15:00,573 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 417 transitions, 842 flow [2025-03-17 11:15:00,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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-17 11:15:00,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:00,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:00,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:15:00,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:00,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1921548600, now seen corresponding path program 1 times [2025-03-17 11:15:00,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:00,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771302872] [2025-03-17 11:15:00,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:00,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:00,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 11:15:00,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 11:15:00,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:00,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:01,096 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-17 11:15:01,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771302872] [2025-03-17 11:15:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771302872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:01,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:01,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:01,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75961433] [2025-03-17 11:15:01,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:01,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:01,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:01,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:01,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:01,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 507 [2025-03-17 11:15:01,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 417 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 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-17 11:15:01,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:01,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 507 [2025-03-17 11:15:01,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:01,652 INFO L124 PetriNetUnfolderBase]: 236/1331 cut-off events. [2025-03-17 11:15:01,652 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-17 11:15:01,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 1331 events. 236/1331 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7797 event pairs, 188 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 1775. Up to 406 conditions per place. [2025-03-17 11:15:01,662 INFO L140 encePairwiseOnDemand]: 489/507 looper letters, 65 selfloop transitions, 15 changer transitions 0/414 dead transitions. [2025-03-17 11:15:01,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 414 transitions, 996 flow [2025-03-17 11:15:01,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2025-03-17 11:15:01,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8044049967126891 [2025-03-17 11:15:01,668 INFO L175 Difference]: Start difference. First operand has 414 places, 417 transitions, 842 flow. Second operand 6 states and 2447 transitions. [2025-03-17 11:15:01,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 414 transitions, 996 flow [2025-03-17 11:15:01,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 414 transitions, 995 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:01,674 INFO L231 Difference]: Finished difference. Result has 415 places, 414 transitions, 865 flow [2025-03-17 11:15:01,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=415, PETRI_TRANSITIONS=414} [2025-03-17 11:15:01,676 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -34 predicate places. [2025-03-17 11:15:01,676 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 414 transitions, 865 flow [2025-03-17 11:15:01,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 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-17 11:15:01,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:01,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:01,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:15:01,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:01,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:01,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1754023645, now seen corresponding path program 1 times [2025-03-17 11:15:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:01,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052013105] [2025-03-17 11:15:01,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:01,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:01,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 11:15:01,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 11:15:01,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:01,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:01,731 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-17 11:15:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052013105] [2025-03-17 11:15:01,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052013105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:01,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:01,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:01,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082930666] [2025-03-17 11:15:01,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:01,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:01,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:01,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 507 [2025-03-17 11:15:01,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 414 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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-17 11:15:01,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:01,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 507 [2025-03-17 11:15:01,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:01,874 INFO L124 PetriNetUnfolderBase]: 55/587 cut-off events. [2025-03-17 11:15:01,874 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:01,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 587 events. 55/587 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1814 event pairs, 34 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 661. Up to 77 conditions per place. [2025-03-17 11:15:01,880 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-17 11:15:01,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 413 transitions, 899 flow [2025-03-17 11:15:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2025-03-17 11:15:01,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9138724523339908 [2025-03-17 11:15:01,884 INFO L175 Difference]: Start difference. First operand has 415 places, 414 transitions, 865 flow. Second operand 3 states and 1390 transitions. [2025-03-17 11:15:01,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 413 transitions, 899 flow [2025-03-17 11:15:01,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 413 transitions, 869 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:15:01,891 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 837 flow [2025-03-17 11:15:01,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2025-03-17 11:15:01,893 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -38 predicate places. [2025-03-17 11:15:01,893 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 837 flow [2025-03-17 11:15:01,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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-17 11:15:01,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:01,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:01,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:15:01,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:01,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:01,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1976915077, now seen corresponding path program 1 times [2025-03-17 11:15:01,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:01,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170821864] [2025-03-17 11:15:01,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:01,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 11:15:01,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 11:15:01,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:01,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:01,963 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-17 11:15:01,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170821864] [2025-03-17 11:15:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170821864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:01,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:01,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274787731] [2025-03-17 11:15:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:01,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:01,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:01,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:01,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 507 [2025-03-17 11:15:01,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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-17 11:15:01,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:01,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 507 [2025-03-17 11:15:01,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:02,110 INFO L124 PetriNetUnfolderBase]: 55/586 cut-off events. [2025-03-17 11:15:02,110 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:02,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 586 events. 55/586 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1712 event pairs, 34 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 647. Up to 77 conditions per place. [2025-03-17 11:15:02,113 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2025-03-17 11:15:02,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 412 transitions, 871 flow [2025-03-17 11:15:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2025-03-17 11:15:02,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9138724523339908 [2025-03-17 11:15:02,117 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 837 flow. Second operand 3 states and 1390 transitions. [2025-03-17 11:15:02,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 412 transitions, 871 flow [2025-03-17 11:15:02,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 412 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:02,124 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 835 flow [2025-03-17 11:15:02,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=835, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2025-03-17 11:15:02,125 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -39 predicate places. [2025-03-17 11:15:02,125 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 835 flow [2025-03-17 11:15:02,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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-17 11:15:02,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:02,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:02,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:15:02,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:02,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1806350311, now seen corresponding path program 1 times [2025-03-17 11:15:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:02,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186126166] [2025-03-17 11:15:02,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:02,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:02,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 11:15:02,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 11:15:02,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:02,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:02,188 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-17 11:15:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:02,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186126166] [2025-03-17 11:15:02,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186126166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:02,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:02,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:02,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297585331] [2025-03-17 11:15:02,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:02,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:02,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:02,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:02,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:02,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 507 [2025-03-17 11:15:02,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 835 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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-17 11:15:02,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:02,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 507 [2025-03-17 11:15:02,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:02,256 INFO L124 PetriNetUnfolderBase]: 23/449 cut-off events. [2025-03-17 11:15:02,256 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:02,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 449 events. 23/449 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 767 event pairs, 12 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 462. Up to 35 conditions per place. [2025-03-17 11:15:02,259 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 12 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2025-03-17 11:15:02,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 411 transitions, 861 flow [2025-03-17 11:15:02,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-17 11:15:02,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-17 11:15:02,261 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 835 flow. Second operand 3 states and 1398 transitions. [2025-03-17 11:15:02,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 411 transitions, 861 flow [2025-03-17 11:15:02,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 411 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:02,266 INFO L231 Difference]: Finished difference. Result has 409 places, 411 transitions, 833 flow [2025-03-17 11:15:02,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=409, PETRI_TRANSITIONS=411} [2025-03-17 11:15:02,267 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-17 11:15:02,267 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 411 transitions, 833 flow [2025-03-17 11:15:02,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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-17 11:15:02,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:02,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:02,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:15:02,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:02,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2199030, now seen corresponding path program 1 times [2025-03-17 11:15:02,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:02,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664357390] [2025-03-17 11:15:02,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:02,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 11:15:02,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 11:15:02,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:02,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:02,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-17 11:15:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:02,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664357390] [2025-03-17 11:15:02,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664357390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:02,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:02,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120338276] [2025-03-17 11:15:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:02,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:02,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:02,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:02,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:02,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 507 [2025-03-17 11:15:02,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 411 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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-17 11:15:02,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:02,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 507 [2025-03-17 11:15:02,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:02,379 INFO L124 PetriNetUnfolderBase]: 23/448 cut-off events. [2025-03-17 11:15:02,380 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:02,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 448 events. 23/448 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 758 event pairs, 12 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 461. Up to 35 conditions per place. [2025-03-17 11:15:02,382 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 12 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-17 11:15:02,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 859 flow [2025-03-17 11:15:02,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-17 11:15:02,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-17 11:15:02,385 INFO L175 Difference]: Start difference. First operand has 409 places, 411 transitions, 833 flow. Second operand 3 states and 1398 transitions. [2025-03-17 11:15:02,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 859 flow [2025-03-17 11:15:02,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 410 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:02,391 INFO L231 Difference]: Finished difference. Result has 408 places, 410 transitions, 831 flow [2025-03-17 11:15:02,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=408, PETRI_TRANSITIONS=410} [2025-03-17 11:15:02,393 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2025-03-17 11:15:02,394 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 410 transitions, 831 flow [2025-03-17 11:15:02,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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-17 11:15:02,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:02,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:02,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:15:02,395 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:02,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1086062571, now seen corresponding path program 1 times [2025-03-17 11:15:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:02,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154361076] [2025-03-17 11:15:02,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:02,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 11:15:02,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 11:15:02,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:02,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:02,440 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-17 11:15:02,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:02,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154361076] [2025-03-17 11:15:02,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154361076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:02,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:02,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:02,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477828743] [2025-03-17 11:15:02,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:02,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:02,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:02,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:02,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:02,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 507 [2025-03-17 11:15:02,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 410 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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-17 11:15:02,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:02,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 507 [2025-03-17 11:15:02,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:02,570 INFO L124 PetriNetUnfolderBase]: 109/1164 cut-off events. [2025-03-17 11:15:02,571 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2025-03-17 11:15:02,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1164 events. 109/1164 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5675 event pairs, 56 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 1290. Up to 135 conditions per place. [2025-03-17 11:15:02,582 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 17 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2025-03-17 11:15:02,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 859 flow [2025-03-17 11:15:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2025-03-17 11:15:02,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9119000657462196 [2025-03-17 11:15:02,585 INFO L175 Difference]: Start difference. First operand has 408 places, 410 transitions, 831 flow. Second operand 3 states and 1387 transitions. [2025-03-17 11:15:02,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 859 flow [2025-03-17 11:15:02,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 406 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:02,591 INFO L231 Difference]: Finished difference. Result has 404 places, 406 transitions, 821 flow [2025-03-17 11:15:02,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=404, PETRI_TRANSITIONS=406} [2025-03-17 11:15:02,593 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2025-03-17 11:15:02,594 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 406 transitions, 821 flow [2025-03-17 11:15:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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-17 11:15:02,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:02,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:02,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:15:02,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:02,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1702663030, now seen corresponding path program 1 times [2025-03-17 11:15:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342476724] [2025-03-17 11:15:02,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:02,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 11:15:02,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 11:15:02,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:02,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:03,005 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-17 11:15:03,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:03,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342476724] [2025-03-17 11:15:03,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342476724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:03,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:03,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889277934] [2025-03-17 11:15:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:03,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:03,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:03,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:03,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:03,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 507 [2025-03-17 11:15:03,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 406 transitions, 821 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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-17 11:15:03,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:03,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 507 [2025-03-17 11:15:03,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:03,514 INFO L124 PetriNetUnfolderBase]: 29/514 cut-off events. [2025-03-17 11:15:03,514 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:15:03,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 514 events. 29/514 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1130 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 558. Up to 43 conditions per place. [2025-03-17 11:15:03,517 INFO L140 encePairwiseOnDemand]: 500/507 looper letters, 35 selfloop transitions, 5 changer transitions 0/411 dead transitions. [2025-03-17 11:15:03,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 915 flow [2025-03-17 11:15:03,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2025-03-17 11:15:03,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856015779092702 [2025-03-17 11:15:03,522 INFO L175 Difference]: Start difference. First operand has 404 places, 406 transitions, 821 flow. Second operand 6 states and 2694 transitions. [2025-03-17 11:15:03,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 915 flow [2025-03-17 11:15:03,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 411 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:03,529 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 832 flow [2025-03-17 11:15:03,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=832, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2025-03-17 11:15:03,530 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -42 predicate places. [2025-03-17 11:15:03,530 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 832 flow [2025-03-17 11:15:03,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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-17 11:15:03,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:03,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:03,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:15:03,532 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:03,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:03,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1666423821, now seen corresponding path program 1 times [2025-03-17 11:15:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:03,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57543081] [2025-03-17 11:15:03,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:03,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 11:15:03,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 11:15:03,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:03,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:03,575 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-17 11:15:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:03,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57543081] [2025-03-17 11:15:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57543081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574793959] [2025-03-17 11:15:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:03,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:03,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:03,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:03,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 507 [2025-03-17 11:15:03,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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-17 11:15:03,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:03,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 507 [2025-03-17 11:15:03,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:03,670 INFO L124 PetriNetUnfolderBase]: 69/627 cut-off events. [2025-03-17 11:15:03,671 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-17 11:15:03,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 627 events. 69/627 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1992 event pairs, 36 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 757. Up to 98 conditions per place. [2025-03-17 11:15:03,674 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2025-03-17 11:15:03,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 866 flow [2025-03-17 11:15:03,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2025-03-17 11:15:03,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9151873767258383 [2025-03-17 11:15:03,677 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 832 flow. Second operand 3 states and 1392 transitions. [2025-03-17 11:15:03,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 866 flow [2025-03-17 11:15:03,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 404 transitions, 858 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:15:03,682 INFO L231 Difference]: Finished difference. Result has 404 places, 404 transitions, 826 flow [2025-03-17 11:15:03,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=404, PETRI_TRANSITIONS=404} [2025-03-17 11:15:03,684 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2025-03-17 11:15:03,684 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 404 transitions, 826 flow [2025-03-17 11:15:03,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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-17 11:15:03,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:03,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:03,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:15:03,685 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:03,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:03,686 INFO L85 PathProgramCache]: Analyzing trace with hash -386255007, now seen corresponding path program 1 times [2025-03-17 11:15:03,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:03,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148481202] [2025-03-17 11:15:03,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:03,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:03,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 11:15:03,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 11:15:03,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:03,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:03,723 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-17 11:15:03,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148481202] [2025-03-17 11:15:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148481202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:03,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:03,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:03,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239875212] [2025-03-17 11:15:03,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:03,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:03,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:03,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:03,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:03,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 507 [2025-03-17 11:15:03,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 404 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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-17 11:15:03,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:03,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 507 [2025-03-17 11:15:03,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:03,870 INFO L124 PetriNetUnfolderBase]: 125/1187 cut-off events. [2025-03-17 11:15:03,870 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 11:15:03,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 1187 events. 125/1187 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5869 event pairs, 58 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 1384. Up to 158 conditions per place. [2025-03-17 11:15:03,880 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 18 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2025-03-17 11:15:03,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 400 transitions, 856 flow [2025-03-17 11:15:03,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2025-03-17 11:15:03,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9119000657462196 [2025-03-17 11:15:03,883 INFO L175 Difference]: Start difference. First operand has 404 places, 404 transitions, 826 flow. Second operand 3 states and 1387 transitions. [2025-03-17 11:15:03,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 400 transitions, 856 flow [2025-03-17 11:15:03,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:03,887 INFO L231 Difference]: Finished difference. Result has 400 places, 400 transitions, 816 flow [2025-03-17 11:15:03,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=400, PETRI_TRANSITIONS=400} [2025-03-17 11:15:03,888 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -49 predicate places. [2025-03-17 11:15:03,888 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 400 transitions, 816 flow [2025-03-17 11:15:03,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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-17 11:15:03,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:03,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:03,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:15:03,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:03,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:03,890 INFO L85 PathProgramCache]: Analyzing trace with hash -664076855, now seen corresponding path program 1 times [2025-03-17 11:15:03,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:03,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538477863] [2025-03-17 11:15:03,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:03,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:03,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 11:15:03,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 11:15:03,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:03,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:04,295 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-17 11:15:04,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:04,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538477863] [2025-03-17 11:15:04,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538477863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:04,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:04,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:04,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813813781] [2025-03-17 11:15:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:04,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:04,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:04,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:04,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:04,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 507 [2025-03-17 11:15:04,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 400 transitions, 816 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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-17 11:15:04,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:04,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 507 [2025-03-17 11:15:04,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:04,797 INFO L124 PetriNetUnfolderBase]: 29/507 cut-off events. [2025-03-17 11:15:04,797 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 11:15:04,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 507 events. 29/507 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1122 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2025-03-17 11:15:04,799 INFO L140 encePairwiseOnDemand]: 500/507 looper letters, 35 selfloop transitions, 5 changer transitions 0/404 dead transitions. [2025-03-17 11:15:04,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 404 transitions, 908 flow [2025-03-17 11:15:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2025-03-17 11:15:04,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856015779092702 [2025-03-17 11:15:04,803 INFO L175 Difference]: Start difference. First operand has 400 places, 400 transitions, 816 flow. Second operand 6 states and 2694 transitions. [2025-03-17 11:15:04,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 404 transitions, 908 flow [2025-03-17 11:15:04,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 404 transitions, 907 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:04,808 INFO L231 Difference]: Finished difference. Result has 402 places, 398 transitions, 821 flow [2025-03-17 11:15:04,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=402, PETRI_TRANSITIONS=398} [2025-03-17 11:15:04,810 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -47 predicate places. [2025-03-17 11:15:04,810 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 398 transitions, 821 flow [2025-03-17 11:15:04,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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-17 11:15:04,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:04,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:04,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:15:04,812 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:04,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1929303371, now seen corresponding path program 1 times [2025-03-17 11:15:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359172165] [2025-03-17 11:15:04,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:04,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 11:15:04,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:15:04,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:04,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:04,856 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-17 11:15:04,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:04,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359172165] [2025-03-17 11:15:04,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359172165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:04,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:04,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:04,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366792202] [2025-03-17 11:15:04,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:04,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:04,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:04,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:04,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:04,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 507 [2025-03-17 11:15:04,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 398 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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-17 11:15:04,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:04,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 507 [2025-03-17 11:15:04,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:04,960 INFO L124 PetriNetUnfolderBase]: 69/620 cut-off events. [2025-03-17 11:15:04,960 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-17 11:15:04,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 620 events. 69/620 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1917 event pairs, 36 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 752. Up to 98 conditions per place. [2025-03-17 11:15:04,964 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2025-03-17 11:15:04,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 397 transitions, 855 flow [2025-03-17 11:15:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2025-03-17 11:15:04,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9151873767258383 [2025-03-17 11:15:04,966 INFO L175 Difference]: Start difference. First operand has 402 places, 398 transitions, 821 flow. Second operand 3 states and 1392 transitions. [2025-03-17 11:15:04,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 397 transitions, 855 flow [2025-03-17 11:15:04,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 397 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:15:04,971 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 813 flow [2025-03-17 11:15:04,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2025-03-17 11:15:04,972 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -51 predicate places. [2025-03-17 11:15:04,972 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 813 flow [2025-03-17 11:15:04,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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-17 11:15:04,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:04,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:04,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:15:04,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:04,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash -566804604, now seen corresponding path program 1 times [2025-03-17 11:15:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:04,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007462258] [2025-03-17 11:15:04,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:04,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:04,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 11:15:04,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 11:15:04,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:04,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:05,028 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-17 11:15:05,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:05,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007462258] [2025-03-17 11:15:05,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007462258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:05,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:05,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:05,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997409233] [2025-03-17 11:15:05,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:05,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:05,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:05,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:05,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:05,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-17 11:15:05,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-17 11:15:05,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:05,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-17 11:15:05,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:05,110 INFO L124 PetriNetUnfolderBase]: 31/461 cut-off events. [2025-03-17 11:15:05,111 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 11:15:05,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 461 events. 31/461 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 847 event pairs, 14 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 506. Up to 50 conditions per place. [2025-03-17 11:15:05,113 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 14 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2025-03-17 11:15:05,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 396 transitions, 843 flow [2025-03-17 11:15:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-03-17 11:15:05,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178172255095332 [2025-03-17 11:15:05,115 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 813 flow. Second operand 3 states and 1396 transitions. [2025-03-17 11:15:05,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 396 transitions, 843 flow [2025-03-17 11:15:05,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:05,120 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 811 flow [2025-03-17 11:15:05,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2025-03-17 11:15:05,121 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -52 predicate places. [2025-03-17 11:15:05,121 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 811 flow [2025-03-17 11:15:05,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-17 11:15:05,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:05,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:05,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:15:05,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:05,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash -256016763, now seen corresponding path program 1 times [2025-03-17 11:15:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:05,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267151860] [2025-03-17 11:15:05,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:05,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 11:15:05,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 11:15:05,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:05,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:05,177 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-17 11:15:05,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:05,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267151860] [2025-03-17 11:15:05,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267151860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:05,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:05,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:05,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478298435] [2025-03-17 11:15:05,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:05,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:05,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:05,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:05,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-17 11:15:05,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-17 11:15:05,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:05,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-17 11:15:05,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:05,366 INFO L124 PetriNetUnfolderBase]: 113/1198 cut-off events. [2025-03-17 11:15:05,366 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-17 11:15:05,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1198 events. 113/1198 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6563 event pairs, 25 based on Foata normal form. 0/1089 useless extension candidates. Maximal degree in co-relation 1392. Up to 91 conditions per place. [2025-03-17 11:15:05,371 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 24 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2025-03-17 11:15:05,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 405 transitions, 892 flow [2025-03-17 11:15:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2025-03-17 11:15:05,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9250493096646942 [2025-03-17 11:15:05,374 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 811 flow. Second operand 3 states and 1407 transitions. [2025-03-17 11:15:05,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 405 transitions, 892 flow [2025-03-17 11:15:05,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 405 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:05,378 INFO L231 Difference]: Finished difference. Result has 396 places, 396 transitions, 820 flow [2025-03-17 11:15:05,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=396, PETRI_TRANSITIONS=396} [2025-03-17 11:15:05,379 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -53 predicate places. [2025-03-17 11:15:05,379 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 396 transitions, 820 flow [2025-03-17 11:15:05,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-17 11:15:05,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:05,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:05,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:15:05,380 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:05,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:05,381 INFO L85 PathProgramCache]: Analyzing trace with hash -433590423, now seen corresponding path program 1 times [2025-03-17 11:15:05,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:05,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643153690] [2025-03-17 11:15:05,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:05,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 11:15:05,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 11:15:05,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:05,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:05,561 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-17 11:15:05,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:05,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643153690] [2025-03-17 11:15:05,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643153690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:05,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:05,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855433889] [2025-03-17 11:15:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:05,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:05,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:05,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:05,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 507 [2025-03-17 11:15:05,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 396 transitions, 820 flow. Second operand has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 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-17 11:15:05,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:05,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 507 [2025-03-17 11:15:05,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:06,368 INFO L124 PetriNetUnfolderBase]: 256/1901 cut-off events. [2025-03-17 11:15:06,369 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-17 11:15:06,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 1901 events. 256/1901 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9789 event pairs, 122 based on Foata normal form. 9/1758 useless extension candidates. Maximal degree in co-relation 2446. Up to 245 conditions per place. [2025-03-17 11:15:06,378 INFO L140 encePairwiseOnDemand]: 478/507 looper letters, 52 selfloop transitions, 42 changer transitions 0/447 dead transitions. [2025-03-17 11:15:06,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 447 transitions, 1126 flow [2025-03-17 11:15:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:15:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:15:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4442 transitions. [2025-03-17 11:15:06,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761341222879684 [2025-03-17 11:15:06,388 INFO L175 Difference]: Start difference. First operand has 396 places, 396 transitions, 820 flow. Second operand 10 states and 4442 transitions. [2025-03-17 11:15:06,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 447 transitions, 1126 flow [2025-03-17 11:15:06,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 447 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:06,394 INFO L231 Difference]: Finished difference. Result has 408 places, 421 transitions, 1009 flow [2025-03-17 11:15:06,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1009, PETRI_PLACES=408, PETRI_TRANSITIONS=421} [2025-03-17 11:15:06,394 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2025-03-17 11:15:06,395 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 421 transitions, 1009 flow [2025-03-17 11:15:06,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 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-17 11:15:06,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:06,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:06,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:15:06,396 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:06,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1751062634, now seen corresponding path program 1 times [2025-03-17 11:15:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:06,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115074697] [2025-03-17 11:15:06,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:06,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-17 11:15:06,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-17 11:15:06,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:06,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:06,458 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-17 11:15:06,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:06,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115074697] [2025-03-17 11:15:06,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115074697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:06,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:06,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:06,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486658429] [2025-03-17 11:15:06,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:06,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:06,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:06,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:06,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 507 [2025-03-17 11:15:06,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 421 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 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-17 11:15:06,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:06,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 507 [2025-03-17 11:15:06,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:06,599 INFO L124 PetriNetUnfolderBase]: 87/956 cut-off events. [2025-03-17 11:15:06,599 INFO L125 PetriNetUnfolderBase]: For 68/80 co-relation queries the response was YES. [2025-03-17 11:15:06,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 956 events. 87/956 cut-off events. For 68/80 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2746 event pairs, 39 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1202. Up to 125 conditions per place. [2025-03-17 11:15:06,604 INFO L140 encePairwiseOnDemand]: 505/507 looper letters, 12 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2025-03-17 11:15:06,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 420 transitions, 1033 flow [2025-03-17 11:15:06,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1405 transitions. [2025-03-17 11:15:06,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9237343852728468 [2025-03-17 11:15:06,607 INFO L175 Difference]: Start difference. First operand has 408 places, 421 transitions, 1009 flow. Second operand 3 states and 1405 transitions. [2025-03-17 11:15:06,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 420 transitions, 1033 flow [2025-03-17 11:15:06,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 420 transitions, 1033 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:06,614 INFO L231 Difference]: Finished difference. Result has 409 places, 420 transitions, 1009 flow [2025-03-17 11:15:06,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1009, PETRI_PLACES=409, PETRI_TRANSITIONS=420} [2025-03-17 11:15:06,615 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-17 11:15:06,615 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 420 transitions, 1009 flow [2025-03-17 11:15:06,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 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-17 11:15:06,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:06,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:06,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:15:06,616 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:06,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:06,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1821475570, now seen corresponding path program 1 times [2025-03-17 11:15:06,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:06,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147793024] [2025-03-17 11:15:06,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:06,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:06,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 11:15:06,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 11:15:06,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:06,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:06,672 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-17 11:15:06,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147793024] [2025-03-17 11:15:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147793024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:06,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:06,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204031593] [2025-03-17 11:15:06,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:06,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:06,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:06,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:06,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-17 11:15:06,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 420 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 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-17 11:15:06,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:06,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-17 11:15:06,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:07,021 INFO L124 PetriNetUnfolderBase]: 238/2127 cut-off events. [2025-03-17 11:15:07,022 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-03-17 11:15:07,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 2127 events. 238/2127 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12953 event pairs, 61 based on Foata normal form. 4/1994 useless extension candidates. Maximal degree in co-relation 2737. Up to 176 conditions per place. [2025-03-17 11:15:07,033 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 20 selfloop transitions, 2 changer transitions 31/429 dead transitions. [2025-03-17 11:15:07,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 429 transitions, 1088 flow [2025-03-17 11:15:07,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1406 transitions. [2025-03-17 11:15:07,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243918474687706 [2025-03-17 11:15:07,036 INFO L175 Difference]: Start difference. First operand has 409 places, 420 transitions, 1009 flow. Second operand 3 states and 1406 transitions. [2025-03-17 11:15:07,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 429 transitions, 1088 flow [2025-03-17 11:15:07,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 429 transitions, 1087 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:07,043 INFO L231 Difference]: Finished difference. Result has 409 places, 390 transitions, 884 flow [2025-03-17 11:15:07,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=409, PETRI_TRANSITIONS=390} [2025-03-17 11:15:07,044 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-17 11:15:07,044 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 390 transitions, 884 flow [2025-03-17 11:15:07,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 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-17 11:15:07,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:07,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:07,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:15:07,045 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:07,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1555624585, now seen corresponding path program 1 times [2025-03-17 11:15:07,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:07,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161360977] [2025-03-17 11:15:07,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:07,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-17 11:15:07,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-17 11:15:07,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:07,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:15:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:07,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161360977] [2025-03-17 11:15:07,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161360977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:15:07,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581908231] [2025-03-17 11:15:07,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:07,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:07,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:07,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:15:07,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:15:07,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-17 11:15:07,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-17 11:15:07,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:07,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:07,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:15:07,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:15:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:15:07,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:15:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:15:08,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581908231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:15:08,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:15:08,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-17 11:15:08,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031547260] [2025-03-17 11:15:08,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:15:08,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:15:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:08,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:15:08,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:15:09,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 507 [2025-03-17 11:15:09,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 390 transitions, 884 flow. Second operand has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 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-17 11:15:09,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:09,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 507 [2025-03-17 11:15:09,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:10,052 INFO L124 PetriNetUnfolderBase]: 491/2909 cut-off events. [2025-03-17 11:15:10,052 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2025-03-17 11:15:10,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4208 conditions, 2909 events. 491/2909 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18087 event pairs, 201 based on Foata normal form. 9/2686 useless extension candidates. Maximal degree in co-relation 4164. Up to 437 conditions per place. [2025-03-17 11:15:10,064 INFO L140 encePairwiseOnDemand]: 468/507 looper letters, 34 selfloop transitions, 36 changer transitions 77/480 dead transitions. [2025-03-17 11:15:10,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 480 transitions, 1461 flow [2025-03-17 11:15:10,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:15:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 11:15:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 8217 transitions. [2025-03-17 11:15:10,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530052943008408 [2025-03-17 11:15:10,072 INFO L175 Difference]: Start difference. First operand has 409 places, 390 transitions, 884 flow. Second operand 19 states and 8217 transitions. [2025-03-17 11:15:10,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 480 transitions, 1461 flow [2025-03-17 11:15:10,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 480 transitions, 1357 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-03-17 11:15:10,079 INFO L231 Difference]: Finished difference. Result has 418 places, 397 transitions, 1004 flow [2025-03-17 11:15:10,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1004, PETRI_PLACES=418, PETRI_TRANSITIONS=397} [2025-03-17 11:15:10,080 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -31 predicate places. [2025-03-17 11:15:10,080 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 397 transitions, 1004 flow [2025-03-17 11:15:10,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 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-17 11:15:10,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:10,082 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:10,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:15:10,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:10,287 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:10,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1241593897, now seen corresponding path program 2 times [2025-03-17 11:15:10,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:10,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111165234] [2025-03-17 11:15:10,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:15:10,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:10,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 325 statements into 2 equivalence classes. [2025-03-17 11:15:10,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 235 of 325 statements. [2025-03-17 11:15:10,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:15:10,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:15:10,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111165234] [2025-03-17 11:15:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111165234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206055918] [2025-03-17 11:15:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:10,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:10,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:10,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:10,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 507 [2025-03-17 11:15:10,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 397 transitions, 1004 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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-17 11:15:10,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:10,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 507 [2025-03-17 11:15:10,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:11,709 INFO L124 PetriNetUnfolderBase]: 653/3303 cut-off events. [2025-03-17 11:15:11,709 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-03-17 11:15:11,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5006 conditions, 3303 events. 653/3303 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 25114 event pairs, 130 based on Foata normal form. 0/3059 useless extension candidates. Maximal degree in co-relation 4956. Up to 607 conditions per place. [2025-03-17 11:15:11,726 INFO L140 encePairwiseOnDemand]: 493/507 looper letters, 53 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2025-03-17 11:15:11,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 434 transitions, 1246 flow [2025-03-17 11:15:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2025-03-17 11:15:11,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888560157790927 [2025-03-17 11:15:11,730 INFO L175 Difference]: Start difference. First operand has 418 places, 397 transitions, 1004 flow. Second operand 6 states and 2703 transitions. [2025-03-17 11:15:11,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 434 transitions, 1246 flow [2025-03-17 11:15:11,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 434 transitions, 1181 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-03-17 11:15:11,736 INFO L231 Difference]: Finished difference. Result has 405 places, 415 transitions, 1095 flow [2025-03-17 11:15:11,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1095, PETRI_PLACES=405, PETRI_TRANSITIONS=415} [2025-03-17 11:15:11,736 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -44 predicate places. [2025-03-17 11:15:11,737 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 415 transitions, 1095 flow [2025-03-17 11:15:11,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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-17 11:15:11,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:11,737 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:11,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:15:11,738 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:11,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1757133587, now seen corresponding path program 1 times [2025-03-17 11:15:11,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:11,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731282204] [2025-03-17 11:15:11,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:11,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:11,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-17 11:15:11,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-17 11:15:11,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:11,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:15:13,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:13,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731282204] [2025-03-17 11:15:13,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731282204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:13,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:13,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-17 11:15:13,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142258365] [2025-03-17 11:15:13,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:13,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:15:13,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:13,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:15:13,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:15:16,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 507 [2025-03-17 11:15:16,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 415 transitions, 1095 flow. Second operand has 21 states, 21 states have (on average 411.5238095238095) internal successors, (8642), 21 states have internal predecessors, (8642), 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-17 11:15:16,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:16,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 507 [2025-03-17 11:15:16,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:19,042 INFO L124 PetriNetUnfolderBase]: 2406/9519 cut-off events. [2025-03-17 11:15:19,042 INFO L125 PetriNetUnfolderBase]: For 4017/4359 co-relation queries the response was YES. [2025-03-17 11:15:19,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16736 conditions, 9519 events. 2406/9519 cut-off events. For 4017/4359 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 93453 event pairs, 550 based on Foata normal form. 153/8630 useless extension candidates. Maximal degree in co-relation 16688. Up to 2073 conditions per place. [2025-03-17 11:15:19,111 INFO L140 encePairwiseOnDemand]: 471/507 looper letters, 112 selfloop transitions, 49 changer transitions 0/499 dead transitions. [2025-03-17 11:15:19,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 499 transitions, 1802 flow [2025-03-17 11:15:19,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 11:15:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-17 11:15:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 14028 transitions. [2025-03-17 11:15:19,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.813783501566307 [2025-03-17 11:15:19,120 INFO L175 Difference]: Start difference. First operand has 405 places, 415 transitions, 1095 flow. Second operand 34 states and 14028 transitions. [2025-03-17 11:15:19,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 499 transitions, 1802 flow [2025-03-17 11:15:19,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 499 transitions, 1802 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:19,130 INFO L231 Difference]: Finished difference. Result has 444 places, 437 transitions, 1380 flow [2025-03-17 11:15:19,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1380, PETRI_PLACES=444, PETRI_TRANSITIONS=437} [2025-03-17 11:15:19,131 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -5 predicate places. [2025-03-17 11:15:19,131 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 437 transitions, 1380 flow [2025-03-17 11:15:19,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 411.5238095238095) internal successors, (8642), 21 states have internal predecessors, (8642), 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-17 11:15:19,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:19,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:19,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:15:19,133 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 633783437, now seen corresponding path program 2 times [2025-03-17 11:15:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112902431] [2025-03-17 11:15:19,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:15:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:19,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 337 statements into 2 equivalence classes. [2025-03-17 11:15:19,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 247 of 337 statements. [2025-03-17 11:15:19,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:15:19,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:15:20,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:20,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112902431] [2025-03-17 11:15:20,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112902431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:20,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:20,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 11:15:20,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431727351] [2025-03-17 11:15:20,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:20,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:15:20,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:20,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:15:20,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:15:23,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 507 [2025-03-17 11:15:23,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 437 transitions, 1380 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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-17 11:15:23,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:23,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 507 [2025-03-17 11:15:23,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:26,455 INFO L124 PetriNetUnfolderBase]: 2194/12438 cut-off events. [2025-03-17 11:15:26,455 INFO L125 PetriNetUnfolderBase]: For 9530/10099 co-relation queries the response was YES. [2025-03-17 11:15:26,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23019 conditions, 12438 events. 2194/12438 cut-off events. For 9530/10099 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 140179 event pairs, 302 based on Foata normal form. 282/11542 useless extension candidates. Maximal degree in co-relation 22964. Up to 1185 conditions per place. [2025-03-17 11:15:26,537 INFO L140 encePairwiseOnDemand]: 472/507 looper letters, 80 selfloop transitions, 68 changer transitions 0/493 dead transitions. [2025-03-17 11:15:26,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 493 transitions, 2005 flow [2025-03-17 11:15:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 11:15:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-17 11:15:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 13669 transitions. [2025-03-17 11:15:26,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8169864323710477 [2025-03-17 11:15:26,545 INFO L175 Difference]: Start difference. First operand has 444 places, 437 transitions, 1380 flow. Second operand 33 states and 13669 transitions. [2025-03-17 11:15:26,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 493 transitions, 2005 flow [2025-03-17 11:15:26,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 493 transitions, 1952 flow, removed 1 selfloop flow, removed 26 redundant places. [2025-03-17 11:15:26,561 INFO L231 Difference]: Finished difference. Result has 454 places, 463 transitions, 1752 flow [2025-03-17 11:15:26,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1752, PETRI_PLACES=454, PETRI_TRANSITIONS=463} [2025-03-17 11:15:26,562 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 5 predicate places. [2025-03-17 11:15:26,562 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 463 transitions, 1752 flow [2025-03-17 11:15:26,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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-17 11:15:26,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:26,564 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:26,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:15:26,564 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:26,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:26,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1267568777, now seen corresponding path program 1 times [2025-03-17 11:15:26,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:26,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402557618] [2025-03-17 11:15:26,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:26,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:26,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-17 11:15:26,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-17 11:15:26,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:26,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:15:27,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:27,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402557618] [2025-03-17 11:15:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402557618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:27,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:27,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071279744] [2025-03-17 11:15:27,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:27,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:27,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:27,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:27,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 507 [2025-03-17 11:15:27,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 463 transitions, 1752 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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-17 11:15:27,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:27,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 507 [2025-03-17 11:15:27,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:30,956 INFO L124 PetriNetUnfolderBase]: 4296/17342 cut-off events. [2025-03-17 11:15:30,956 INFO L125 PetriNetUnfolderBase]: For 22485/22680 co-relation queries the response was YES. [2025-03-17 11:15:31,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37557 conditions, 17342 events. 4296/17342 cut-off events. For 22485/22680 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 202102 event pairs, 722 based on Foata normal form. 166/16259 useless extension candidates. Maximal degree in co-relation 37500. Up to 2827 conditions per place. [2025-03-17 11:15:31,072 INFO L140 encePairwiseOnDemand]: 493/507 looper letters, 76 selfloop transitions, 32 changer transitions 0/508 dead transitions. [2025-03-17 11:15:31,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 508 transitions, 2187 flow [2025-03-17 11:15:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2025-03-17 11:15:31,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888560157790927 [2025-03-17 11:15:31,074 INFO L175 Difference]: Start difference. First operand has 454 places, 463 transitions, 1752 flow. Second operand 6 states and 2703 transitions. [2025-03-17 11:15:31,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 508 transitions, 2187 flow [2025-03-17 11:15:31,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 508 transitions, 2094 flow, removed 21 selfloop flow, removed 26 redundant places. [2025-03-17 11:15:31,116 INFO L231 Difference]: Finished difference. Result has 438 places, 489 transitions, 1998 flow [2025-03-17 11:15:31,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1998, PETRI_PLACES=438, PETRI_TRANSITIONS=489} [2025-03-17 11:15:31,117 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -11 predicate places. [2025-03-17 11:15:31,117 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 489 transitions, 1998 flow [2025-03-17 11:15:31,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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-17 11:15:31,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:31,118 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:31,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:15:31,118 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:31,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:31,119 INFO L85 PathProgramCache]: Analyzing trace with hash 949118200, now seen corresponding path program 1 times [2025-03-17 11:15:31,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:31,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613474316] [2025-03-17 11:15:31,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:31,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:31,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-17 11:15:31,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-17 11:15:31,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:31,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 11:15:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:31,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613474316] [2025-03-17 11:15:31,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613474316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546349550] [2025-03-17 11:15:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:31,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:31,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:31,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:31,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-17 11:15:31,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 489 transitions, 1998 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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-17 11:15:31,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:31,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-17 11:15:31,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:33,594 INFO L124 PetriNetUnfolderBase]: 2983/14016 cut-off events. [2025-03-17 11:15:33,594 INFO L125 PetriNetUnfolderBase]: For 26872/27266 co-relation queries the response was YES. [2025-03-17 11:15:33,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31580 conditions, 14016 events. 2983/14016 cut-off events. For 26872/27266 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 161203 event pairs, 824 based on Foata normal form. 76/12805 useless extension candidates. Maximal degree in co-relation 31520. Up to 2423 conditions per place. [2025-03-17 11:15:33,729 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 49 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2025-03-17 11:15:33,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 495 transitions, 2140 flow [2025-03-17 11:15:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-17 11:15:33,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-17 11:15:33,731 INFO L175 Difference]: Start difference. First operand has 438 places, 489 transitions, 1998 flow. Second operand 3 states and 1398 transitions. [2025-03-17 11:15:33,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 495 transitions, 2140 flow [2025-03-17 11:15:33,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 495 transitions, 2132 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:33,787 INFO L231 Difference]: Finished difference. Result has 439 places, 488 transitions, 1992 flow [2025-03-17 11:15:33,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1992, PETRI_PLACES=439, PETRI_TRANSITIONS=488} [2025-03-17 11:15:33,788 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -10 predicate places. [2025-03-17 11:15:33,788 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 488 transitions, 1992 flow [2025-03-17 11:15:33,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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-17 11:15:33,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:33,789 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:33,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:15:33,789 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:33,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:33,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1934185332, now seen corresponding path program 1 times [2025-03-17 11:15:33,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:33,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497276642] [2025-03-17 11:15:33,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:33,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:33,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-17 11:15:33,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-17 11:15:33,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:33,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 11:15:34,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:34,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497276642] [2025-03-17 11:15:34,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497276642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:15:34,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13243381] [2025-03-17 11:15:34,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:34,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:34,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:34,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:15:34,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:15:34,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-17 11:15:34,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-17 11:15:34,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:34,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:34,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 11:15:34,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:15:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 11:15:34,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:15:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 11:15:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13243381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:15:35,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:15:35,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-03-17 11:15:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746091609] [2025-03-17 11:15:35,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:15:35,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 11:15:35,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:35,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 11:15:35,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:15:36,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 507 [2025-03-17 11:15:36,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 488 transitions, 1992 flow. Second operand has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 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-17 11:15:36,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:36,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 507 [2025-03-17 11:15:36,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:42,779 INFO L124 PetriNetUnfolderBase]: 6354/26676 cut-off events. [2025-03-17 11:15:42,779 INFO L125 PetriNetUnfolderBase]: For 66368/70210 co-relation queries the response was YES. [2025-03-17 11:15:42,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62075 conditions, 26676 events. 6354/26676 cut-off events. For 66368/70210 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 317928 event pairs, 1841 based on Foata normal form. 836/25892 useless extension candidates. Maximal degree in co-relation 62012. Up to 5174 conditions per place. [2025-03-17 11:15:43,064 INFO L140 encePairwiseOnDemand]: 465/507 looper letters, 134 selfloop transitions, 123 changer transitions 0/629 dead transitions. [2025-03-17 11:15:43,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 629 transitions, 3289 flow [2025-03-17 11:15:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 11:15:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-17 11:15:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 14556 transitions. [2025-03-17 11:15:43,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444135050469892 [2025-03-17 11:15:43,071 INFO L175 Difference]: Start difference. First operand has 439 places, 488 transitions, 1992 flow. Second operand 34 states and 14556 transitions. [2025-03-17 11:15:43,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 629 transitions, 3289 flow [2025-03-17 11:15:43,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 629 transitions, 3285 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:43,158 INFO L231 Difference]: Finished difference. Result has 480 places, 572 transitions, 2826 flow [2025-03-17 11:15:43,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2826, PETRI_PLACES=480, PETRI_TRANSITIONS=572} [2025-03-17 11:15:43,159 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 31 predicate places. [2025-03-17 11:15:43,159 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 572 transitions, 2826 flow [2025-03-17 11:15:43,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 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-17 11:15:43,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:43,162 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:43,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:15:43,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 11:15:43,362 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:43,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2042796509, now seen corresponding path program 1 times [2025-03-17 11:15:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382329748] [2025-03-17 11:15:43,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:43,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-17 11:15:43,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-17 11:15:43,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:43,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:15:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382329748] [2025-03-17 11:15:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382329748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:15:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477913201] [2025-03-17 11:15:44,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:44,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:44,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:44,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:15:44,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:15:44,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-17 11:15:44,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-17 11:15:44,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:44,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:44,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 11:15:44,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:15:44,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:15:44,579 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:15:44,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:15:44,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 71 [2025-03-17 11:15:44,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-17 11:15:44,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2025-03-17 11:15:44,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-17 11:15:44,938 INFO L349 Elim1Store]: treesize reduction 413, result has 11.9 percent of original size [2025-03-17 11:15:44,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 100 [2025-03-17 11:15:44,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 81 [2025-03-17 11:15:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:15:45,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:15:45,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:45,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-17 11:15:45,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:45,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 88 [2025-03-17 11:15:45,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2025-03-17 11:15:45,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:45,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 13 [2025-03-17 11:15:45,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-17 11:15:45,099 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:45,102 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:45,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-17 11:15:45,104 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:45,107 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:45,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-17 11:15:45,109 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:45,112 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:45,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-17 11:15:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:15:45,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477913201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:15:45,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:15:45,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-03-17 11:15:45,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172314697] [2025-03-17 11:15:45,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:15:45,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:15:45,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:45,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:15:45,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:15:47,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 507 [2025-03-17 11:15:47,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 572 transitions, 2826 flow. Second operand has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 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-17 11:15:47,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:47,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 507 [2025-03-17 11:15:47,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:54,918 INFO L124 PetriNetUnfolderBase]: 6415/30406 cut-off events. [2025-03-17 11:15:54,918 INFO L125 PetriNetUnfolderBase]: For 71342/73356 co-relation queries the response was YES. [2025-03-17 11:15:55,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77810 conditions, 30406 events. 6415/30406 cut-off events. For 71342/73356 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 375241 event pairs, 1017 based on Foata normal form. 942/29988 useless extension candidates. Maximal degree in co-relation 77733. Up to 3125 conditions per place. [2025-03-17 11:15:55,274 INFO L140 encePairwiseOnDemand]: 475/507 looper letters, 172 selfloop transitions, 78 changer transitions 0/675 dead transitions. [2025-03-17 11:15:55,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 675 transitions, 4185 flow [2025-03-17 11:15:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 11:15:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-17 11:15:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 10480 transitions. [2025-03-17 11:15:55,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8268244575936884 [2025-03-17 11:15:55,282 INFO L175 Difference]: Start difference. First operand has 480 places, 572 transitions, 2826 flow. Second operand 25 states and 10480 transitions. [2025-03-17 11:15:55,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 675 transitions, 4185 flow [2025-03-17 11:15:55,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 675 transitions, 4101 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-03-17 11:15:55,471 INFO L231 Difference]: Finished difference. Result has 504 places, 586 transitions, 3158 flow [2025-03-17 11:15:55,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=2738, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3158, PETRI_PLACES=504, PETRI_TRANSITIONS=586} [2025-03-17 11:15:55,472 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 55 predicate places. [2025-03-17 11:15:55,472 INFO L471 AbstractCegarLoop]: Abstraction has has 504 places, 586 transitions, 3158 flow [2025-03-17 11:15:55,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 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-17 11:15:55,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:55,473 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:55,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:15:55,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:55,674 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:15:55,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:55,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1238417415, now seen corresponding path program 2 times [2025-03-17 11:15:55,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:55,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825394589] [2025-03-17 11:15:55,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:15:55,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:55,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 349 statements into 2 equivalence classes. [2025-03-17 11:15:55,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 349 of 349 statements. [2025-03-17 11:15:55,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:15:55,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:15:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825394589] [2025-03-17 11:15:56,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825394589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:15:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647409038] [2025-03-17 11:15:56,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:15:56,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:15:56,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:56,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:15:56,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:15:56,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 349 statements into 2 equivalence classes. [2025-03-17 11:15:57,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 349 of 349 statements. [2025-03-17 11:15:57,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:15:57,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:57,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:15:57,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:15:57,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:15:57,748 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:15:57,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:15:57,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 71 [2025-03-17 11:15:57,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-17 11:15:58,052 INFO L349 Elim1Store]: treesize reduction 413, result has 11.9 percent of original size [2025-03-17 11:15:58,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 100 [2025-03-17 11:15:58,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 81 [2025-03-17 11:15:58,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2025-03-17 11:15:58,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2025-03-17 11:15:58,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2025-03-17 11:15:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:15:58,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:15:58,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:58,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-17 11:15:58,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:58,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 88 [2025-03-17 11:15:58,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-17 11:15:58,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:15:58,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 13 [2025-03-17 11:15:58,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-03-17 11:15:58,175 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:58,178 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:58,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-17 11:15:58,180 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:58,183 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:58,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-17 11:15:58,185 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:15:58,188 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:15:58,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-17 11:15:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:15:58,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647409038] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:15:58,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:15:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-03-17 11:15:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791941847] [2025-03-17 11:15:58,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:15:58,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:15:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:58,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:15:58,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:16:01,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 507 [2025-03-17 11:16:01,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 586 transitions, 3158 flow. Second operand has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 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-17 11:16:01,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:01,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 507 [2025-03-17 11:16:01,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:08,716 INFO L124 PetriNetUnfolderBase]: 7610/33725 cut-off events. [2025-03-17 11:16:08,716 INFO L125 PetriNetUnfolderBase]: For 115952/119157 co-relation queries the response was YES. [2025-03-17 11:16:08,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91811 conditions, 33725 events. 7610/33725 cut-off events. For 115952/119157 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 421893 event pairs, 1271 based on Foata normal form. 1582/33653 useless extension candidates. Maximal degree in co-relation 91728. Up to 3973 conditions per place. [2025-03-17 11:16:09,075 INFO L140 encePairwiseOnDemand]: 476/507 looper letters, 123 selfloop transitions, 119 changer transitions 0/667 dead transitions. [2025-03-17 11:16:09,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 667 transitions, 4324 flow [2025-03-17 11:16:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 11:16:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-17 11:16:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 10898 transitions. [2025-03-17 11:16:09,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8267334243665605 [2025-03-17 11:16:09,083 INFO L175 Difference]: Start difference. First operand has 504 places, 586 transitions, 3158 flow. Second operand 26 states and 10898 transitions. [2025-03-17 11:16:09,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 667 transitions, 4324 flow [2025-03-17 11:16:09,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 667 transitions, 4271 flow, removed 1 selfloop flow, removed 18 redundant places. [2025-03-17 11:16:09,327 INFO L231 Difference]: Finished difference. Result has 515 places, 612 transitions, 3783 flow [2025-03-17 11:16:09,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=3105, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3783, PETRI_PLACES=515, PETRI_TRANSITIONS=612} [2025-03-17 11:16:09,328 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 66 predicate places. [2025-03-17 11:16:09,328 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 612 transitions, 3783 flow [2025-03-17 11:16:09,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 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-17 11:16:09,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:09,330 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:16:09,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:16:09,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 11:16:09,532 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:16:09,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:09,534 INFO L85 PathProgramCache]: Analyzing trace with hash 791889636, now seen corresponding path program 1 times [2025-03-17 11:16:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:09,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34334057] [2025-03-17 11:16:09,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:09,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-17 11:16:09,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-17 11:16:09,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:09,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 11:16:09,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:09,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34334057] [2025-03-17 11:16:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34334057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:09,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177785448] [2025-03-17 11:16:09,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:09,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:09,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:09,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:09,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:09,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-17 11:16:09,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 612 transitions, 3783 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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-17 11:16:09,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:09,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-17 11:16:09,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:16,001 INFO L124 PetriNetUnfolderBase]: 6366/27078 cut-off events. [2025-03-17 11:16:16,001 INFO L125 PetriNetUnfolderBase]: For 107761/108732 co-relation queries the response was YES. [2025-03-17 11:16:16,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71661 conditions, 27078 events. 6366/27078 cut-off events. For 107761/108732 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 329082 event pairs, 1984 based on Foata normal form. 188/24812 useless extension candidates. Maximal degree in co-relation 71577. Up to 5313 conditions per place. [2025-03-17 11:16:16,336 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 60 selfloop transitions, 2 changer transitions 0/619 dead transitions. [2025-03-17 11:16:16,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 619 transitions, 3963 flow [2025-03-17 11:16:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-17 11:16:16,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-17 11:16:16,340 INFO L175 Difference]: Start difference. First operand has 515 places, 612 transitions, 3783 flow. Second operand 3 states and 1398 transitions. [2025-03-17 11:16:16,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 619 transitions, 3963 flow [2025-03-17 11:16:16,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 619 transitions, 3886 flow, removed 13 selfloop flow, removed 18 redundant places. [2025-03-17 11:16:16,529 INFO L231 Difference]: Finished difference. Result has 498 places, 611 transitions, 3708 flow [2025-03-17 11:16:16,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=3704, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3708, PETRI_PLACES=498, PETRI_TRANSITIONS=611} [2025-03-17 11:16:16,530 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 49 predicate places. [2025-03-17 11:16:16,530 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 611 transitions, 3708 flow [2025-03-17 11:16:16,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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-17 11:16:16,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:16,530 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:16:16,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:16:16,530 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-17 11:16:16,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1759075928, now seen corresponding path program 1 times [2025-03-17 11:16:16,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:16,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607073831] [2025-03-17 11:16:16,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:16,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:16,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-17 11:16:16,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-17 11:16:16,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:16,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 11:16:16,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607073831] [2025-03-17 11:16:16,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607073831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:16:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242619698] [2025-03-17 11:16:16,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:16,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:16:16,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:16:16,943 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:16:16,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:16:17,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-17 11:16:17,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-17 11:16:17,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:17,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:17,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 11:16:17,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:16:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 11:16:17,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:16:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 11:16:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242619698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:16:17,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:16:17,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-03-17 11:16:17,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749474591] [2025-03-17 11:16:17,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:16:17,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 11:16:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:17,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 11:16:17,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:16:19,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 507 [2025-03-17 11:16:19,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 611 transitions, 3708 flow. Second operand has 30 states, 30 states have (on average 425.8) internal successors, (12774), 30 states have internal predecessors, (12774), 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-17 11:16:19,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:19,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 507 [2025-03-17 11:16:19,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand