./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-trans.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/chl-chromosome-trans.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 f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:11:21,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:11:21,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:11:21,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:11:21,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:11:21,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:11:21,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:11:21,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:11:21,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:11:21,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:11:21,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:11:21,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:11:21,581 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:11:21,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:11:21,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:11:21,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:11:21,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:11:21,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:11:21,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:11:21,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:11:21,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:11:21,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:11:21,582 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:11:21,582 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:11:21,583 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:11:21,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:11:21,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:11:21,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:11:21,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:11:21,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:11:21,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:11:21,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:21,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:11:21,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:11:21,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:11:21,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:11:21,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:11:21,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:11:21,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:11:21,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:11:21,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:11:21,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:11:21,584 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 -> f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 [2025-03-17 11:11:21,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:11:21,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:11:21,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:11:21,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:11:21,793 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:11:21,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-03-17 11:11:22,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ac79260/492e552e64f240cb8057fc8b5199f2ba/FLAG5d1f9953a [2025-03-17 11:11:23,179 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:11:23,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-03-17 11:11:23,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ac79260/492e552e64f240cb8057fc8b5199f2ba/FLAG5d1f9953a [2025-03-17 11:11:23,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ac79260/492e552e64f240cb8057fc8b5199f2ba [2025-03-17 11:11:23,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:11:23,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:11:23,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:23,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:11:23,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:11:23,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e79afff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23, skipping insertion in model container [2025-03-17 11:11:23,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:11:23,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:23,672 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:11:23,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:23,723 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:11:23,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23 WrapperNode [2025-03-17 11:11:23,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:23,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:23,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:11:23,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:11:23,732 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:11:23" (1/1) ... [2025-03-17 11:11:23,744 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:11:23" (1/1) ... [2025-03-17 11:11:23,778 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 424 [2025-03-17 11:11:23,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:23,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:11:23,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:11:23,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:11:23,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:11:23,806 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:11:23,807 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:11:23,807 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:11:23,808 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23" (1/1) ... [2025-03-17 11:11:23,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:23,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:23,835 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:11:23,837 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:11:23,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:11:23,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:11:23,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:11:23,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:11:23,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:11:23,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:11:23,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:11:23,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:11:23,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:11:23,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:11:23,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:11:23,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:11:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:11:23,859 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:11:23,953 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:11:23,955 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:11:24,482 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:11:24,482 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:11:24,509 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:11:24,510 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:11:24,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:24 BoogieIcfgContainer [2025-03-17 11:11:24,511 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:11:24,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:11:24,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:11:24,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:11:24,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:11:23" (1/3) ... [2025-03-17 11:11:24,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d84f8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:24, skipping insertion in model container [2025-03-17 11:11:24,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:23" (2/3) ... [2025-03-17 11:11:24,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d84f8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:24, skipping insertion in model container [2025-03-17 11:11:24,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:24" (3/3) ... [2025-03-17 11:11:24,519 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2025-03-17 11:11:24,529 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:11:24,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-trans.wvr.c that has 4 procedures, 548 locations, 1 initial locations, 6 loop locations, and 45 error locations. [2025-03-17 11:11:24,531 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:11:24,687 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:11:24,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 557 places, 574 transitions, 1169 flow [2025-03-17 11:11:24,888 INFO L124 PetriNetUnfolderBase]: 27/571 cut-off events. [2025-03-17 11:11:24,891 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:11:24,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 571 events. 27/571 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1276 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 431. Up to 2 conditions per place. [2025-03-17 11:11:24,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 557 places, 574 transitions, 1169 flow [2025-03-17 11:11:24,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 535 places, 550 transitions, 1118 flow [2025-03-17 11:11:24,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:11:24,937 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;@64c03691, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:11:24,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2025-03-17 11:11:24,943 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:11:24,943 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2025-03-17 11:11:24,943 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:11:24,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,944 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] [2025-03-17 11:11:24,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:24,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash 438941295, now seen corresponding path program 1 times [2025-03-17 11:11:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931227431] [2025-03-17 11:11:24,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:25,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:11:25,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:11:25,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:25,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:25,605 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:11:25,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:25,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931227431] [2025-03-17 11:11:25,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931227431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:25,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:25,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:25,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132247979] [2025-03-17 11:11:25,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:25,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:25,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:25,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:25,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:26,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 574 [2025-03-17 11:11:26,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 550 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 486.5) internal successors, (2919), 6 states have internal predecessors, (2919), 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:11:26,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:26,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 574 [2025-03-17 11:11:26,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,234 INFO L124 PetriNetUnfolderBase]: 2075/15182 cut-off events. [2025-03-17 11:11:28,235 INFO L125 PetriNetUnfolderBase]: For 633/635 co-relation queries the response was YES. [2025-03-17 11:11:28,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18385 conditions, 15182 events. 2075/15182 cut-off events. For 633/635 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 183679 event pairs, 1520 based on Foata normal form. 640/13451 useless extension candidates. Maximal degree in co-relation 16163. Up to 2820 conditions per place. [2025-03-17 11:11:28,372 INFO L140 encePairwiseOnDemand]: 541/574 looper letters, 54 selfloop transitions, 15 changer transitions 6/532 dead transitions. [2025-03-17 11:11:28,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 532 transitions, 1220 flow [2025-03-17 11:11:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2997 transitions. [2025-03-17 11:11:28,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702090592334495 [2025-03-17 11:11:28,388 INFO L175 Difference]: Start difference. First operand has 535 places, 550 transitions, 1118 flow. Second operand 6 states and 2997 transitions. [2025-03-17 11:11:28,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 532 transitions, 1220 flow [2025-03-17 11:11:28,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 532 transitions, 1208 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:11:28,405 INFO L231 Difference]: Finished difference. Result has 531 places, 526 transitions, 1088 flow [2025-03-17 11:11:28,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1088, PETRI_PLACES=531, PETRI_TRANSITIONS=526} [2025-03-17 11:11:28,409 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -4 predicate places. [2025-03-17 11:11:28,409 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 526 transitions, 1088 flow [2025-03-17 11:11:28,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 486.5) internal successors, (2919), 6 states have internal predecessors, (2919), 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:11:28,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:28,411 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] [2025-03-17 11:11:28,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:11:28,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:28,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1293352894, now seen corresponding path program 1 times [2025-03-17 11:11:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:28,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571653723] [2025-03-17 11:11:28,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:28,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:11:28,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:11:28,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:28,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571653723] [2025-03-17 11:11:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571653723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846607790] [2025-03-17 11:11:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:28,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:28,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-17 11:11:28,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 526 transitions, 1088 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:28,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-17 11:11:28,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,546 INFO L124 PetriNetUnfolderBase]: 19/741 cut-off events. [2025-03-17 11:11:28,546 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-17 11:11:28,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 741 events. 19/741 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2710 event pairs, 5 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 739. Up to 22 conditions per place. [2025-03-17 11:11:28,556 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/525 dead transitions. [2025-03-17 11:11:28,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 525 transitions, 1112 flow [2025-03-17 11:11:28,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-17 11:11:28,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:11:28,559 INFO L175 Difference]: Start difference. First operand has 531 places, 526 transitions, 1088 flow. Second operand 3 states and 1640 transitions. [2025-03-17 11:11:28,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 525 transitions, 1112 flow [2025-03-17 11:11:28,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 525 transitions, 1082 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:28,566 INFO L231 Difference]: Finished difference. Result has 521 places, 525 transitions, 1060 flow [2025-03-17 11:11:28,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=521, PETRI_TRANSITIONS=525} [2025-03-17 11:11:28,568 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -14 predicate places. [2025-03-17 11:11:28,568 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 525 transitions, 1060 flow [2025-03-17 11:11:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:28,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:28,569 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] [2025-03-17 11:11:28,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:11:28,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:28,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1501698571, now seen corresponding path program 1 times [2025-03-17 11:11:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:28,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019692585] [2025-03-17 11:11:28,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:28,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:11:28,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:11:28,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:28,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,654 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:11:28,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019692585] [2025-03-17 11:11:28,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019692585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209612783] [2025-03-17 11:11:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:28,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:28,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:28,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-17 11:11:28,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 525 transitions, 1060 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:28,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-17 11:11:28,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,769 INFO L124 PetriNetUnfolderBase]: 25/947 cut-off events. [2025-03-17 11:11:28,770 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-03-17 11:11:28,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 947 events. 25/947 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3839 event pairs, 7 based on Foata normal form. 0/820 useless extension candidates. Maximal degree in co-relation 912. Up to 25 conditions per place. [2025-03-17 11:11:28,781 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-03-17 11:11:28,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 524 transitions, 1084 flow [2025-03-17 11:11:28,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-17 11:11:28,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:11:28,784 INFO L175 Difference]: Start difference. First operand has 521 places, 525 transitions, 1060 flow. Second operand 3 states and 1640 transitions. [2025-03-17 11:11:28,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 524 transitions, 1084 flow [2025-03-17 11:11:28,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 524 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:28,790 INFO L231 Difference]: Finished difference. Result has 520 places, 524 transitions, 1058 flow [2025-03-17 11:11:28,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=520, PETRI_TRANSITIONS=524} [2025-03-17 11:11:28,791 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -15 predicate places. [2025-03-17 11:11:28,792 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 524 transitions, 1058 flow [2025-03-17 11:11:28,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:28,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:28,793 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] [2025-03-17 11:11:28,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:11:28,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:28,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:28,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2017355749, now seen corresponding path program 1 times [2025-03-17 11:11:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:28,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598674413] [2025-03-17 11:11:28,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:28,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 11:11:28,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 11:11:28,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:28,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,866 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:11:28,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598674413] [2025-03-17 11:11:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598674413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:28,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629441496] [2025-03-17 11:11:28,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:28,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:28,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-17 11:11:28,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 524 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:28,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-17 11:11:28,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,964 INFO L124 PetriNetUnfolderBase]: 19/637 cut-off events. [2025-03-17 11:11:28,965 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-17 11:11:28,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 637 events. 19/637 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2037 event pairs, 7 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 552. Up to 25 conditions per place. [2025-03-17 11:11:28,973 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/523 dead transitions. [2025-03-17 11:11:28,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 523 transitions, 1082 flow [2025-03-17 11:11:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-17 11:11:28,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:11:28,976 INFO L175 Difference]: Start difference. First operand has 520 places, 524 transitions, 1058 flow. Second operand 3 states and 1640 transitions. [2025-03-17 11:11:28,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 523 transitions, 1082 flow [2025-03-17 11:11:28,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 523 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:28,982 INFO L231 Difference]: Finished difference. Result has 519 places, 523 transitions, 1056 flow [2025-03-17 11:11:28,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=519, PETRI_TRANSITIONS=523} [2025-03-17 11:11:28,984 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -16 predicate places. [2025-03-17 11:11:28,985 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 523 transitions, 1056 flow [2025-03-17 11:11:28,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:28,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:28,986 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] [2025-03-17 11:11:28,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:11:28,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:28,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash -651101319, now seen corresponding path program 1 times [2025-03-17 11:11:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:28,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964632426] [2025-03-17 11:11:28,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:28,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:28,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:11:29,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:11:29,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,042 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:11:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964632426] [2025-03-17 11:11:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964632426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:29,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406047424] [2025-03-17 11:11:29,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:29,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:29,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-17 11:11:29,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 523 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:29,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-17 11:11:29,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:29,148 INFO L124 PetriNetUnfolderBase]: 21/826 cut-off events. [2025-03-17 11:11:29,148 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:29,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 826 events. 21/826 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3384 event pairs, 5 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 692. Up to 22 conditions per place. [2025-03-17 11:11:29,157 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-03-17 11:11:29,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 522 transitions, 1080 flow [2025-03-17 11:11:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-17 11:11:29,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:11:29,160 INFO L175 Difference]: Start difference. First operand has 519 places, 523 transitions, 1056 flow. Second operand 3 states and 1640 transitions. [2025-03-17 11:11:29,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 522 transitions, 1080 flow [2025-03-17 11:11:29,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 522 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:29,166 INFO L231 Difference]: Finished difference. Result has 518 places, 522 transitions, 1054 flow [2025-03-17 11:11:29,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1054, PETRI_PLACES=518, PETRI_TRANSITIONS=522} [2025-03-17 11:11:29,167 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -17 predicate places. [2025-03-17 11:11:29,167 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 522 transitions, 1054 flow [2025-03-17 11:11:29,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:29,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,168 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] [2025-03-17 11:11:29,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:11:29,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:29,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -570134600, now seen corresponding path program 1 times [2025-03-17 11:11:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018267300] [2025-03-17 11:11:29,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 11:11:29,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 11:11:29,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,212 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:11:29,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018267300] [2025-03-17 11:11:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018267300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:29,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304737607] [2025-03-17 11:11:29,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:29,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:29,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:29,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-17 11:11:29,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 522 transitions, 1054 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:29,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-17 11:11:29,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:29,355 INFO L124 PetriNetUnfolderBase]: 27/1034 cut-off events. [2025-03-17 11:11:29,355 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-03-17 11:11:29,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 1034 events. 27/1034 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4733 event pairs, 7 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 897. Up to 25 conditions per place. [2025-03-17 11:11:29,369 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-03-17 11:11:29,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 521 transitions, 1078 flow [2025-03-17 11:11:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-17 11:11:29,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:11:29,372 INFO L175 Difference]: Start difference. First operand has 518 places, 522 transitions, 1054 flow. Second operand 3 states and 1640 transitions. [2025-03-17 11:11:29,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 521 transitions, 1078 flow [2025-03-17 11:11:29,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 521 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:29,378 INFO L231 Difference]: Finished difference. Result has 517 places, 521 transitions, 1052 flow [2025-03-17 11:11:29,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=517, PETRI_TRANSITIONS=521} [2025-03-17 11:11:29,379 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-03-17 11:11:29,379 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 521 transitions, 1052 flow [2025-03-17 11:11:29,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:29,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,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] [2025-03-17 11:11:29,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:11:29,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:29,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2056337905, now seen corresponding path program 1 times [2025-03-17 11:11:29,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386327366] [2025-03-17 11:11:29,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 11:11:29,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 11:11:29,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,427 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:11:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386327366] [2025-03-17 11:11:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386327366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:29,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159051862] [2025-03-17 11:11:29,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:29,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:29,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:29,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-17 11:11:29,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 521 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:29,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-17 11:11:29,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:29,525 INFO L124 PetriNetUnfolderBase]: 25/898 cut-off events. [2025-03-17 11:11:29,526 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-17 11:11:29,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 898 events. 25/898 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3234 event pairs, 7 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 750. Up to 25 conditions per place. [2025-03-17 11:11:29,538 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-03-17 11:11:29,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 520 transitions, 1076 flow [2025-03-17 11:11:29,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-17 11:11:29,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:11:29,541 INFO L175 Difference]: Start difference. First operand has 517 places, 521 transitions, 1052 flow. Second operand 3 states and 1640 transitions. [2025-03-17 11:11:29,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 520 transitions, 1076 flow [2025-03-17 11:11:29,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 520 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:29,547 INFO L231 Difference]: Finished difference. Result has 516 places, 520 transitions, 1050 flow [2025-03-17 11:11:29,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=516, PETRI_TRANSITIONS=520} [2025-03-17 11:11:29,549 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-03-17 11:11:29,549 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 520 transitions, 1050 flow [2025-03-17 11:11:29,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:29,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,550 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] [2025-03-17 11:11:29,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:11:29,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:29,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1735658695, now seen corresponding path program 1 times [2025-03-17 11:11:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316176674] [2025-03-17 11:11:29,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 11:11:29,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 11:11:29,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,594 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:11:29,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316176674] [2025-03-17 11:11:29,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316176674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:29,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038493657] [2025-03-17 11:11:29,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:29,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:29,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-17 11:11:29,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 520 transitions, 1050 flow. Second operand has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 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:11:29,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-17 11:11:29,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:29,750 INFO L124 PetriNetUnfolderBase]: 36/1226 cut-off events. [2025-03-17 11:11:29,750 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:11:29,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 1226 events. 36/1226 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6553 event pairs, 8 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 1082. Up to 31 conditions per place. [2025-03-17 11:11:29,763 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-03-17 11:11:29,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 522 transitions, 1086 flow [2025-03-17 11:11:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-03-17 11:11:29,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-03-17 11:11:29,768 INFO L175 Difference]: Start difference. First operand has 516 places, 520 transitions, 1050 flow. Second operand 3 states and 1649 transitions. [2025-03-17 11:11:29,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 522 transitions, 1086 flow [2025-03-17 11:11:29,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 522 transitions, 1082 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:29,777 INFO L231 Difference]: Finished difference. Result has 515 places, 520 transitions, 1056 flow [2025-03-17 11:11:29,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=515, PETRI_TRANSITIONS=520} [2025-03-17 11:11:29,779 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -20 predicate places. [2025-03-17 11:11:29,779 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 520 transitions, 1056 flow [2025-03-17 11:11:29,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 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:11:29,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,781 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] [2025-03-17 11:11:29,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:11:29,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:29,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1068616358, now seen corresponding path program 1 times [2025-03-17 11:11:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853151526] [2025-03-17 11:11:29,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:11:29,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:11:29,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,845 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:11:29,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853151526] [2025-03-17 11:11:29,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853151526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:29,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31864552] [2025-03-17 11:11:29,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:29,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:29,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:29,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-17 11:11:29,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 520 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:11:29,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-17 11:11:29,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:30,038 INFO L124 PetriNetUnfolderBase]: 49/1359 cut-off events. [2025-03-17 11:11:30,038 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:11:30,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 1359 events. 49/1359 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8225 event pairs, 5 based on Foata normal form. 0/1184 useless extension candidates. Maximal degree in co-relation 1127. Up to 43 conditions per place. [2025-03-17 11:11:30,055 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-03-17 11:11:30,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 522 transitions, 1092 flow [2025-03-17 11:11:30,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-03-17 11:11:30,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-03-17 11:11:30,059 INFO L175 Difference]: Start difference. First operand has 515 places, 520 transitions, 1056 flow. Second operand 3 states and 1649 transitions. [2025-03-17 11:11:30,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 522 transitions, 1092 flow [2025-03-17 11:11:30,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 522 transitions, 1092 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:30,066 INFO L231 Difference]: Finished difference. Result has 516 places, 520 transitions, 1066 flow [2025-03-17 11:11:30,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=516, PETRI_TRANSITIONS=520} [2025-03-17 11:11:30,067 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-03-17 11:11:30,067 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 520 transitions, 1066 flow [2025-03-17 11:11:30,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:11:30,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:30,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:30,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:11:30,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:30,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:30,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1897589397, now seen corresponding path program 1 times [2025-03-17 11:11:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:30,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253841936] [2025-03-17 11:11:30,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:30,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:30,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 11:11:30,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 11:11:30,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:30,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:30,118 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:11:30,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253841936] [2025-03-17 11:11:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253841936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:30,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798819881] [2025-03-17 11:11:30,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:30,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:30,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:30,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-17 11:11:30,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 520 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 542.3333333333334) internal successors, (1627), 3 states have internal predecessors, (1627), 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:11:30,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:30,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-17 11:11:30,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:30,330 INFO L124 PetriNetUnfolderBase]: 51/1185 cut-off events. [2025-03-17 11:11:30,330 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:30,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1185 events. 51/1185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6458 event pairs, 18 based on Foata normal form. 0/1038 useless extension candidates. Maximal degree in co-relation 1002. Up to 57 conditions per place. [2025-03-17 11:11:30,347 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-03-17 11:11:30,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 521 transitions, 1104 flow [2025-03-17 11:11:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-03-17 11:11:30,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-03-17 11:11:30,351 INFO L175 Difference]: Start difference. First operand has 516 places, 520 transitions, 1066 flow. Second operand 3 states and 1641 transitions. [2025-03-17 11:11:30,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 521 transitions, 1104 flow [2025-03-17 11:11:30,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 521 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:30,357 INFO L231 Difference]: Finished difference. Result has 517 places, 519 transitions, 1068 flow [2025-03-17 11:11:30,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=517, PETRI_TRANSITIONS=519} [2025-03-17 11:11:30,358 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-03-17 11:11:30,358 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 519 transitions, 1068 flow [2025-03-17 11:11:30,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.3333333333334) internal successors, (1627), 3 states have internal predecessors, (1627), 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:11:30,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:30,360 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] [2025-03-17 11:11:30,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:11:30,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:30,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash 81931487, now seen corresponding path program 1 times [2025-03-17 11:11:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346089243] [2025-03-17 11:11:30,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:30,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 11:11:30,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 11:11:30,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:30,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:30,408 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:11:30,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:30,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346089243] [2025-03-17 11:11:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346089243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:30,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:30,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566288655] [2025-03-17 11:11:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:30,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:30,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:30,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-17 11:11:30,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 519 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:11:30,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:30,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-17 11:11:30,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:30,684 INFO L124 PetriNetUnfolderBase]: 68/1866 cut-off events. [2025-03-17 11:11:30,685 INFO L125 PetriNetUnfolderBase]: For 16/21 co-relation queries the response was YES. [2025-03-17 11:11:30,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 1866 events. 68/1866 cut-off events. For 16/21 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 12142 event pairs, 15 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 1556. Up to 56 conditions per place. [2025-03-17 11:11:30,709 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-03-17 11:11:30,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 521 transitions, 1104 flow [2025-03-17 11:11:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-03-17 11:11:30,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-03-17 11:11:30,713 INFO L175 Difference]: Start difference. First operand has 517 places, 519 transitions, 1068 flow. Second operand 3 states and 1649 transitions. [2025-03-17 11:11:30,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 521 transitions, 1104 flow [2025-03-17 11:11:30,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 521 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:30,719 INFO L231 Difference]: Finished difference. Result has 516 places, 519 transitions, 1074 flow [2025-03-17 11:11:30,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=516, PETRI_TRANSITIONS=519} [2025-03-17 11:11:30,721 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-03-17 11:11:30,721 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 519 transitions, 1074 flow [2025-03-17 11:11:30,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:11:30,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:30,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:30,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:11:30,722 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:30,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash -989246714, now seen corresponding path program 1 times [2025-03-17 11:11:30,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:30,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035828360] [2025-03-17 11:11:30,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:30,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:30,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 11:11:30,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 11:11:30,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:30,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:30,774 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:11:30,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:30,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035828360] [2025-03-17 11:11:30,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035828360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:30,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:30,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464385799] [2025-03-17 11:11:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:30,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:30,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:30,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:30,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-17 11:11:30,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 519 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 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:11:30,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:30,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-17 11:11:30,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:31,075 INFO L124 PetriNetUnfolderBase]: 101/2286 cut-off events. [2025-03-17 11:11:31,075 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-03-17 11:11:31,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 2286 events. 101/2286 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 15779 event pairs, 6 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 1997. Up to 104 conditions per place. [2025-03-17 11:11:31,105 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 16 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-03-17 11:11:31,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 524 transitions, 1125 flow [2025-03-17 11:11:31,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:31,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:31,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1652 transitions. [2025-03-17 11:11:31,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959349593495935 [2025-03-17 11:11:31,109 INFO L175 Difference]: Start difference. First operand has 516 places, 519 transitions, 1074 flow. Second operand 3 states and 1652 transitions. [2025-03-17 11:11:31,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 524 transitions, 1125 flow [2025-03-17 11:11:31,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 524 transitions, 1125 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:31,116 INFO L231 Difference]: Finished difference. Result has 517 places, 519 transitions, 1084 flow [2025-03-17 11:11:31,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=517, PETRI_TRANSITIONS=519} [2025-03-17 11:11:31,117 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-03-17 11:11:31,117 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 519 transitions, 1084 flow [2025-03-17 11:11:31,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 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:11:31,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:31,120 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] [2025-03-17 11:11:31,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:11:31,120 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:31,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash -601845103, now seen corresponding path program 1 times [2025-03-17 11:11:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:31,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017321033] [2025-03-17 11:11:31,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:31,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 11:11:31,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 11:11:31,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:31,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:31,175 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:11:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017321033] [2025-03-17 11:11:31,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017321033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:31,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:31,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:31,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122460051] [2025-03-17 11:11:31,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:31,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:31,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:31,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:31,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:31,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-17 11:11:31,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 519 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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:11:31,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:31,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-17 11:11:31,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:31,531 INFO L124 PetriNetUnfolderBase]: 118/2771 cut-off events. [2025-03-17 11:11:31,532 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-03-17 11:11:31,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3033 conditions, 2771 events. 118/2771 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 20121 event pairs, 15 based on Foata normal form. 0/2426 useless extension candidates. Maximal degree in co-relation 2596. Up to 57 conditions per place. [2025-03-17 11:11:31,572 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 15 selfloop transitions, 5 changer transitions 0/521 dead transitions. [2025-03-17 11:11:31,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 521 transitions, 1130 flow [2025-03-17 11:11:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-17 11:11:31,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:11:31,575 INFO L175 Difference]: Start difference. First operand has 517 places, 519 transitions, 1084 flow. Second operand 3 states and 1640 transitions. [2025-03-17 11:11:31,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 521 transitions, 1130 flow [2025-03-17 11:11:31,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 521 transitions, 1130 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:31,581 INFO L231 Difference]: Finished difference. Result has 518 places, 519 transitions, 1110 flow [2025-03-17 11:11:31,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=518, PETRI_TRANSITIONS=519} [2025-03-17 11:11:31,582 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -17 predicate places. [2025-03-17 11:11:31,582 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 519 transitions, 1110 flow [2025-03-17 11:11:31,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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:11:31,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:31,583 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] [2025-03-17 11:11:31,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:11:31,583 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:31,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1877396463, now seen corresponding path program 1 times [2025-03-17 11:11:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:31,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925094214] [2025-03-17 11:11:31,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:31,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:31,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 11:11:31,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 11:11:31,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:31,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:31,627 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:11:31,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925094214] [2025-03-17 11:11:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925094214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:31,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339109111] [2025-03-17 11:11:31,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:31,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:31,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:31,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:31,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-17 11:11:31,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 519 transitions, 1110 flow. Second operand has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 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:11:31,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:31,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-17 11:11:31,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:31,947 INFO L124 PetriNetUnfolderBase]: 92/2232 cut-off events. [2025-03-17 11:11:31,947 INFO L125 PetriNetUnfolderBase]: For 36/118 co-relation queries the response was YES. [2025-03-17 11:11:31,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 2232 events. 92/2232 cut-off events. For 36/118 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 14668 event pairs, 22 based on Foata normal form. 2/1934 useless extension candidates. Maximal degree in co-relation 1879. Up to 58 conditions per place. [2025-03-17 11:11:31,990 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-03-17 11:11:31,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 520 transitions, 1148 flow [2025-03-17 11:11:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-03-17 11:11:31,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-03-17 11:11:31,992 INFO L175 Difference]: Start difference. First operand has 518 places, 519 transitions, 1110 flow. Second operand 3 states and 1641 transitions. [2025-03-17 11:11:31,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 520 transitions, 1148 flow [2025-03-17 11:11:31,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 520 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:32,000 INFO L231 Difference]: Finished difference. Result has 517 places, 518 transitions, 1102 flow [2025-03-17 11:11:32,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=517, PETRI_TRANSITIONS=518} [2025-03-17 11:11:32,002 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-03-17 11:11:32,002 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 518 transitions, 1102 flow [2025-03-17 11:11:32,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 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:11:32,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:32,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:32,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:11:32,004 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:32,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:32,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1951751597, now seen corresponding path program 1 times [2025-03-17 11:11:32,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811854710] [2025-03-17 11:11:32,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:32,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:32,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 11:11:32,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 11:11:32,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:32,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:32,101 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:11:32,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811854710] [2025-03-17 11:11:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811854710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:32,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:32,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:11:32,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282248024] [2025-03-17 11:11:32,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:32,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:11:32,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:32,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:11:32,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:11:32,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-03-17 11:11:32,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 518 transitions, 1102 flow. Second operand has 4 states, 4 states have (on average 544.25) internal successors, (2177), 4 states have internal predecessors, (2177), 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:11:32,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:32,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-03-17 11:11:32,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:32,555 INFO L124 PetriNetUnfolderBase]: 124/3253 cut-off events. [2025-03-17 11:11:32,555 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-03-17 11:11:32,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 3253 events. 124/3253 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 24220 event pairs, 24 based on Foata normal form. 2/2851 useless extension candidates. Maximal degree in co-relation 3439. Up to 67 conditions per place. [2025-03-17 11:11:32,592 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 27 selfloop transitions, 4 changer transitions 0/534 dead transitions. [2025-03-17 11:11:32,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 534 transitions, 1206 flow [2025-03-17 11:11:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:11:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:11:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2747 transitions. [2025-03-17 11:11:32,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571428571428572 [2025-03-17 11:11:32,595 INFO L175 Difference]: Start difference. First operand has 517 places, 518 transitions, 1102 flow. Second operand 5 states and 2747 transitions. [2025-03-17 11:11:32,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 534 transitions, 1206 flow [2025-03-17 11:11:32,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 534 transitions, 1202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:32,602 INFO L231 Difference]: Finished difference. Result has 522 places, 520 transitions, 1123 flow [2025-03-17 11:11:32,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1123, PETRI_PLACES=522, PETRI_TRANSITIONS=520} [2025-03-17 11:11:32,604 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -13 predicate places. [2025-03-17 11:11:32,604 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 520 transitions, 1123 flow [2025-03-17 11:11:32,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.25) internal successors, (2177), 4 states have internal predecessors, (2177), 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:11:32,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:32,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:32,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:11:32,605 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:32,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1400861842, now seen corresponding path program 1 times [2025-03-17 11:11:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179221756] [2025-03-17 11:11:32,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:32,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:32,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 11:11:32,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 11:11:32,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:32,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:32,715 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:11:32,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179221756] [2025-03-17 11:11:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179221756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:32,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:32,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:32,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842881161] [2025-03-17 11:11:32,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:32,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:11:32,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:32,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:11:32,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:11:32,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 574 [2025-03-17 11:11:32,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 520 transitions, 1123 flow. Second operand has 5 states, 5 states have (on average 529.0) internal successors, (2645), 5 states have internal predecessors, (2645), 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:11:32,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:32,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 574 [2025-03-17 11:11:32,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:33,088 INFO L124 PetriNetUnfolderBase]: 47/1670 cut-off events. [2025-03-17 11:11:33,088 INFO L125 PetriNetUnfolderBase]: For 11/22 co-relation queries the response was YES. [2025-03-17 11:11:33,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1670 events. 47/1670 cut-off events. For 11/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8732 event pairs, 3 based on Foata normal form. 3/1481 useless extension candidates. Maximal degree in co-relation 1699. Up to 30 conditions per place. [2025-03-17 11:11:33,111 INFO L140 encePairwiseOnDemand]: 553/574 looper letters, 18 selfloop transitions, 18 changer transitions 0/523 dead transitions. [2025-03-17 11:11:33,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 523 transitions, 1201 flow [2025-03-17 11:11:33,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:11:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:11:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2659 transitions. [2025-03-17 11:11:33,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9264808362369338 [2025-03-17 11:11:33,114 INFO L175 Difference]: Start difference. First operand has 522 places, 520 transitions, 1123 flow. Second operand 5 states and 2659 transitions. [2025-03-17 11:11:33,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 523 transitions, 1201 flow [2025-03-17 11:11:33,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 523 transitions, 1201 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:33,119 INFO L231 Difference]: Finished difference. Result has 527 places, 523 transitions, 1183 flow [2025-03-17 11:11:33,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1183, PETRI_PLACES=527, PETRI_TRANSITIONS=523} [2025-03-17 11:11:33,120 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -8 predicate places. [2025-03-17 11:11:33,120 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 523 transitions, 1183 flow [2025-03-17 11:11:33,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 529.0) internal successors, (2645), 5 states have internal predecessors, (2645), 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:11:33,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:33,121 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] [2025-03-17 11:11:33,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:11:33,121 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:33,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1890424274, now seen corresponding path program 1 times [2025-03-17 11:11:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577083283] [2025-03-17 11:11:33,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:33,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:33,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:11:33,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:11:33,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:33,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:11:33,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:33,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577083283] [2025-03-17 11:11:33,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577083283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:33,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:33,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:33,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112030957] [2025-03-17 11:11:33,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:33,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:33,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:33,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:33,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-17 11:11:33,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 523 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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:11:33,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:33,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-17 11:11:33,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:33,761 INFO L124 PetriNetUnfolderBase]: 188/4808 cut-off events. [2025-03-17 11:11:33,761 INFO L125 PetriNetUnfolderBase]: For 56/61 co-relation queries the response was YES. [2025-03-17 11:11:33,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5351 conditions, 4808 events. 188/4808 cut-off events. For 56/61 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 39552 event pairs, 45 based on Foata normal form. 1/4211 useless extension candidates. Maximal degree in co-relation 5122. Up to 128 conditions per place. [2025-03-17 11:11:33,815 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 17 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-03-17 11:11:33,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 524 transitions, 1225 flow [2025-03-17 11:11:33,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-03-17 11:11:33,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-03-17 11:11:33,818 INFO L175 Difference]: Start difference. First operand has 527 places, 523 transitions, 1183 flow. Second operand 3 states and 1641 transitions. [2025-03-17 11:11:33,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 524 transitions, 1225 flow [2025-03-17 11:11:33,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 524 transitions, 1195 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 11:11:33,823 INFO L231 Difference]: Finished difference. Result has 525 places, 522 transitions, 1155 flow [2025-03-17 11:11:33,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1155, PETRI_PLACES=525, PETRI_TRANSITIONS=522} [2025-03-17 11:11:33,824 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -10 predicate places. [2025-03-17 11:11:33,824 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 522 transitions, 1155 flow [2025-03-17 11:11:33,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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:11:33,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:33,825 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] [2025-03-17 11:11:33,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:11:33,825 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:33,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash 150630543, now seen corresponding path program 1 times [2025-03-17 11:11:33,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:33,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455318203] [2025-03-17 11:11:33,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:33,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:33,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:11:33,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:11:33,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:33,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:33,972 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:11:33,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:33,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455318203] [2025-03-17 11:11:33,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455318203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:11:33,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050888486] [2025-03-17 11:11:33,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:33,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:11:33,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:33,975 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:11:33,976 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:11:34,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:11:34,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:11:34,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:34,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:34,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 11:11:34,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:11:34,231 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:11:34,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:11:34,320 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:11:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050888486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:11:34,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:11:34,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-17 11:11:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308999362] [2025-03-17 11:11:34,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:11:34,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:11:34,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:34,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:11:34,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:11:34,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 574 [2025-03-17 11:11:34,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 522 transitions, 1155 flow. Second operand has 15 states, 15 states have (on average 518.4666666666667) internal successors, (7777), 15 states have internal predecessors, (7777), 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:11:34,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:34,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 574 [2025-03-17 11:11:34,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,203 INFO L124 PetriNetUnfolderBase]: 47/1715 cut-off events. [2025-03-17 11:11:35,203 INFO L125 PetriNetUnfolderBase]: For 20/31 co-relation queries the response was YES. [2025-03-17 11:11:35,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 1715 events. 47/1715 cut-off events. For 20/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8578 event pairs, 3 based on Foata normal form. 6/1535 useless extension candidates. Maximal degree in co-relation 1800. Up to 30 conditions per place. [2025-03-17 11:11:35,226 INFO L140 encePairwiseOnDemand]: 544/574 looper letters, 30 selfloop transitions, 39 changer transitions 0/546 dead transitions. [2025-03-17 11:11:35,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 546 transitions, 1347 flow [2025-03-17 11:11:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5740 transitions. [2025-03-17 11:11:35,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-17 11:11:35,233 INFO L175 Difference]: Start difference. First operand has 525 places, 522 transitions, 1155 flow. Second operand 11 states and 5740 transitions. [2025-03-17 11:11:35,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 546 transitions, 1347 flow [2025-03-17 11:11:35,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 546 transitions, 1343 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:35,240 INFO L231 Difference]: Finished difference. Result has 536 places, 540 transitions, 1331 flow [2025-03-17 11:11:35,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1331, PETRI_PLACES=536, PETRI_TRANSITIONS=540} [2025-03-17 11:11:35,241 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 1 predicate places. [2025-03-17 11:11:35,241 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 540 transitions, 1331 flow [2025-03-17 11:11:35,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 518.4666666666667) internal successors, (7777), 15 states have internal predecessors, (7777), 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:11:35,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:35,244 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:35,251 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:11:35,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 11:11:35,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:35,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:35,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1635386735, now seen corresponding path program 2 times [2025-03-17 11:11:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346256553] [2025-03-17 11:11:35,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:11:35,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:35,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-03-17 11:11:35,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 171 of 306 statements. [2025-03-17 11:11:35,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:11:35,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 11:11:35,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:35,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346256553] [2025-03-17 11:11:35,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346256553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:35,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:35,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:35,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799500847] [2025-03-17 11:11:35,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:35,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:35,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:35,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:35,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:36,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-17 11:11:36,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 540 transitions, 1331 flow. Second operand has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 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:11:36,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:36,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-17 11:11:36,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:36,459 INFO L124 PetriNetUnfolderBase]: 100/2643 cut-off events. [2025-03-17 11:11:36,459 INFO L125 PetriNetUnfolderBase]: For 63/70 co-relation queries the response was YES. [2025-03-17 11:11:36,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 2643 events. 100/2643 cut-off events. For 63/70 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 17488 event pairs, 9 based on Foata normal form. 0/2363 useless extension candidates. Maximal degree in co-relation 2992. Up to 79 conditions per place. [2025-03-17 11:11:36,497 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 30 selfloop transitions, 6 changer transitions 0/547 dead transitions. [2025-03-17 11:11:36,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 547 transitions, 1425 flow [2025-03-17 11:11:36,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3210 transitions. [2025-03-17 11:11:36,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320557491289199 [2025-03-17 11:11:36,501 INFO L175 Difference]: Start difference. First operand has 536 places, 540 transitions, 1331 flow. Second operand 6 states and 3210 transitions. [2025-03-17 11:11:36,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 547 transitions, 1425 flow [2025-03-17 11:11:36,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 547 transitions, 1389 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-17 11:11:36,508 INFO L231 Difference]: Finished difference. Result has 537 places, 539 transitions, 1305 flow [2025-03-17 11:11:36,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1305, PETRI_PLACES=537, PETRI_TRANSITIONS=539} [2025-03-17 11:11:36,509 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 2 predicate places. [2025-03-17 11:11:36,509 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 539 transitions, 1305 flow [2025-03-17 11:11:36,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 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:11:36,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:36,510 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:36,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:11:36,510 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:36,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1808905416, now seen corresponding path program 1 times [2025-03-17 11:11:36,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:36,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120090081] [2025-03-17 11:11:36,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:36,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-17 11:11:36,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-17 11:11:36,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:36,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 11:11:36,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:36,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120090081] [2025-03-17 11:11:36,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120090081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:36,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:36,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:36,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457632093] [2025-03-17 11:11:36,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:36,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:36,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:36,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:36,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:36,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-17 11:11:36,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 539 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:11:36,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:36,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-17 11:11:36,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:37,052 INFO L124 PetriNetUnfolderBase]: 125/3167 cut-off events. [2025-03-17 11:11:37,052 INFO L125 PetriNetUnfolderBase]: For 66/87 co-relation queries the response was YES. [2025-03-17 11:11:37,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3685 conditions, 3167 events. 125/3167 cut-off events. For 66/87 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22724 event pairs, 15 based on Foata normal form. 1/2847 useless extension candidates. Maximal degree in co-relation 3355. Up to 118 conditions per place. [2025-03-17 11:11:37,095 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 16 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2025-03-17 11:11:37,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 544 transitions, 1356 flow [2025-03-17 11:11:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1652 transitions. [2025-03-17 11:11:37,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959349593495935 [2025-03-17 11:11:37,097 INFO L175 Difference]: Start difference. First operand has 537 places, 539 transitions, 1305 flow. Second operand 3 states and 1652 transitions. [2025-03-17 11:11:37,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 544 transitions, 1356 flow [2025-03-17 11:11:37,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 544 transitions, 1344 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:37,103 INFO L231 Difference]: Finished difference. Result has 533 places, 539 transitions, 1303 flow [2025-03-17 11:11:37,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1303, PETRI_PLACES=533, PETRI_TRANSITIONS=539} [2025-03-17 11:11:37,104 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -2 predicate places. [2025-03-17 11:11:37,104 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 539 transitions, 1303 flow [2025-03-17 11:11:37,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:11:37,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:37,105 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:37,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:11:37,105 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:37,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1610926896, now seen corresponding path program 1 times [2025-03-17 11:11:37,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:37,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68763063] [2025-03-17 11:11:37,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:37,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-17 11:11:37,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-17 11:11:37,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:37,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 11:11:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68763063] [2025-03-17 11:11:37,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68763063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:37,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518789838] [2025-03-17 11:11:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:37,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:37,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:37,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:37,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-17 11:11:37,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 539 transitions, 1303 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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:11:37,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:37,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-17 11:11:37,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:37,660 INFO L124 PetriNetUnfolderBase]: 248/3205 cut-off events. [2025-03-17 11:11:37,660 INFO L125 PetriNetUnfolderBase]: For 185/237 co-relation queries the response was YES. [2025-03-17 11:11:37,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 3205 events. 248/3205 cut-off events. For 185/237 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 25428 event pairs, 54 based on Foata normal form. 0/2769 useless extension candidates. Maximal degree in co-relation 3514. Up to 320 conditions per place. [2025-03-17 11:11:37,708 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/540 dead transitions. [2025-03-17 11:11:37,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 540 transitions, 1341 flow [2025-03-17 11:11:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-03-17 11:11:37,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-03-17 11:11:37,710 INFO L175 Difference]: Start difference. First operand has 533 places, 539 transitions, 1303 flow. Second operand 3 states and 1641 transitions. [2025-03-17 11:11:37,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 540 transitions, 1341 flow [2025-03-17 11:11:37,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 540 transitions, 1341 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:37,715 INFO L231 Difference]: Finished difference. Result has 534 places, 538 transitions, 1305 flow [2025-03-17 11:11:37,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=534, PETRI_TRANSITIONS=538} [2025-03-17 11:11:37,716 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -1 predicate places. [2025-03-17 11:11:37,716 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 538 transitions, 1305 flow [2025-03-17 11:11:37,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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:11:37,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:37,717 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:37,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:11:37,717 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:37,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash 241525110, now seen corresponding path program 1 times [2025-03-17 11:11:37,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:37,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546176437] [2025-03-17 11:11:37,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:37,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:37,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-17 11:11:37,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-17 11:11:37,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:37,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 11:11:37,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:37,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546176437] [2025-03-17 11:11:37,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546176437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:37,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:37,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246622418] [2025-03-17 11:11:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:37,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:37,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:37,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:37,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-17 11:11:37,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 538 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 540.6666666666666) internal successors, (1622), 3 states have internal predecessors, (1622), 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:11:37,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:37,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-17 11:11:37,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:38,706 INFO L124 PetriNetUnfolderBase]: 181/4365 cut-off events. [2025-03-17 11:11:38,706 INFO L125 PetriNetUnfolderBase]: For 75/238 co-relation queries the response was YES. [2025-03-17 11:11:38,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4918 conditions, 4365 events. 181/4365 cut-off events. For 75/238 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 33117 event pairs, 26 based on Foata normal form. 0/3856 useless extension candidates. Maximal degree in co-relation 4588. Up to 82 conditions per place. [2025-03-17 11:11:38,789 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 15 selfloop transitions, 5 changer transitions 0/540 dead transitions. [2025-03-17 11:11:38,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 540 transitions, 1351 flow [2025-03-17 11:11:38,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-17 11:11:38,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-17 11:11:38,791 INFO L175 Difference]: Start difference. First operand has 534 places, 538 transitions, 1305 flow. Second operand 3 states and 1640 transitions. [2025-03-17 11:11:38,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 540 transitions, 1351 flow [2025-03-17 11:11:38,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 540 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:38,797 INFO L231 Difference]: Finished difference. Result has 533 places, 538 transitions, 1327 flow [2025-03-17 11:11:38,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1327, PETRI_PLACES=533, PETRI_TRANSITIONS=538} [2025-03-17 11:11:38,798 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -2 predicate places. [2025-03-17 11:11:38,798 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 538 transitions, 1327 flow [2025-03-17 11:11:38,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.6666666666666) internal successors, (1622), 3 states have internal predecessors, (1622), 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:11:38,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:38,799 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:38,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:11:38,799 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:38,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1235187759, now seen corresponding path program 1 times [2025-03-17 11:11:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:38,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051256358] [2025-03-17 11:11:38,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:38,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-17 11:11:38,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-17 11:11:38,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:38,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 11:11:38,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:38,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051256358] [2025-03-17 11:11:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051256358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:38,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:38,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:11:38,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477272867] [2025-03-17 11:11:38,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:38,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:11:38,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:38,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:11:38,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:11:38,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-03-17 11:11:38,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 538 transitions, 1327 flow. Second operand has 4 states, 4 states have (on average 544.5) internal successors, (2178), 4 states have internal predecessors, (2178), 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:11:38,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:38,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-03-17 11:11:38,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:39,730 INFO L124 PetriNetUnfolderBase]: 197/4935 cut-off events. [2025-03-17 11:11:39,731 INFO L125 PetriNetUnfolderBase]: For 140/347 co-relation queries the response was YES. [2025-03-17 11:11:39,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5650 conditions, 4935 events. 197/4935 cut-off events. For 140/347 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 40355 event pairs, 45 based on Foata normal form. 4/4378 useless extension candidates. Maximal degree in co-relation 5319. Up to 105 conditions per place. [2025-03-17 11:11:39,811 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 25 selfloop transitions, 4 changer transitions 0/552 dead transitions. [2025-03-17 11:11:39,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 552 transitions, 1421 flow [2025-03-17 11:11:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:11:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:11:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2745 transitions. [2025-03-17 11:11:39,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9564459930313589 [2025-03-17 11:11:39,814 INFO L175 Difference]: Start difference. First operand has 533 places, 538 transitions, 1327 flow. Second operand 5 states and 2745 transitions. [2025-03-17 11:11:39,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 552 transitions, 1421 flow [2025-03-17 11:11:39,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 552 transitions, 1411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:39,820 INFO L231 Difference]: Finished difference. Result has 538 places, 540 transitions, 1342 flow [2025-03-17 11:11:39,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1342, PETRI_PLACES=538, PETRI_TRANSITIONS=540} [2025-03-17 11:11:39,821 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 3 predicate places. [2025-03-17 11:11:39,821 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 540 transitions, 1342 flow [2025-03-17 11:11:39,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.5) internal successors, (2178), 4 states have internal predecessors, (2178), 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:11:39,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:39,822 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:39,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:11:39,822 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:39,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1084145773, now seen corresponding path program 1 times [2025-03-17 11:11:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886065100] [2025-03-17 11:11:39,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:39,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-17 11:11:39,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-17 11:11:39,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:39,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 11:11:39,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:39,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886065100] [2025-03-17 11:11:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886065100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:39,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179485890] [2025-03-17 11:11:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:39,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:39,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:39,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:39,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-17 11:11:39,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 540 transitions, 1342 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:39,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:39,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-17 11:11:39,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:40,968 INFO L124 PetriNetUnfolderBase]: 293/6588 cut-off events. [2025-03-17 11:11:40,968 INFO L125 PetriNetUnfolderBase]: For 202/735 co-relation queries the response was YES. [2025-03-17 11:11:41,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7495 conditions, 6588 events. 293/6588 cut-off events. For 202/735 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 61080 event pairs, 86 based on Foata normal form. 7/5815 useless extension candidates. Maximal degree in co-relation 7162. Up to 213 conditions per place. [2025-03-17 11:11:41,068 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 17 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2025-03-17 11:11:41,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 541 transitions, 1384 flow [2025-03-17 11:11:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-03-17 11:11:41,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-03-17 11:11:41,071 INFO L175 Difference]: Start difference. First operand has 538 places, 540 transitions, 1342 flow. Second operand 3 states and 1641 transitions. [2025-03-17 11:11:41,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 541 transitions, 1384 flow [2025-03-17 11:11:41,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 541 transitions, 1384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:41,076 INFO L231 Difference]: Finished difference. Result has 539 places, 539 transitions, 1344 flow [2025-03-17 11:11:41,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1344, PETRI_PLACES=539, PETRI_TRANSITIONS=539} [2025-03-17 11:11:41,077 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-03-17 11:11:41,077 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 539 transitions, 1344 flow [2025-03-17 11:11:41,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:11:41,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:41,077 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:41,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:11:41,078 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:41,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:41,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1471027792, now seen corresponding path program 1 times [2025-03-17 11:11:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030648679] [2025-03-17 11:11:41,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:41,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:41,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-17 11:11:41,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-17 11:11:41,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:41,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 11:11:41,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030648679] [2025-03-17 11:11:41,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030648679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:11:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892843442] [2025-03-17 11:11:41,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:41,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:11:41,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:41,297 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:11:41,298 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:11:41,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-17 11:11:41,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-17 11:11:41,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:41,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:41,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:11:41,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:11:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 11:11:41,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:11:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 11:11:41,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892843442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:11:41,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:11:41,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-17 11:11:41,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968111105] [2025-03-17 11:11:41,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:11:41,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:11:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:41,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:11:41,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:11:42,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 574 [2025-03-17 11:11:42,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 539 transitions, 1344 flow. Second operand has 22 states, 22 states have (on average 518.1363636363636) internal successors, (11399), 22 states have internal predecessors, (11399), 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:11:42,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:42,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 574 [2025-03-17 11:11:42,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:42,967 INFO L124 PetriNetUnfolderBase]: 58/2446 cut-off events. [2025-03-17 11:11:42,968 INFO L125 PetriNetUnfolderBase]: For 78/97 co-relation queries the response was YES. [2025-03-17 11:11:43,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 2446 events. 58/2446 cut-off events. For 78/97 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14360 event pairs, 7 based on Foata normal form. 6/2225 useless extension candidates. Maximal degree in co-relation 2674. Up to 44 conditions per place. [2025-03-17 11:11:43,021 INFO L140 encePairwiseOnDemand]: 544/574 looper letters, 36 selfloop transitions, 57 changer transitions 0/569 dead transitions. [2025-03-17 11:11:43,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 569 transitions, 1674 flow [2025-03-17 11:11:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:11:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 11:11:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 8854 transitions. [2025-03-17 11:11:43,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9073580651772905 [2025-03-17 11:11:43,031 INFO L175 Difference]: Start difference. First operand has 539 places, 539 transitions, 1344 flow. Second operand 17 states and 8854 transitions. [2025-03-17 11:11:43,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 569 transitions, 1674 flow [2025-03-17 11:11:43,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 569 transitions, 1670 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:43,040 INFO L231 Difference]: Finished difference. Result has 556 places, 560 transitions, 1616 flow [2025-03-17 11:11:43,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1616, PETRI_PLACES=556, PETRI_TRANSITIONS=560} [2025-03-17 11:11:43,041 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 21 predicate places. [2025-03-17 11:11:43,041 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 560 transitions, 1616 flow [2025-03-17 11:11:43,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 518.1363636363636) internal successors, (11399), 22 states have internal predecessors, (11399), 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:11:43,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:43,044 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:43,057 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:11:43,244 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:11:43,245 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:43,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1400950992, now seen corresponding path program 2 times [2025-03-17 11:11:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:43,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051142679] [2025-03-17 11:11:43,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:11:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:43,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-03-17 11:11:43,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 402 statements. [2025-03-17 11:11:43,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:11:43,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 11:11:43,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:43,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051142679] [2025-03-17 11:11:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051142679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:43,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334773929] [2025-03-17 11:11:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:43,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:43,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:43,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:43,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-17 11:11:43,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 560 transitions, 1616 flow. Second operand has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 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:11:43,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:43,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-17 11:11:43,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:44,583 INFO L124 PetriNetUnfolderBase]: 153/3886 cut-off events. [2025-03-17 11:11:44,583 INFO L125 PetriNetUnfolderBase]: For 188/426 co-relation queries the response was YES. [2025-03-17 11:11:44,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4667 conditions, 3886 events. 153/3886 cut-off events. For 188/426 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 27324 event pairs, 17 based on Foata normal form. 16/3506 useless extension candidates. Maximal degree in co-relation 4426. Up to 139 conditions per place. [2025-03-17 11:11:44,664 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 30 selfloop transitions, 6 changer transitions 0/567 dead transitions. [2025-03-17 11:11:44,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 567 transitions, 1710 flow [2025-03-17 11:11:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3210 transitions. [2025-03-17 11:11:44,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320557491289199 [2025-03-17 11:11:44,666 INFO L175 Difference]: Start difference. First operand has 556 places, 560 transitions, 1616 flow. Second operand 6 states and 3210 transitions. [2025-03-17 11:11:44,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 567 transitions, 1710 flow [2025-03-17 11:11:44,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 567 transitions, 1632 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-17 11:11:44,675 INFO L231 Difference]: Finished difference. Result has 552 places, 559 transitions, 1548 flow [2025-03-17 11:11:44,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1548, PETRI_PLACES=552, PETRI_TRANSITIONS=559} [2025-03-17 11:11:44,676 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 17 predicate places. [2025-03-17 11:11:44,676 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 559 transitions, 1548 flow [2025-03-17 11:11:44,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 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:11:44,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:44,677 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:44,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:11:44,677 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:44,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1253550442, now seen corresponding path program 1 times [2025-03-17 11:11:44,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:44,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562767049] [2025-03-17 11:11:44,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:44,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:44,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-17 11:11:44,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-17 11:11:44,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:44,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 11:11:44,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:44,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562767049] [2025-03-17 11:11:44,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562767049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:44,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:44,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:44,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84397683] [2025-03-17 11:11:44,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:44,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:44,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:44,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:44,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:44,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-17 11:11:44,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 559 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 541.0) internal successors, (1623), 3 states have internal predecessors, (1623), 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:11:44,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:44,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-17 11:11:44,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:45,891 INFO L124 PetriNetUnfolderBase]: 344/6028 cut-off events. [2025-03-17 11:11:45,892 INFO L125 PetriNetUnfolderBase]: For 319/360 co-relation queries the response was YES. [2025-03-17 11:11:45,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7073 conditions, 6028 events. 344/6028 cut-off events. For 319/360 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 54556 event pairs, 84 based on Foata normal form. 24/5339 useless extension candidates. Maximal degree in co-relation 6560. Up to 316 conditions per place. [2025-03-17 11:11:45,963 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 13 selfloop transitions, 4 changer transitions 12/561 dead transitions. [2025-03-17 11:11:45,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 561 transitions, 1592 flow [2025-03-17 11:11:45,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-03-17 11:11:45,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-03-17 11:11:45,965 INFO L175 Difference]: Start difference. First operand has 552 places, 559 transitions, 1548 flow. Second operand 3 states and 1639 transitions. [2025-03-17 11:11:45,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 561 transitions, 1592 flow [2025-03-17 11:11:45,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 561 transitions, 1580 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:45,971 INFO L231 Difference]: Finished difference. Result has 548 places, 547 transitions, 1529 flow [2025-03-17 11:11:45,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=548, PETRI_TRANSITIONS=547} [2025-03-17 11:11:45,971 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 13 predicate places. [2025-03-17 11:11:45,972 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 547 transitions, 1529 flow [2025-03-17 11:11:45,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 541.0) internal successors, (1623), 3 states have internal predecessors, (1623), 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:11:45,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:45,972 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:45,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:11:45,972 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:45,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1033329612, now seen corresponding path program 1 times [2025-03-17 11:11:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:45,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266776047] [2025-03-17 11:11:45,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:45,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:45,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-17 11:11:46,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-17 11:11:46,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:46,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 11:11:46,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:46,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266776047] [2025-03-17 11:11:46,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266776047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:46,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:46,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888752011] [2025-03-17 11:11:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:46,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:46,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:46,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:46,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:46,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-17 11:11:46,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 547 transitions, 1529 flow. Second operand has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 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:11:46,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:46,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-17 11:11:46,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:47,840 INFO L124 PetriNetUnfolderBase]: 160/4421 cut-off events. [2025-03-17 11:11:47,840 INFO L125 PetriNetUnfolderBase]: For 223/260 co-relation queries the response was YES. [2025-03-17 11:11:47,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 4421 events. 160/4421 cut-off events. For 223/260 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 32583 event pairs, 22 based on Foata normal form. 8/4058 useless extension candidates. Maximal degree in co-relation 5392. Up to 126 conditions per place. [2025-03-17 11:11:47,929 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-03-17 11:11:47,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 554 transitions, 1621 flow [2025-03-17 11:11:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-03-17 11:11:47,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-03-17 11:11:47,931 INFO L175 Difference]: Start difference. First operand has 548 places, 547 transitions, 1529 flow. Second operand 6 states and 3209 transitions. [2025-03-17 11:11:47,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 554 transitions, 1621 flow [2025-03-17 11:11:47,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 554 transitions, 1613 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:47,940 INFO L231 Difference]: Finished difference. Result has 539 places, 546 transitions, 1531 flow [2025-03-17 11:11:47,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=539, PETRI_TRANSITIONS=546} [2025-03-17 11:11:47,940 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-03-17 11:11:47,940 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 546 transitions, 1531 flow [2025-03-17 11:11:47,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 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:11:47,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:47,941 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:47,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:11:47,941 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:47,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:47,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1989099214, now seen corresponding path program 1 times [2025-03-17 11:11:47,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:47,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398776725] [2025-03-17 11:11:47,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:47,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:47,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-17 11:11:47,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-17 11:11:47,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:47,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 11:11:48,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:48,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398776725] [2025-03-17 11:11:48,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398776725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:48,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:48,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:48,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827300685] [2025-03-17 11:11:48,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:48,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:48,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:48,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:48,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:48,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-17 11:11:48,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 546 transitions, 1531 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:11:48,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:48,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-17 11:11:48,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:50,093 INFO L124 PetriNetUnfolderBase]: 480/10385 cut-off events. [2025-03-17 11:11:50,093 INFO L125 PetriNetUnfolderBase]: For 298/315 co-relation queries the response was YES. [2025-03-17 11:11:50,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12050 conditions, 10385 events. 480/10385 cut-off events. For 298/315 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 107023 event pairs, 141 based on Foata normal form. 1/9408 useless extension candidates. Maximal degree in co-relation 11536. Up to 573 conditions per place. [2025-03-17 11:11:50,190 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2025-03-17 11:11:50,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 549 transitions, 1570 flow [2025-03-17 11:11:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-03-17 11:11:50,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-03-17 11:11:50,192 INFO L175 Difference]: Start difference. First operand has 539 places, 546 transitions, 1531 flow. Second operand 3 states and 1649 transitions. [2025-03-17 11:11:50,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 549 transitions, 1570 flow [2025-03-17 11:11:50,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 549 transitions, 1558 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:50,201 INFO L231 Difference]: Finished difference. Result has 535 places, 546 transitions, 1529 flow [2025-03-17 11:11:50,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=535, PETRI_TRANSITIONS=546} [2025-03-17 11:11:50,202 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 0 predicate places. [2025-03-17 11:11:50,202 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 546 transitions, 1529 flow [2025-03-17 11:11:50,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:11:50,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:50,202 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:50,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:11:50,203 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:50,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash 250379926, now seen corresponding path program 1 times [2025-03-17 11:11:50,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:50,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744489011] [2025-03-17 11:11:50,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:50,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:50,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-17 11:11:50,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-17 11:11:50,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:50,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 11:11:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744489011] [2025-03-17 11:11:50,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744489011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:50,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:50,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:11:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93349541] [2025-03-17 11:11:50,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:50,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:11:50,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:50,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:11:50,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:11:50,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-03-17 11:11:50,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 546 transitions, 1529 flow. Second operand has 4 states, 4 states have (on average 544.75) internal successors, (2179), 4 states have internal predecessors, (2179), 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:11:50,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:50,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-03-17 11:11:50,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:52,113 INFO L124 PetriNetUnfolderBase]: 464/8938 cut-off events. [2025-03-17 11:11:52,113 INFO L125 PetriNetUnfolderBase]: For 450/487 co-relation queries the response was YES. [2025-03-17 11:11:52,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10867 conditions, 8938 events. 464/8938 cut-off events. For 450/487 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 94267 event pairs, 188 based on Foata normal form. 0/7998 useless extension candidates. Maximal degree in co-relation 10353. Up to 519 conditions per place. [2025-03-17 11:11:52,227 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 20 selfloop transitions, 4 changer transitions 0/556 dead transitions. [2025-03-17 11:11:52,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 556 transitions, 1601 flow [2025-03-17 11:11:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:11:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:11:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2740 transitions. [2025-03-17 11:11:52,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547038327526133 [2025-03-17 11:11:52,229 INFO L175 Difference]: Start difference. First operand has 535 places, 546 transitions, 1529 flow. Second operand 5 states and 2740 transitions. [2025-03-17 11:11:52,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 556 transitions, 1601 flow [2025-03-17 11:11:52,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 556 transitions, 1601 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:52,236 INFO L231 Difference]: Finished difference. Result has 542 places, 548 transitions, 1554 flow [2025-03-17 11:11:52,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=548} [2025-03-17 11:11:52,237 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 7 predicate places. [2025-03-17 11:11:52,237 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 548 transitions, 1554 flow [2025-03-17 11:11:52,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.75) internal successors, (2179), 4 states have internal predecessors, (2179), 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:11:52,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:52,238 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:52,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:11:52,238 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:52,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash -36491305, now seen corresponding path program 1 times [2025-03-17 11:11:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665822880] [2025-03-17 11:11:52,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:52,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-17 11:11:52,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-17 11:11:52,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:52,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 11:11:52,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:52,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665822880] [2025-03-17 11:11:52,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665822880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:52,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:52,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:52,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486225696] [2025-03-17 11:11:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:52,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:52,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:52,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:52,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:53,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-17 11:11:53,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 548 transitions, 1554 flow. Second operand has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 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:11:53,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:53,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-17 11:11:53,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:54,938 INFO L124 PetriNetUnfolderBase]: 462/8687 cut-off events. [2025-03-17 11:11:54,939 INFO L125 PetriNetUnfolderBase]: For 706/757 co-relation queries the response was YES. [2025-03-17 11:11:55,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11117 conditions, 8687 events. 462/8687 cut-off events. For 706/757 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 91064 event pairs, 78 based on Foata normal form. 0/7980 useless extension candidates. Maximal degree in co-relation 10538. Up to 282 conditions per place. [2025-03-17 11:11:55,063 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/555 dead transitions. [2025-03-17 11:11:55,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 555 transitions, 1646 flow [2025-03-17 11:11:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-03-17 11:11:55,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-03-17 11:11:55,065 INFO L175 Difference]: Start difference. First operand has 542 places, 548 transitions, 1554 flow. Second operand 6 states and 3209 transitions. [2025-03-17 11:11:55,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 555 transitions, 1646 flow [2025-03-17 11:11:55,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 555 transitions, 1646 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:55,074 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1564 flow [2025-03-17 11:11:55,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1564, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2025-03-17 11:11:55,075 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 11 predicate places. [2025-03-17 11:11:55,075 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1564 flow [2025-03-17 11:11:55,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 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:11:55,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:55,076 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:55,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:11:55,076 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:55,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1703302426, now seen corresponding path program 1 times [2025-03-17 11:11:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:55,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843642172] [2025-03-17 11:11:55,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:55,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-17 11:11:55,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-17 11:11:55,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:55,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 11:11:55,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:55,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843642172] [2025-03-17 11:11:55,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843642172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:55,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:55,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:55,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804618371] [2025-03-17 11:11:55,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:55,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:55,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:55,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:55,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:55,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-17 11:11:55,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1564 flow. Second operand has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 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:11:55,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:55,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-17 11:11:55,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:57,436 INFO L124 PetriNetUnfolderBase]: 676/8755 cut-off events. [2025-03-17 11:11:57,436 INFO L125 PetriNetUnfolderBase]: For 1131/1172 co-relation queries the response was YES. [2025-03-17 11:11:57,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11996 conditions, 8755 events. 676/8755 cut-off events. For 1131/1172 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 93881 event pairs, 366 based on Foata normal form. 0/8004 useless extension candidates. Maximal degree in co-relation 11478. Up to 936 conditions per place. [2025-03-17 11:11:57,591 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 2 changer transitions 1/548 dead transitions. [2025-03-17 11:11:57,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 548 transitions, 1602 flow [2025-03-17 11:11:57,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-03-17 11:11:57,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-03-17 11:11:57,592 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1564 flow. Second operand 3 states and 1639 transitions. [2025-03-17 11:11:57,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 548 transitions, 1602 flow [2025-03-17 11:11:57,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 548 transitions, 1590 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:57,603 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1554 flow [2025-03-17 11:11:57,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2025-03-17 11:11:57,604 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 7 predicate places. [2025-03-17 11:11:57,604 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1554 flow [2025-03-17 11:11:57,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 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:11:57,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:57,604 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:57,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:11:57,605 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:11:57,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1522992021, now seen corresponding path program 1 times [2025-03-17 11:11:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:57,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897587540] [2025-03-17 11:11:57,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:57,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-17 11:11:57,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-17 11:11:57,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:57,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 11:11:58,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:58,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897587540] [2025-03-17 11:11:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897587540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:58,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:58,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:58,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635338547] [2025-03-17 11:11:58,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:58,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:58,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:58,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:58,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:58,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-17 11:11:58,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1554 flow. Second operand has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 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:11:58,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:58,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-17 11:11:58,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:00,138 INFO L124 PetriNetUnfolderBase]: 216/6466 cut-off events. [2025-03-17 11:12:00,139 INFO L125 PetriNetUnfolderBase]: For 345/427 co-relation queries the response was YES. [2025-03-17 11:12:00,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 6466 events. 216/6466 cut-off events. For 345/427 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 55551 event pairs, 39 based on Foata normal form. 2/6077 useless extension candidates. Maximal degree in co-relation 7905. Up to 152 conditions per place. [2025-03-17 11:12:00,303 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/553 dead transitions. [2025-03-17 11:12:00,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 553 transitions, 1646 flow [2025-03-17 11:12:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-03-17 11:12:00,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-03-17 11:12:00,305 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1554 flow. Second operand 6 states and 3209 transitions. [2025-03-17 11:12:00,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 553 transitions, 1646 flow [2025-03-17 11:12:00,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 553 transitions, 1642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:00,314 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1560 flow [2025-03-17 11:12:00,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1560, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2025-03-17 11:12:00,315 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 9 predicate places. [2025-03-17 11:12:00,315 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1560 flow [2025-03-17 11:12:00,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 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:12:00,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:00,316 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:00,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:12:00,316 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:12:00,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1701228356, now seen corresponding path program 1 times [2025-03-17 11:12:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573131385] [2025-03-17 11:12:00,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:00,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-17 11:12:00,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-17 11:12:00,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:00,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 11:12:00,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:00,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573131385] [2025-03-17 11:12:00,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573131385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:00,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:00,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:00,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386409101] [2025-03-17 11:12:00,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:00,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:00,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:00,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:00,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:01,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-17 11:12:01,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1560 flow. Second operand has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 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:12:01,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:01,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-17 11:12:01,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:03,125 INFO L124 PetriNetUnfolderBase]: 512/8653 cut-off events. [2025-03-17 11:12:03,125 INFO L125 PetriNetUnfolderBase]: For 775/816 co-relation queries the response was YES. [2025-03-17 11:12:03,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11257 conditions, 8653 events. 512/8653 cut-off events. For 775/816 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 90397 event pairs, 76 based on Foata normal form. 8/8123 useless extension candidates. Maximal degree in co-relation 10678. Up to 320 conditions per place. [2025-03-17 11:12:03,288 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/552 dead transitions. [2025-03-17 11:12:03,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 552 transitions, 1652 flow [2025-03-17 11:12:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-03-17 11:12:03,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-03-17 11:12:03,291 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1560 flow. Second operand 6 states and 3209 transitions. [2025-03-17 11:12:03,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 552 transitions, 1652 flow [2025-03-17 11:12:03,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 552 transitions, 1640 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:12:03,423 INFO L231 Difference]: Finished difference. Result has 543 places, 544 transitions, 1558 flow [2025-03-17 11:12:03,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=543, PETRI_TRANSITIONS=544} [2025-03-17 11:12:03,423 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 8 predicate places. [2025-03-17 11:12:03,423 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 544 transitions, 1558 flow [2025-03-17 11:12:03,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 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:12:03,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:03,424 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:03,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:12:03,424 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:12:03,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1960455773, now seen corresponding path program 1 times [2025-03-17 11:12:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:03,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578056117] [2025-03-17 11:12:03,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:03,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:03,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-17 11:12:03,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-17 11:12:03,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:03,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-17 11:12:03,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:03,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578056117] [2025-03-17 11:12:03,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578056117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:03,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:03,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:03,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74638613] [2025-03-17 11:12:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:03,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:03,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:03,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:03,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:03,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-17 11:12:03,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 544 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 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:12:03,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:03,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-17 11:12:03,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:05,485 INFO L124 PetriNetUnfolderBase]: 226/7968 cut-off events. [2025-03-17 11:12:05,485 INFO L125 PetriNetUnfolderBase]: For 376/602 co-relation queries the response was YES. [2025-03-17 11:12:05,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10222 conditions, 7968 events. 226/7968 cut-off events. For 376/602 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 73688 event pairs, 84 based on Foata normal form. 10/7639 useless extension candidates. Maximal degree in co-relation 10060. Up to 301 conditions per place. [2025-03-17 11:12:05,673 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2025-03-17 11:12:05,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 545 transitions, 1596 flow [2025-03-17 11:12:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-03-17 11:12:05,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-03-17 11:12:05,675 INFO L175 Difference]: Start difference. First operand has 543 places, 544 transitions, 1558 flow. Second operand 3 states and 1639 transitions. [2025-03-17 11:12:05,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 545 transitions, 1596 flow [2025-03-17 11:12:05,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 545 transitions, 1584 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:12:05,687 INFO L231 Difference]: Finished difference. Result has 539 places, 543 transitions, 1550 flow [2025-03-17 11:12:05,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1550, PETRI_PLACES=539, PETRI_TRANSITIONS=543} [2025-03-17 11:12:05,688 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-03-17 11:12:05,688 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 543 transitions, 1550 flow [2025-03-17 11:12:05,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 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:12:05,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:05,688 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:05,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:12:05,688 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:12:05,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:05,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1825399076, now seen corresponding path program 1 times [2025-03-17 11:12:05,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:05,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064309653] [2025-03-17 11:12:05,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:05,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:05,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-17 11:12:05,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-17 11:12:05,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:05,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-17 11:12:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064309653] [2025-03-17 11:12:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064309653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:05,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:05,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949679750] [2025-03-17 11:12:05,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:05,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:05,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:05,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:05,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:05,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-17 11:12:05,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 543 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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:12:05,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:05,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-17 11:12:05,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:07,756 INFO L124 PetriNetUnfolderBase]: 325/8405 cut-off events. [2025-03-17 11:12:07,756 INFO L125 PetriNetUnfolderBase]: For 458/595 co-relation queries the response was YES. [2025-03-17 11:12:07,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10474 conditions, 8405 events. 325/8405 cut-off events. For 458/595 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 80516 event pairs, 166 based on Foata normal form. 0/7984 useless extension candidates. Maximal degree in co-relation 9956. Up to 367 conditions per place. [2025-03-17 11:12:07,953 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2025-03-17 11:12:07,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 544 transitions, 1588 flow [2025-03-17 11:12:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-03-17 11:12:07,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-03-17 11:12:07,954 INFO L175 Difference]: Start difference. First operand has 539 places, 543 transitions, 1550 flow. Second operand 3 states and 1639 transitions. [2025-03-17 11:12:07,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 544 transitions, 1588 flow [2025-03-17 11:12:07,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 544 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:07,962 INFO L231 Difference]: Finished difference. Result has 538 places, 542 transitions, 1548 flow [2025-03-17 11:12:07,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=538, PETRI_TRANSITIONS=542} [2025-03-17 11:12:07,963 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 3 predicate places. [2025-03-17 11:12:07,963 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 542 transitions, 1548 flow [2025-03-17 11:12:07,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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:12:07,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:07,964 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:07,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:12:07,964 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-17 11:12:07,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:07,965 INFO L85 PathProgramCache]: Analyzing trace with hash 492671723, now seen corresponding path program 1 times [2025-03-17 11:12:07,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:07,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142813516] [2025-03-17 11:12:07,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:07,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:07,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-17 11:12:07,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-17 11:12:07,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:07,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-17 11:12:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:08,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142813516] [2025-03-17 11:12:08,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142813516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:08,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:08,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:08,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538136585] [2025-03-17 11:12:08,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:08,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:08,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:08,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:08,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:08,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-17 11:12:08,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 542 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:12:08,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:08,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-17 11:12:08,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:09,907 INFO L124 PetriNetUnfolderBase]: 620/8668 cut-off events. [2025-03-17 11:12:09,907 INFO L125 PetriNetUnfolderBase]: For 886/915 co-relation queries the response was YES. [2025-03-17 11:12:10,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11419 conditions, 8668 events. 620/8668 cut-off events. For 886/915 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 93072 event pairs, 344 based on Foata normal form. 0/8155 useless extension candidates. Maximal degree in co-relation 10901. Up to 890 conditions per place. [2025-03-17 11:12:10,018 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 0 selfloop transitions, 0 changer transitions 543/543 dead transitions. [2025-03-17 11:12:10,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 543 transitions, 1586 flow [2025-03-17 11:12:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-03-17 11:12:10,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-03-17 11:12:10,020 INFO L175 Difference]: Start difference. First operand has 538 places, 542 transitions, 1548 flow. Second operand 3 states and 1639 transitions. [2025-03-17 11:12:10,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 543 transitions, 1586 flow [2025-03-17 11:12:10,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 543 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:10,029 INFO L231 Difference]: Finished difference. Result has 537 places, 0 transitions, 0 flow [2025-03-17 11:12:10,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=537, PETRI_TRANSITIONS=0} [2025-03-17 11:12:10,029 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 2 predicate places. [2025-03-17 11:12:10,029 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 0 transitions, 0 flow [2025-03-17 11:12:10,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (80 of 81 remaining) [2025-03-17 11:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (79 of 81 remaining) [2025-03-17 11:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (78 of 81 remaining) [2025-03-17 11:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (77 of 81 remaining) [2025-03-17 11:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (76 of 81 remaining) [2025-03-17 11:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 81 remaining) [2025-03-17 11:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 81 remaining) [2025-03-17 11:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 81 remaining) [2025-03-17 11:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 81 remaining) [2025-03-17 11:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (71 of 81 remaining) [2025-03-17 11:12:10,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (70 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (69 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (68 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (67 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (66 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (65 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (63 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (61 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (60 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (58 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (57 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (56 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (55 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (54 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (53 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (52 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (51 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (50 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (49 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (47 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (46 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (45 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (44 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (43 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (42 of 81 remaining) [2025-03-17 11:12:10,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (32 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (31 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (30 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (29 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (22 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (20 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (18 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 81 remaining) [2025-03-17 11:12:10,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 81 remaining) [2025-03-17 11:12:10,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 81 remaining) [2025-03-17 11:12:10,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 81 remaining) [2025-03-17 11:12:10,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 81 remaining) [2025-03-17 11:12:10,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 81 remaining) [2025-03-17 11:12:10,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (2 of 81 remaining) [2025-03-17 11:12:10,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (1 of 81 remaining) [2025-03-17 11:12:10,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 81 remaining) [2025-03-17 11:12:10,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:12:10,035 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:10,039 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:12:10,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:12:10,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:12:10 BasicIcfg [2025-03-17 11:12:10,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:12:10,045 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:12:10,045 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:12:10,045 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:12:10,046 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:24" (3/4) ... [2025-03-17 11:12:10,047 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:12:10,049 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:12:10,050 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:12:10,050 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:12:10,054 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-17 11:12:10,055 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:12:10,055 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:12:10,055 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:12:10,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:12:10,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:12:10,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:12:10,131 INFO L158 Benchmark]: Toolchain (without parser) took 46652.97ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 104.9MB in the beginning and 1.1GB in the end (delta: -976.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-17 11:12:10,132 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:10,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.73ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 91.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:12:10,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.84ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:10,133 INFO L158 Benchmark]: Boogie Preprocessor took 27.08ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 85.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:10,134 INFO L158 Benchmark]: IcfgBuilder took 704.50ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 46.3MB in the end (delta: 39.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 11:12:10,134 INFO L158 Benchmark]: TraceAbstraction took 45532.03ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 46.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-17 11:12:10,134 INFO L158 Benchmark]: Witness Printer took 85.64ms. Allocated memory is still 2.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:12:10,135 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.73ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 91.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.84ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.08ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 85.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 704.50ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 46.3MB in the end (delta: 39.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 45532.03ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 46.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 85.64ms. Allocated memory is still 2.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 848 locations, 889 edges, 81 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 45.3s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 37.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3969 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2607 mSDsluCounter, 1588 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1335 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7074 IncrementalHoareTripleChecker+Invalid, 7797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 253 mSDtfsCounter, 7074 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 1078 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1616occurred in iteration=25, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 10233 NumberOfCodeBlocks, 9873 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10720 ConstructedInterpolants, 0 QuantifiedInterpolants, 12782 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 6748/6895 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:12:10,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE