./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:38:40,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:38:40,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:38:40,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:38:40,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:38:40,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:38:40,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:38:40,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:38:40,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:38:40,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:38:40,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:38:40,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:38:40,750 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:38:40,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:38:40,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:38:40,750 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:38:40,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:38:40,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:38:40,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:38:40,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:38:40,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:38:40,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:38:40,751 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:38:40,751 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:38:40,752 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:38:40,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:38:40,752 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:38:40,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:38:40,752 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:38:40,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:38:40,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:38:40,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:40,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:38:40,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:38:40,753 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:38:40,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:38:40,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:38:40,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:38:40,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:38:40,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:38:40,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:38:40,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:38:40,753 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2025-02-08 05:38:41,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:38:41,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:38:41,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:38:41,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:38:41,016 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:38:41,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-02-08 05:38:42,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/309b51002/c88e7ad93cc44eb5a21c6487b67e15b6/FLAG9163ef71a [2025-02-08 05:38:42,543 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:38:42,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-02-08 05:38:42,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/309b51002/c88e7ad93cc44eb5a21c6487b67e15b6/FLAG9163ef71a [2025-02-08 05:38:42,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/309b51002/c88e7ad93cc44eb5a21c6487b67e15b6 [2025-02-08 05:38:42,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:38:42,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:38:42,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:42,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:38:42,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:38:42,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b5d94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42, skipping insertion in model container [2025-02-08 05:38:42,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:38:42,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:42,774 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:38:42,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:42,829 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:38:42,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42 WrapperNode [2025-02-08 05:38:42,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:42,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:42,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:38:42,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:38:42,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,876 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 185 [2025-02-08 05:38:42,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:42,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:38:42,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:38:42,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:38:42,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:38:42,927 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:38:42,927 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:38:42,927 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:38:42,928 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (1/1) ... [2025-02-08 05:38:42,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:42,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:42,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:38:42,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:38:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:38:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:38:42,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:38:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:38:42,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:38:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:38:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:38:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:38:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:38:42,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:38:42,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:38:42,988 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:38:43,094 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:38:43,096 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:38:43,746 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:38:43,746 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:38:43,766 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:38:43,766 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:38:43,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:43 BoogieIcfgContainer [2025-02-08 05:38:43,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:38:43,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:38:43,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:38:43,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:38:43,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:38:42" (1/3) ... [2025-02-08 05:38:43,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2039fa99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:43, skipping insertion in model container [2025-02-08 05:38:43,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:42" (2/3) ... [2025-02-08 05:38:43,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2039fa99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:43, skipping insertion in model container [2025-02-08 05:38:43,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:43" (3/3) ... [2025-02-08 05:38:43,778 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-02-08 05:38:43,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:38:43,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 450 locations, 1 initial locations, 4 loop locations, and 54 error locations. [2025-02-08 05:38:43,790 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:38:43,955 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:38:44,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 473 transitions, 960 flow [2025-02-08 05:38:44,173 INFO L124 PetriNetUnfolderBase]: 24/471 cut-off events. [2025-02-08 05:38:44,176 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:38:44,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 471 events. 24/471 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1104 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 290. Up to 3 conditions per place. [2025-02-08 05:38:44,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 473 transitions, 960 flow [2025-02-08 05:38:44,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 436 places, 451 transitions, 914 flow [2025-02-08 05:38:44,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:38:44,223 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;@5f1ac88a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:38:44,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-02-08 05:38:44,227 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:38:44,228 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:38:44,229 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:38:44,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,229 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] [2025-02-08 05:38:44,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:44,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1051833652, now seen corresponding path program 1 times [2025-02-08 05:38:44,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330450690] [2025-02-08 05:38:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:44,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:38:44,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:38:44,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:44,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:44,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:44,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330450690] [2025-02-08 05:38:44,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330450690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:44,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:44,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950760687] [2025-02-08 05:38:44,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:44,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:44,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:44,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:44,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:44,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-02-08 05:38:44,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 451 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:44,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:44,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-02-08 05:38:44,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:44,674 INFO L124 PetriNetUnfolderBase]: 37/782 cut-off events. [2025-02-08 05:38:44,674 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:38:44,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 782 events. 37/782 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3435 event pairs, 8 based on Foata normal form. 13/648 useless extension candidates. Maximal degree in co-relation 591. Up to 28 conditions per place. [2025-02-08 05:38:44,685 INFO L140 encePairwiseOnDemand]: 462/473 looper letters, 11 selfloop transitions, 2 changer transitions 6/442 dead transitions. [2025-02-08 05:38:44,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 442 transitions, 922 flow [2025-02-08 05:38:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1366 transitions. [2025-02-08 05:38:44,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9626497533474278 [2025-02-08 05:38:44,708 INFO L175 Difference]: Start difference. First operand has 436 places, 451 transitions, 914 flow. Second operand 3 states and 1366 transitions. [2025-02-08 05:38:44,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 442 transitions, 922 flow [2025-02-08 05:38:44,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 442 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:38:44,725 INFO L231 Difference]: Finished difference. Result has 433 places, 436 transitions, 880 flow [2025-02-08 05:38:44,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=433, PETRI_TRANSITIONS=436} [2025-02-08 05:38:44,733 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -3 predicate places. [2025-02-08 05:38:44,733 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 436 transitions, 880 flow [2025-02-08 05:38:44,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:44,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,735 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] [2025-02-08 05:38:44,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:38:44,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:44,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1212271600, now seen corresponding path program 1 times [2025-02-08 05:38:44,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389776910] [2025-02-08 05:38:44,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:44,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:38:44,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:38:44,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:44,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:44,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:44,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389776910] [2025-02-08 05:38:44,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389776910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:44,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984591442] [2025-02-08 05:38:44,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:44,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:44,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:44,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:44,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:44,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-02-08 05:38:44,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 436 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:44,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:44,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-02-08 05:38:44,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:44,968 INFO L124 PetriNetUnfolderBase]: 37/766 cut-off events. [2025-02-08 05:38:44,969 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:44,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 766 events. 37/766 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3392 event pairs, 8 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 772. Up to 28 conditions per place. [2025-02-08 05:38:44,975 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-02-08 05:38:44,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 435 transitions, 904 flow [2025-02-08 05:38:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-08 05:38:44,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-08 05:38:44,980 INFO L175 Difference]: Start difference. First operand has 433 places, 436 transitions, 880 flow. Second operand 3 states and 1358 transitions. [2025-02-08 05:38:44,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 435 transitions, 904 flow [2025-02-08 05:38:44,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 435 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:44,988 INFO L231 Difference]: Finished difference. Result has 426 places, 435 transitions, 878 flow [2025-02-08 05:38:44,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=426, PETRI_TRANSITIONS=435} [2025-02-08 05:38:44,990 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -10 predicate places. [2025-02-08 05:38:44,990 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 435 transitions, 878 flow [2025-02-08 05:38:44,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:44,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,992 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] [2025-02-08 05:38:44,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:38:44,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:44,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1791721410, now seen corresponding path program 1 times [2025-02-08 05:38:44,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117020423] [2025-02-08 05:38:44,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:38:45,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:38:45,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:45,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117020423] [2025-02-08 05:38:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117020423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394010027] [2025-02-08 05:38:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-02-08 05:38:45,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 435 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-02-08 05:38:45,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-02-08 05:38:45,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,205 INFO L124 PetriNetUnfolderBase]: 32/674 cut-off events. [2025-02-08 05:38:45,205 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:38:45,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 674 events. 32/674 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2600 event pairs, 8 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 673. Up to 29 conditions per place. [2025-02-08 05:38:45,212 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-02-08 05:38:45,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 434 transitions, 904 flow [2025-02-08 05:38:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2025-02-08 05:38:45,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9556025369978859 [2025-02-08 05:38:45,216 INFO L175 Difference]: Start difference. First operand has 426 places, 435 transitions, 878 flow. Second operand 3 states and 1356 transitions. [2025-02-08 05:38:45,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 434 transitions, 904 flow [2025-02-08 05:38:45,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 434 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,222 INFO L231 Difference]: Finished difference. Result has 425 places, 434 transitions, 876 flow [2025-02-08 05:38:45,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=425, PETRI_TRANSITIONS=434} [2025-02-08 05:38:45,224 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2025-02-08 05:38:45,224 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 434 transitions, 876 flow [2025-02-08 05:38:45,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-02-08 05:38:45,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,225 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] [2025-02-08 05:38:45,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:45,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:45,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2032644587, now seen corresponding path program 1 times [2025-02-08 05:38:45,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156815162] [2025-02-08 05:38:45,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:38:45,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:38:45,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:45,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156815162] [2025-02-08 05:38:45,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156815162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802026490] [2025-02-08 05:38:45,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-02-08 05:38:45,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 434 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-02-08 05:38:45,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-02-08 05:38:45,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,458 INFO L124 PetriNetUnfolderBase]: 36/761 cut-off events. [2025-02-08 05:38:45,459 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:38:45,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 761 events. 36/761 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3190 event pairs, 8 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 753. Up to 30 conditions per place. [2025-02-08 05:38:45,469 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-02-08 05:38:45,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 433 transitions, 902 flow [2025-02-08 05:38:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2025-02-08 05:38:45,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9556025369978859 [2025-02-08 05:38:45,473 INFO L175 Difference]: Start difference. First operand has 425 places, 434 transitions, 876 flow. Second operand 3 states and 1356 transitions. [2025-02-08 05:38:45,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 433 transitions, 902 flow [2025-02-08 05:38:45,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 433 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,480 INFO L231 Difference]: Finished difference. Result has 424 places, 433 transitions, 874 flow [2025-02-08 05:38:45,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=424, PETRI_TRANSITIONS=433} [2025-02-08 05:38:45,481 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2025-02-08 05:38:45,481 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 433 transitions, 874 flow [2025-02-08 05:38:45,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-02-08 05:38:45,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,482 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] [2025-02-08 05:38:45,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:45,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:45,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1515680932, now seen corresponding path program 1 times [2025-02-08 05:38:45,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691358272] [2025-02-08 05:38:45,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:38:45,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:38:45,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:45,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691358272] [2025-02-08 05:38:45,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691358272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677970166] [2025-02-08 05:38:45,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 473 [2025-02-08 05:38:45,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 433 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-02-08 05:38:45,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 473 [2025-02-08 05:38:45,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,718 INFO L124 PetriNetUnfolderBase]: 83/1184 cut-off events. [2025-02-08 05:38:45,718 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-02-08 05:38:45,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1184 events. 83/1184 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6771 event pairs, 24 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1221. Up to 81 conditions per place. [2025-02-08 05:38:45,729 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 1 changer transitions 0/428 dead transitions. [2025-02-08 05:38:45,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 428 transitions, 894 flow [2025-02-08 05:38:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2025-02-08 05:38:45,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506694855532065 [2025-02-08 05:38:45,732 INFO L175 Difference]: Start difference. First operand has 424 places, 433 transitions, 874 flow. Second operand 3 states and 1349 transitions. [2025-02-08 05:38:45,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 428 transitions, 894 flow [2025-02-08 05:38:45,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 428 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,738 INFO L231 Difference]: Finished difference. Result has 419 places, 428 transitions, 862 flow [2025-02-08 05:38:45,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=419, PETRI_TRANSITIONS=428} [2025-02-08 05:38:45,739 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -17 predicate places. [2025-02-08 05:38:45,739 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 428 transitions, 862 flow [2025-02-08 05:38:45,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-02-08 05:38:45,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,741 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-02-08 05:38:45,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:45,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:45,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1084118604, now seen corresponding path program 1 times [2025-02-08 05:38:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207363422] [2025-02-08 05:38:45,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:38:45,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:38:45,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:46,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207363422] [2025-02-08 05:38:46,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207363422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768697639] [2025-02-08 05:38:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:46,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:46,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 473 [2025-02-08 05:38:46,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 428 transitions, 862 flow. Second operand has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 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-02-08 05:38:46,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 473 [2025-02-08 05:38:46,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,174 INFO L124 PetriNetUnfolderBase]: 429/2630 cut-off events. [2025-02-08 05:38:47,175 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2025-02-08 05:38:47,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3352 conditions, 2630 events. 429/2630 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19422 event pairs, 288 based on Foata normal form. 0/2187 useless extension candidates. Maximal degree in co-relation 3297. Up to 691 conditions per place. [2025-02-08 05:38:47,193 INFO L140 encePairwiseOnDemand]: 461/473 looper letters, 52 selfloop transitions, 10 changer transitions 0/426 dead transitions. [2025-02-08 05:38:47,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 426 transitions, 982 flow [2025-02-08 05:38:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2025-02-08 05:38:47,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661028893587033 [2025-02-08 05:38:47,199 INFO L175 Difference]: Start difference. First operand has 419 places, 428 transitions, 862 flow. Second operand 6 states and 2458 transitions. [2025-02-08 05:38:47,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 426 transitions, 982 flow [2025-02-08 05:38:47,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 426 transitions, 981 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:47,206 INFO L231 Difference]: Finished difference. Result has 421 places, 426 transitions, 877 flow [2025-02-08 05:38:47,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=877, PETRI_PLACES=421, PETRI_TRANSITIONS=426} [2025-02-08 05:38:47,208 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -15 predicate places. [2025-02-08 05:38:47,208 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 426 transitions, 877 flow [2025-02-08 05:38:47,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 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-02-08 05:38:47,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:47,210 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-02-08 05:38:47,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:47,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:47,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash -808296099, now seen corresponding path program 1 times [2025-02-08 05:38:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:47,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124283638] [2025-02-08 05:38:47,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:47,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:47,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:38:47,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:38:47,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:47,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:47,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:47,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124283638] [2025-02-08 05:38:47,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124283638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:47,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:47,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:47,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011330537] [2025-02-08 05:38:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:47,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:47,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:47,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:47,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-02-08 05:38:47,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 426 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:47,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:47,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-02-08 05:38:47,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,395 INFO L124 PetriNetUnfolderBase]: 32/661 cut-off events. [2025-02-08 05:38:47,396 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:38:47,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 661 events. 32/661 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2474 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 675. Up to 28 conditions per place. [2025-02-08 05:38:47,401 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2025-02-08 05:38:47,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 425 transitions, 901 flow [2025-02-08 05:38:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-08 05:38:47,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-08 05:38:47,404 INFO L175 Difference]: Start difference. First operand has 421 places, 426 transitions, 877 flow. Second operand 3 states and 1358 transitions. [2025-02-08 05:38:47,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 425 transitions, 901 flow [2025-02-08 05:38:47,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 425 transitions, 881 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:47,411 INFO L231 Difference]: Finished difference. Result has 417 places, 425 transitions, 859 flow [2025-02-08 05:38:47,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=417, PETRI_TRANSITIONS=425} [2025-02-08 05:38:47,412 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -19 predicate places. [2025-02-08 05:38:47,412 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 425 transitions, 859 flow [2025-02-08 05:38:47,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:47,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:47,413 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] [2025-02-08 05:38:47,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:47,414 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:47,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash -204137640, now seen corresponding path program 1 times [2025-02-08 05:38:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:47,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042624571] [2025-02-08 05:38:47,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:47,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:38:47,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:38:47,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:47,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:47,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:47,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042624571] [2025-02-08 05:38:47,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042624571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:47,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:47,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:47,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252216258] [2025-02-08 05:38:47,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:47,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:47,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:47,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:47,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 473 [2025-02-08 05:38:47,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 425 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-02-08 05:38:47,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:47,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 473 [2025-02-08 05:38:47,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,619 INFO L124 PetriNetUnfolderBase]: 80/1050 cut-off events. [2025-02-08 05:38:47,619 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-02-08 05:38:47,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 1050 events. 80/1050 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5716 event pairs, 24 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1089. Up to 82 conditions per place. [2025-02-08 05:38:47,627 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2025-02-08 05:38:47,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 420 transitions, 879 flow [2025-02-08 05:38:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2025-02-08 05:38:47,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506694855532065 [2025-02-08 05:38:47,630 INFO L175 Difference]: Start difference. First operand has 417 places, 425 transitions, 859 flow. Second operand 3 states and 1349 transitions. [2025-02-08 05:38:47,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 420 transitions, 879 flow [2025-02-08 05:38:47,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 420 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:47,636 INFO L231 Difference]: Finished difference. Result has 412 places, 420 transitions, 847 flow [2025-02-08 05:38:47,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=412, PETRI_TRANSITIONS=420} [2025-02-08 05:38:47,638 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2025-02-08 05:38:47,638 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 420 transitions, 847 flow [2025-02-08 05:38:47,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-02-08 05:38:47,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:47,639 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] [2025-02-08 05:38:47,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:47,639 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:47,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:47,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1145486399, now seen corresponding path program 1 times [2025-02-08 05:38:47,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:47,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235744029] [2025-02-08 05:38:47,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:47,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:47,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:38:47,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:38:47,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:47,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:47,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235744029] [2025-02-08 05:38:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235744029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:47,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:47,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:47,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833935451] [2025-02-08 05:38:47,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:47,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:47,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:47,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:47,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:47,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-02-08 05:38:47,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 420 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:47,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:47,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-02-08 05:38:47,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,822 INFO L124 PetriNetUnfolderBase]: 32/651 cut-off events. [2025-02-08 05:38:47,823 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:38:47,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 651 events. 32/651 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2309 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2025-02-08 05:38:47,829 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2025-02-08 05:38:47,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 419 transitions, 871 flow [2025-02-08 05:38:47,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-08 05:38:47,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-08 05:38:47,833 INFO L175 Difference]: Start difference. First operand has 412 places, 420 transitions, 847 flow. Second operand 3 states and 1358 transitions. [2025-02-08 05:38:47,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 419 transitions, 871 flow [2025-02-08 05:38:47,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 419 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:47,841 INFO L231 Difference]: Finished difference. Result has 412 places, 419 transitions, 848 flow [2025-02-08 05:38:47,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=412, PETRI_TRANSITIONS=419} [2025-02-08 05:38:47,842 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2025-02-08 05:38:47,842 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 419 transitions, 848 flow [2025-02-08 05:38:47,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:47,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:47,844 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] [2025-02-08 05:38:47,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:47,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:47,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash -59624377, now seen corresponding path program 1 times [2025-02-08 05:38:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:47,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129702388] [2025-02-08 05:38:47,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:47,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:47,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 05:38:47,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 05:38:47,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:47,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:47,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129702388] [2025-02-08 05:38:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129702388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:47,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394497296] [2025-02-08 05:38:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:47,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:47,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:47,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:47,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-02-08 05:38:47,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 419 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-02-08 05:38:47,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:47,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-02-08 05:38:47,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,029 INFO L124 PetriNetUnfolderBase]: 73/1148 cut-off events. [2025-02-08 05:38:48,029 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:48,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1148 events. 73/1148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6578 event pairs, 16 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1166. Up to 58 conditions per place. [2025-02-08 05:38:48,037 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2025-02-08 05:38:48,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 418 transitions, 879 flow [2025-02-08 05:38:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-08 05:38:48,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-08 05:38:48,040 INFO L175 Difference]: Start difference. First operand has 412 places, 419 transitions, 848 flow. Second operand 3 states and 1358 transitions. [2025-02-08 05:38:48,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 418 transitions, 879 flow [2025-02-08 05:38:48,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 418 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:48,049 INFO L231 Difference]: Finished difference. Result has 409 places, 417 transitions, 850 flow [2025-02-08 05:38:48,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=409, PETRI_TRANSITIONS=417} [2025-02-08 05:38:48,050 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-02-08 05:38:48,050 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 417 transitions, 850 flow [2025-02-08 05:38:48,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-02-08 05:38:48,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,052 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] [2025-02-08 05:38:48,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:48,052 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:48,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1464422104, now seen corresponding path program 1 times [2025-02-08 05:38:48,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232267348] [2025-02-08 05:38:48,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:38:48,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:38:48,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232267348] [2025-02-08 05:38:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232267348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129808328] [2025-02-08 05:38:48,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-02-08 05:38:48,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 417 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-02-08 05:38:48,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-02-08 05:38:48,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,237 INFO L124 PetriNetUnfolderBase]: 69/1082 cut-off events. [2025-02-08 05:38:48,237 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:48,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 1082 events. 69/1082 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6214 event pairs, 16 based on Foata normal form. 0/938 useless extension candidates. Maximal degree in co-relation 1109. Up to 60 conditions per place. [2025-02-08 05:38:48,244 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2025-02-08 05:38:48,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 416 transitions, 881 flow [2025-02-08 05:38:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-08 05:38:48,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-08 05:38:48,248 INFO L175 Difference]: Start difference. First operand has 409 places, 417 transitions, 850 flow. Second operand 3 states and 1358 transitions. [2025-02-08 05:38:48,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 416 transitions, 881 flow [2025-02-08 05:38:48,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 881 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:48,253 INFO L231 Difference]: Finished difference. Result has 408 places, 415 transitions, 856 flow [2025-02-08 05:38:48,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=408, PETRI_TRANSITIONS=415} [2025-02-08 05:38:48,254 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2025-02-08 05:38:48,254 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 415 transitions, 856 flow [2025-02-08 05:38:48,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-02-08 05:38:48,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,255 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] [2025-02-08 05:38:48,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:48,256 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:48,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1819694372, now seen corresponding path program 1 times [2025-02-08 05:38:48,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269079658] [2025-02-08 05:38:48,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 05:38:48,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 05:38:48,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269079658] [2025-02-08 05:38:48,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269079658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906164881] [2025-02-08 05:38:48,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-08 05:38:48,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 415 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-02-08 05:38:48,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-08 05:38:48,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,429 INFO L124 PetriNetUnfolderBase]: 47/946 cut-off events. [2025-02-08 05:38:48,429 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-08 05:38:48,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 946 events. 47/946 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4199 event pairs, 4 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 948. Up to 20 conditions per place. [2025-02-08 05:38:48,436 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2025-02-08 05:38:48,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 415 transitions, 885 flow [2025-02-08 05:38:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-08 05:38:48,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-02-08 05:38:48,440 INFO L175 Difference]: Start difference. First operand has 408 places, 415 transitions, 856 flow. Second operand 3 states and 1362 transitions. [2025-02-08 05:38:48,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 415 transitions, 885 flow [2025-02-08 05:38:48,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 415 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:48,446 INFO L231 Difference]: Finished difference. Result has 409 places, 414 transitions, 858 flow [2025-02-08 05:38:48,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=409, PETRI_TRANSITIONS=414} [2025-02-08 05:38:48,447 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-02-08 05:38:48,447 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 414 transitions, 858 flow [2025-02-08 05:38:48,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-02-08 05:38:48,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,449 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-02-08 05:38:48,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:48,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:48,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash 637945249, now seen corresponding path program 1 times [2025-02-08 05:38:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938924010] [2025-02-08 05:38:48,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-08 05:38:48,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 05:38:48,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938924010] [2025-02-08 05:38:48,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938924010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:48,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535514286] [2025-02-08 05:38:48,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-02-08 05:38:48,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 414 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-02-08 05:38:48,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-02-08 05:38:48,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,616 INFO L124 PetriNetUnfolderBase]: 44/817 cut-off events. [2025-02-08 05:38:48,616 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:38:48,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 817 events. 44/817 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3832 event pairs, 6 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2025-02-08 05:38:48,622 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 11 selfloop transitions, 3 changer transitions 0/416 dead transitions. [2025-02-08 05:38:48,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 416 transitions, 891 flow [2025-02-08 05:38:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2025-02-08 05:38:48,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9640591966173362 [2025-02-08 05:38:48,625 INFO L175 Difference]: Start difference. First operand has 409 places, 414 transitions, 858 flow. Second operand 3 states and 1368 transitions. [2025-02-08 05:38:48,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 416 transitions, 891 flow [2025-02-08 05:38:48,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 416 transitions, 887 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:48,632 INFO L231 Difference]: Finished difference. Result has 411 places, 415 transitions, 872 flow [2025-02-08 05:38:48,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=411, PETRI_TRANSITIONS=415} [2025-02-08 05:38:48,634 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2025-02-08 05:38:48,634 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 415 transitions, 872 flow [2025-02-08 05:38:48,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-02-08 05:38:48,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:48,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:38:48,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:48,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1403507886, now seen corresponding path program 1 times [2025-02-08 05:38:48,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799016992] [2025-02-08 05:38:48,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-08 05:38:48,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-08 05:38:48,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799016992] [2025-02-08 05:38:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799016992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506699307] [2025-02-08 05:38:48,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-02-08 05:38:48,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 415 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-02-08 05:38:48,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-02-08 05:38:48,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,896 INFO L124 PetriNetUnfolderBase]: 100/1449 cut-off events. [2025-02-08 05:38:48,896 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2025-02-08 05:38:48,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 1449 events. 100/1449 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8572 event pairs, 12 based on Foata normal form. 1/1264 useless extension candidates. Maximal degree in co-relation 1544. Up to 89 conditions per place. [2025-02-08 05:38:48,906 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 16 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2025-02-08 05:38:48,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 416 transitions, 913 flow [2025-02-08 05:38:48,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-02-08 05:38:48,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9584214235377027 [2025-02-08 05:38:48,912 INFO L175 Difference]: Start difference. First operand has 411 places, 415 transitions, 872 flow. Second operand 3 states and 1360 transitions. [2025-02-08 05:38:48,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 416 transitions, 913 flow [2025-02-08 05:38:48,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:48,918 INFO L231 Difference]: Finished difference. Result has 408 places, 413 transitions, 872 flow [2025-02-08 05:38:48,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=408, PETRI_TRANSITIONS=413} [2025-02-08 05:38:48,920 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2025-02-08 05:38:48,920 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 413 transitions, 872 flow [2025-02-08 05:38:48,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-02-08 05:38:48,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,922 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] [2025-02-08 05:38:48,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:38:48,922 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:48,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash 253837257, now seen corresponding path program 1 times [2025-02-08 05:38:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855409705] [2025-02-08 05:38:48,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 05:38:48,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:38:48,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855409705] [2025-02-08 05:38:48,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855409705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481490451] [2025-02-08 05:38:48,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-08 05:38:49,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 413 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-02-08 05:38:49,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:49,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-08 05:38:49,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:49,107 INFO L124 PetriNetUnfolderBase]: 61/910 cut-off events. [2025-02-08 05:38:49,107 INFO L125 PetriNetUnfolderBase]: For 20/24 co-relation queries the response was YES. [2025-02-08 05:38:49,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 910 events. 61/910 cut-off events. For 20/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4492 event pairs, 8 based on Foata normal form. 0/800 useless extension candidates. Maximal degree in co-relation 966. Up to 52 conditions per place. [2025-02-08 05:38:49,117 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-02-08 05:38:49,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 413 transitions, 901 flow [2025-02-08 05:38:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-08 05:38:49,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-02-08 05:38:49,122 INFO L175 Difference]: Start difference. First operand has 408 places, 413 transitions, 872 flow. Second operand 3 states and 1362 transitions. [2025-02-08 05:38:49,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 413 transitions, 901 flow [2025-02-08 05:38:49,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 413 transitions, 901 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:49,129 INFO L231 Difference]: Finished difference. Result has 409 places, 412 transitions, 874 flow [2025-02-08 05:38:49,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=409, PETRI_TRANSITIONS=412} [2025-02-08 05:38:49,130 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-02-08 05:38:49,131 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 412 transitions, 874 flow [2025-02-08 05:38:49,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-02-08 05:38:49,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:49,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:49,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:38:49,132 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:49,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -658984947, now seen corresponding path program 1 times [2025-02-08 05:38:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73760451] [2025-02-08 05:38:49,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:49,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-08 05:38:49,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 05:38:49,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:49,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73760451] [2025-02-08 05:38:49,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73760451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:49,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768361254] [2025-02-08 05:38:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:49,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:49,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:49,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:49,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:49,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-02-08 05:38:49,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 412 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-02-08 05:38:49,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:49,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-02-08 05:38:49,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:49,332 INFO L124 PetriNetUnfolderBase]: 83/1039 cut-off events. [2025-02-08 05:38:49,332 INFO L125 PetriNetUnfolderBase]: For 37/40 co-relation queries the response was YES. [2025-02-08 05:38:49,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1039 events. 83/1039 cut-off events. For 37/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5500 event pairs, 12 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1161. Up to 88 conditions per place. [2025-02-08 05:38:49,341 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 11 selfloop transitions, 3 changer transitions 0/414 dead transitions. [2025-02-08 05:38:49,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 414 transitions, 907 flow [2025-02-08 05:38:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2025-02-08 05:38:49,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9640591966173362 [2025-02-08 05:38:49,345 INFO L175 Difference]: Start difference. First operand has 409 places, 412 transitions, 874 flow. Second operand 3 states and 1368 transitions. [2025-02-08 05:38:49,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 414 transitions, 907 flow [2025-02-08 05:38:49,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 414 transitions, 903 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:49,354 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 888 flow [2025-02-08 05:38:49,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2025-02-08 05:38:49,355 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2025-02-08 05:38:49,355 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 888 flow [2025-02-08 05:38:49,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-02-08 05:38:49,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:49,356 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] [2025-02-08 05:38:49,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:38:49,356 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:49,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:49,358 INFO L85 PathProgramCache]: Analyzing trace with hash -467876306, now seen corresponding path program 1 times [2025-02-08 05:38:49,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:49,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845172658] [2025-02-08 05:38:49,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:49,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:49,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 05:38:49,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 05:38:49,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:49,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:49,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:49,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845172658] [2025-02-08 05:38:49,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845172658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:49,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:49,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:49,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422940196] [2025-02-08 05:38:49,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:49,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:49,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:49,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:49,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:49,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-08 05:38:49,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-02-08 05:38:49,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:49,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-08 05:38:49,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:49,646 INFO L124 PetriNetUnfolderBase]: 75/1317 cut-off events. [2025-02-08 05:38:49,646 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2025-02-08 05:38:49,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1317 events. 75/1317 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7223 event pairs, 4 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1471. Up to 36 conditions per place. [2025-02-08 05:38:49,658 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-02-08 05:38:49,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 413 transitions, 917 flow [2025-02-08 05:38:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-08 05:38:49,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-02-08 05:38:49,661 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 888 flow. Second operand 3 states and 1362 transitions. [2025-02-08 05:38:49,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 413 transitions, 917 flow [2025-02-08 05:38:49,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 413 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:49,669 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 884 flow [2025-02-08 05:38:49,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2025-02-08 05:38:49,670 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -26 predicate places. [2025-02-08 05:38:49,670 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 884 flow [2025-02-08 05:38:49,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-02-08 05:38:49,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:49,672 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-02-08 05:38:49,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:38:49,673 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:49,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:49,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2081945875, now seen corresponding path program 1 times [2025-02-08 05:38:49,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:49,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62944872] [2025-02-08 05:38:49,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:49,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:49,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 05:38:49,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 05:38:49,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:49,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:49,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:49,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62944872] [2025-02-08 05:38:49,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62944872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:49,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:49,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398721263] [2025-02-08 05:38:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:49,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:49,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:49,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:49,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-02-08 05:38:49,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 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-02-08 05:38:49,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:49,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-02-08 05:38:49,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:49,927 INFO L124 PetriNetUnfolderBase]: 106/1509 cut-off events. [2025-02-08 05:38:49,927 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-02-08 05:38:49,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 1509 events. 106/1509 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9095 event pairs, 12 based on Foata normal form. 0/1359 useless extension candidates. Maximal degree in co-relation 1707. Up to 94 conditions per place. [2025-02-08 05:38:49,936 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 16 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-02-08 05:38:49,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 413 transitions, 925 flow [2025-02-08 05:38:49,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-02-08 05:38:49,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9584214235377027 [2025-02-08 05:38:49,940 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 884 flow. Second operand 3 states and 1360 transitions. [2025-02-08 05:38:49,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 413 transitions, 925 flow [2025-02-08 05:38:49,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 413 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:49,946 INFO L231 Difference]: Finished difference. Result has 407 places, 410 transitions, 886 flow [2025-02-08 05:38:49,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=407, PETRI_TRANSITIONS=410} [2025-02-08 05:38:49,946 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -29 predicate places. [2025-02-08 05:38:49,947 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 410 transitions, 886 flow [2025-02-08 05:38:49,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 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-02-08 05:38:49,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:49,947 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-02-08 05:38:49,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:38:49,947 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:49,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash -39081996, now seen corresponding path program 1 times [2025-02-08 05:38:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:49,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255260315] [2025-02-08 05:38:49,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:49,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 05:38:49,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 05:38:49,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:49,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:50,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:50,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255260315] [2025-02-08 05:38:50,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255260315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:50,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:50,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:38:50,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261065763] [2025-02-08 05:38:50,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:50,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:38:50,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:50,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:38:50,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:38:50,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-02-08 05:38:50,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 410 transitions, 886 flow. Second operand has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 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-02-08 05:38:50,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:50,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-02-08 05:38:50,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:50,890 INFO L124 PetriNetUnfolderBase]: 132/2124 cut-off events. [2025-02-08 05:38:50,890 INFO L125 PetriNetUnfolderBase]: For 11/27 co-relation queries the response was YES. [2025-02-08 05:38:50,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2536 conditions, 2124 events. 132/2124 cut-off events. For 11/27 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14664 event pairs, 17 based on Foata normal form. 6/1935 useless extension candidates. Maximal degree in co-relation 2474. Up to 81 conditions per place. [2025-02-08 05:38:50,903 INFO L140 encePairwiseOnDemand]: 456/473 looper letters, 44 selfloop transitions, 19 changer transitions 0/437 dead transitions. [2025-02-08 05:38:50,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 437 transitions, 1079 flow [2025-02-08 05:38:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:38:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:38:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5200 transitions. [2025-02-08 05:38:50,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.916138125440451 [2025-02-08 05:38:50,914 INFO L175 Difference]: Start difference. First operand has 407 places, 410 transitions, 886 flow. Second operand 12 states and 5200 transitions. [2025-02-08 05:38:50,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 437 transitions, 1079 flow [2025-02-08 05:38:50,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 437 transitions, 1079 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:50,921 INFO L231 Difference]: Finished difference. Result has 424 places, 420 transitions, 987 flow [2025-02-08 05:38:50,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=987, PETRI_PLACES=424, PETRI_TRANSITIONS=420} [2025-02-08 05:38:50,922 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2025-02-08 05:38:50,922 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 420 transitions, 987 flow [2025-02-08 05:38:50,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 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-02-08 05:38:50,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:50,924 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] [2025-02-08 05:38:50,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:38:50,924 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:50,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1561719526, now seen corresponding path program 1 times [2025-02-08 05:38:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:50,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679952451] [2025-02-08 05:38:50,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:50,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:38:50,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:38:50,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:50,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:50,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:50,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679952451] [2025-02-08 05:38:50,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679952451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:50,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:50,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:50,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144281594] [2025-02-08 05:38:50,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:50,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:50,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:50,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:51,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-08 05:38:51,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 420 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-02-08 05:38:51,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:51,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-08 05:38:51,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:51,201 INFO L124 PetriNetUnfolderBase]: 113/1635 cut-off events. [2025-02-08 05:38:51,201 INFO L125 PetriNetUnfolderBase]: For 54/59 co-relation queries the response was YES. [2025-02-08 05:38:51,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 1635 events. 113/1635 cut-off events. For 54/59 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10092 event pairs, 10 based on Foata normal form. 0/1493 useless extension candidates. Maximal degree in co-relation 1950. Up to 95 conditions per place. [2025-02-08 05:38:51,217 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2025-02-08 05:38:51,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1016 flow [2025-02-08 05:38:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-08 05:38:51,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-02-08 05:38:51,220 INFO L175 Difference]: Start difference. First operand has 424 places, 420 transitions, 987 flow. Second operand 3 states and 1362 transitions. [2025-02-08 05:38:51,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1016 flow [2025-02-08 05:38:51,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1016 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:51,227 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 989 flow [2025-02-08 05:38:51,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=989, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2025-02-08 05:38:51,227 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2025-02-08 05:38:51,228 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 989 flow [2025-02-08 05:38:51,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-02-08 05:38:51,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:51,228 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-02-08 05:38:51,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:38:51,229 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:51,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash 411516665, now seen corresponding path program 1 times [2025-02-08 05:38:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:51,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610274409] [2025-02-08 05:38:51,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:51,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:51,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:38:51,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:38:51,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:51,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:51,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610274409] [2025-02-08 05:38:51,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610274409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:51,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:51,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:38:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487363406] [2025-02-08 05:38:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:51,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:38:51,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:51,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:38:51,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:38:51,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-02-08 05:38:51,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 989 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-02-08 05:38:51,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:51,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-02-08 05:38:51,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:52,125 INFO L124 PetriNetUnfolderBase]: 126/1437 cut-off events. [2025-02-08 05:38:52,126 INFO L125 PetriNetUnfolderBase]: For 85/90 co-relation queries the response was YES. [2025-02-08 05:38:52,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 1437 events. 126/1437 cut-off events. For 85/90 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8463 event pairs, 22 based on Foata normal form. 0/1314 useless extension candidates. Maximal degree in co-relation 1844. Up to 161 conditions per place. [2025-02-08 05:38:52,139 INFO L140 encePairwiseOnDemand]: 457/473 looper letters, 48 selfloop transitions, 17 changer transitions 0/443 dead transitions. [2025-02-08 05:38:52,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 443 transitions, 1181 flow [2025-02-08 05:38:52,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:38:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:38:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4772 transitions. [2025-02-08 05:38:52,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171631750912935 [2025-02-08 05:38:52,147 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 989 flow. Second operand 11 states and 4772 transitions. [2025-02-08 05:38:52,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 443 transitions, 1181 flow [2025-02-08 05:38:52,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 443 transitions, 1177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:52,154 INFO L231 Difference]: Finished difference. Result has 436 places, 424 transitions, 1058 flow [2025-02-08 05:38:52,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1058, PETRI_PLACES=436, PETRI_TRANSITIONS=424} [2025-02-08 05:38:52,155 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 0 predicate places. [2025-02-08 05:38:52,155 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 424 transitions, 1058 flow [2025-02-08 05:38:52,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-02-08 05:38:52,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:52,157 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] [2025-02-08 05:38:52,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:38:52,157 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:52,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:52,158 INFO L85 PathProgramCache]: Analyzing trace with hash -729080954, now seen corresponding path program 1 times [2025-02-08 05:38:52,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:52,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060637101] [2025-02-08 05:38:52,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:52,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:52,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 05:38:52,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 05:38:52,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:52,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:38:52,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:52,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060637101] [2025-02-08 05:38:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060637101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:52,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:52,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:38:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513048400] [2025-02-08 05:38:52,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:52,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:38:52,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:52,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:38:52,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:38:52,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-02-08 05:38:52,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 424 transitions, 1058 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-02-08 05:38:52,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:52,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-02-08 05:38:52,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:53,247 INFO L124 PetriNetUnfolderBase]: 189/2781 cut-off events. [2025-02-08 05:38:53,247 INFO L125 PetriNetUnfolderBase]: For 206/235 co-relation queries the response was YES. [2025-02-08 05:38:53,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3686 conditions, 2781 events. 189/2781 cut-off events. For 206/235 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20612 event pairs, 28 based on Foata normal form. 8/2596 useless extension candidates. Maximal degree in co-relation 3607. Up to 129 conditions per place. [2025-02-08 05:38:53,271 INFO L140 encePairwiseOnDemand]: 457/473 looper letters, 50 selfloop transitions, 21 changer transitions 0/449 dead transitions. [2025-02-08 05:38:53,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 449 transitions, 1303 flow [2025-02-08 05:38:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:38:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:38:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4763 transitions. [2025-02-08 05:38:53,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9154334038054969 [2025-02-08 05:38:53,311 INFO L175 Difference]: Start difference. First operand has 436 places, 424 transitions, 1058 flow. Second operand 11 states and 4763 transitions. [2025-02-08 05:38:53,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 449 transitions, 1303 flow [2025-02-08 05:38:53,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 449 transitions, 1282 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:38:53,321 INFO L231 Difference]: Finished difference. Result has 444 places, 438 transitions, 1191 flow [2025-02-08 05:38:53,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1191, PETRI_PLACES=444, PETRI_TRANSITIONS=438} [2025-02-08 05:38:53,322 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 8 predicate places. [2025-02-08 05:38:53,322 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 438 transitions, 1191 flow [2025-02-08 05:38:53,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-02-08 05:38:53,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:53,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:53,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:38:53,324 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:53,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:53,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1542308597, now seen corresponding path program 1 times [2025-02-08 05:38:53,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:53,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066155223] [2025-02-08 05:38:53,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:53,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:53,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:38:53,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:38:53,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:53,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:38:53,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066155223] [2025-02-08 05:38:53,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066155223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:53,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:53,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:38:53,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489294127] [2025-02-08 05:38:53,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:53,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:38:53,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:53,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:38:53,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:38:53,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-02-08 05:38:53,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 438 transitions, 1191 flow. Second operand has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 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-02-08 05:38:53,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:53,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-02-08 05:38:53,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:54,152 INFO L124 PetriNetUnfolderBase]: 167/1956 cut-off events. [2025-02-08 05:38:54,153 INFO L125 PetriNetUnfolderBase]: For 298/307 co-relation queries the response was YES. [2025-02-08 05:38:54,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 1956 events. 167/1956 cut-off events. For 298/307 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12940 event pairs, 25 based on Foata normal form. 8/1820 useless extension candidates. Maximal degree in co-relation 2705. Up to 167 conditions per place. [2025-02-08 05:38:54,172 INFO L140 encePairwiseOnDemand]: 456/473 looper letters, 44 selfloop transitions, 24 changer transitions 0/455 dead transitions. [2025-02-08 05:38:54,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 455 transitions, 1402 flow [2025-02-08 05:38:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:38:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:38:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5191 transitions. [2025-02-08 05:38:54,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145525017618041 [2025-02-08 05:38:54,204 INFO L175 Difference]: Start difference. First operand has 444 places, 438 transitions, 1191 flow. Second operand 12 states and 5191 transitions. [2025-02-08 05:38:54,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 455 transitions, 1402 flow [2025-02-08 05:38:54,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 455 transitions, 1398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:54,216 INFO L231 Difference]: Finished difference. Result has 458 places, 447 transitions, 1327 flow [2025-02-08 05:38:54,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1327, PETRI_PLACES=458, PETRI_TRANSITIONS=447} [2025-02-08 05:38:54,217 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 22 predicate places. [2025-02-08 05:38:54,217 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 447 transitions, 1327 flow [2025-02-08 05:38:54,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 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-02-08 05:38:54,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:54,218 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] [2025-02-08 05:38:54,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:38:54,218 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:54,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash 66379468, now seen corresponding path program 1 times [2025-02-08 05:38:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074469307] [2025-02-08 05:38:54,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:54,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:54,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 05:38:54,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 05:38:54,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:54,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:54,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074469307] [2025-02-08 05:38:54,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074469307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:54,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:54,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:54,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298505398] [2025-02-08 05:38:54,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:54,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:54,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:54,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:54,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-02-08 05:38:54,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 447 transitions, 1327 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:54,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:54,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-02-08 05:38:54,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:54,571 INFO L124 PetriNetUnfolderBase]: 136/2295 cut-off events. [2025-02-08 05:38:54,571 INFO L125 PetriNetUnfolderBase]: For 478/488 co-relation queries the response was YES. [2025-02-08 05:38:54,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 2295 events. 136/2295 cut-off events. For 478/488 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 15489 event pairs, 10 based on Foata normal form. 0/2152 useless extension candidates. Maximal degree in co-relation 3175. Up to 76 conditions per place. [2025-02-08 05:38:54,589 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 12 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2025-02-08 05:38:54,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 444 transitions, 1347 flow [2025-02-08 05:38:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-02-08 05:38:54,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95630725863284 [2025-02-08 05:38:54,591 INFO L175 Difference]: Start difference. First operand has 458 places, 447 transitions, 1327 flow. Second operand 3 states and 1357 transitions. [2025-02-08 05:38:54,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 444 transitions, 1347 flow [2025-02-08 05:38:54,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 444 transitions, 1330 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:38:54,604 INFO L231 Difference]: Finished difference. Result has 451 places, 444 transitions, 1306 flow [2025-02-08 05:38:54,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=451, PETRI_TRANSITIONS=444} [2025-02-08 05:38:54,605 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 15 predicate places. [2025-02-08 05:38:54,606 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 444 transitions, 1306 flow [2025-02-08 05:38:54,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:54,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:54,606 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] [2025-02-08 05:38:54,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:38:54,607 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:54,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:54,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1898661781, now seen corresponding path program 1 times [2025-02-08 05:38:54,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:54,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074405013] [2025-02-08 05:38:54,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:54,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:54,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:38:54,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:38:54,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:54,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074405013] [2025-02-08 05:38:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074405013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284936577] [2025-02-08 05:38:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:54,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:54,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:54,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:54,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-02-08 05:38:54,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 444 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-02-08 05:38:54,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:54,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-02-08 05:38:54,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:54,977 INFO L124 PetriNetUnfolderBase]: 145/2626 cut-off events. [2025-02-08 05:38:54,978 INFO L125 PetriNetUnfolderBase]: For 484/491 co-relation queries the response was YES. [2025-02-08 05:38:54,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 2626 events. 145/2626 cut-off events. For 484/491 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19165 event pairs, 17 based on Foata normal form. 1/2459 useless extension candidates. Maximal degree in co-relation 3520. Up to 77 conditions per place. [2025-02-08 05:38:54,996 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 15 selfloop transitions, 2 changer transitions 0/449 dead transitions. [2025-02-08 05:38:54,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 449 transitions, 1353 flow [2025-02-08 05:38:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2025-02-08 05:38:54,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966878083157153 [2025-02-08 05:38:54,997 INFO L175 Difference]: Start difference. First operand has 451 places, 444 transitions, 1306 flow. Second operand 3 states and 1372 transitions. [2025-02-08 05:38:54,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 449 transitions, 1353 flow [2025-02-08 05:38:55,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 449 transitions, 1352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:55,010 INFO L231 Difference]: Finished difference. Result has 454 places, 446 transitions, 1325 flow [2025-02-08 05:38:55,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=454, PETRI_TRANSITIONS=446} [2025-02-08 05:38:55,011 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 18 predicate places. [2025-02-08 05:38:55,011 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 446 transitions, 1325 flow [2025-02-08 05:38:55,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-02-08 05:38:55,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,011 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] [2025-02-08 05:38:55,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:38:55,012 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:55,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1767352025, now seen corresponding path program 1 times [2025-02-08 05:38:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854192834] [2025-02-08 05:38:55,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:38:55,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:38:55,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:55,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854192834] [2025-02-08 05:38:55,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854192834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457960391] [2025-02-08 05:38:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-02-08 05:38:55,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 446 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-02-08 05:38:55,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-02-08 05:38:55,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:55,399 INFO L124 PetriNetUnfolderBase]: 139/2604 cut-off events. [2025-02-08 05:38:55,399 INFO L125 PetriNetUnfolderBase]: For 669/689 co-relation queries the response was YES. [2025-02-08 05:38:55,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3753 conditions, 2604 events. 139/2604 cut-off events. For 669/689 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18894 event pairs, 13 based on Foata normal form. 13/2470 useless extension candidates. Maximal degree in co-relation 3657. Up to 72 conditions per place. [2025-02-08 05:38:55,415 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 17 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-02-08 05:38:55,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 451 transitions, 1380 flow [2025-02-08 05:38:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2025-02-08 05:38:55,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966878083157153 [2025-02-08 05:38:55,417 INFO L175 Difference]: Start difference. First operand has 454 places, 446 transitions, 1325 flow. Second operand 3 states and 1372 transitions. [2025-02-08 05:38:55,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 451 transitions, 1380 flow [2025-02-08 05:38:55,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 451 transitions, 1378 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:55,427 INFO L231 Difference]: Finished difference. Result has 457 places, 448 transitions, 1347 flow [2025-02-08 05:38:55,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1347, PETRI_PLACES=457, PETRI_TRANSITIONS=448} [2025-02-08 05:38:55,428 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 21 predicate places. [2025-02-08 05:38:55,428 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 448 transitions, 1347 flow [2025-02-08 05:38:55,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-02-08 05:38:55,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,429 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] [2025-02-08 05:38:55,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:38:55,429 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:55,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1809439521, now seen corresponding path program 1 times [2025-02-08 05:38:55,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587102723] [2025-02-08 05:38:55,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:38:55,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:38:55,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:55,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587102723] [2025-02-08 05:38:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587102723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703137060] [2025-02-08 05:38:55,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-02-08 05:38:55,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 448 transitions, 1347 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:55,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-02-08 05:38:55,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:55,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1172] thread2EXIT-->L102-11: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][272], [Black: 514#(not |thread2Thread1of1ForFork0_#t~short10|), 491#(= |#race~count1~0| 0), Black: 520#true, 473#(= |#race~n1~0| 0), 260#L102-11true, Black: 582#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 638#true, Black: 587#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), Black: 581#(<= ~n2~0 0), Black: 595#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 601#true, Black: 589#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 524#true, Black: 537#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 543#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 529#(<= ~n1~0 0), Black: 535#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 530#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 522#(= |#race~get2~0| 0), Black: 489#true, Black: 620#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 606#(<= ~n2~0 0), Black: 607#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 493#true, Black: 630#(not (= ~count2~0 ~count1~0)), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 633#true, Black: 505#true, Black: 572#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 558#(<= ~n1~0 0), 635#(= ~count2~0 ~count1~0), Black: 559#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0))]) [2025-02-08 05:38:55,789 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-02-08 05:38:55,789 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-02-08 05:38:55,789 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-02-08 05:38:55,789 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-02-08 05:38:55,793 INFO L124 PetriNetUnfolderBase]: 128/2358 cut-off events. [2025-02-08 05:38:55,793 INFO L125 PetriNetUnfolderBase]: For 473/515 co-relation queries the response was YES. [2025-02-08 05:38:55,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3367 conditions, 2358 events. 128/2358 cut-off events. For 473/515 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 16600 event pairs, 10 based on Foata normal form. 9/2256 useless extension candidates. Maximal degree in co-relation 3274. Up to 99 conditions per place. [2025-02-08 05:38:55,803 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 6 selfloop transitions, 0 changer transitions 86/447 dead transitions. [2025-02-08 05:38:55,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 447 transitions, 1373 flow [2025-02-08 05:38:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-08 05:38:55,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-08 05:38:55,805 INFO L175 Difference]: Start difference. First operand has 457 places, 448 transitions, 1347 flow. Second operand 3 states and 1358 transitions. [2025-02-08 05:38:55,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 447 transitions, 1373 flow [2025-02-08 05:38:55,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 447 transitions, 1367 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:55,815 INFO L231 Difference]: Finished difference. Result has 455 places, 361 transitions, 932 flow [2025-02-08 05:38:55,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=932, PETRI_PLACES=455, PETRI_TRANSITIONS=361} [2025-02-08 05:38:55,816 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 19 predicate places. [2025-02-08 05:38:55,816 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 361 transitions, 932 flow [2025-02-08 05:38:55,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-02-08 05:38:55,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:55,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:38:55,817 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:55,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1783752035, now seen corresponding path program 1 times [2025-02-08 05:38:55,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326464492] [2025-02-08 05:38:55,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-08 05:38:55,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-08 05:38:55,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:38:56,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326464492] [2025-02-08 05:38:56,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326464492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:56,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307228652] [2025-02-08 05:38:56,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:56,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:56,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:56,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-02-08 05:38:56,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 361 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-02-08 05:38:56,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-02-08 05:38:56,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,969 INFO L124 PetriNetUnfolderBase]: 85/1368 cut-off events. [2025-02-08 05:38:56,970 INFO L125 PetriNetUnfolderBase]: For 209/210 co-relation queries the response was YES. [2025-02-08 05:38:56,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 1368 events. 85/1368 cut-off events. For 209/210 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8422 event pairs, 4 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 1958. Up to 43 conditions per place. [2025-02-08 05:38:56,983 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/364 dead transitions. [2025-02-08 05:38:56,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 364 transitions, 1008 flow [2025-02-08 05:38:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-02-08 05:38:56,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-02-08 05:38:56,986 INFO L175 Difference]: Start difference. First operand has 455 places, 361 transitions, 932 flow. Second operand 6 states and 2637 transitions. [2025-02-08 05:38:56,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 364 transitions, 1008 flow [2025-02-08 05:38:56,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 364 transitions, 908 flow, removed 24 selfloop flow, removed 26 redundant places. [2025-02-08 05:38:56,993 INFO L231 Difference]: Finished difference. Result has 374 places, 360 transitions, 851 flow [2025-02-08 05:38:56,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=851, PETRI_PLACES=374, PETRI_TRANSITIONS=360} [2025-02-08 05:38:56,994 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2025-02-08 05:38:56,994 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 360 transitions, 851 flow [2025-02-08 05:38:56,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-02-08 05:38:56,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,995 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] [2025-02-08 05:38:56,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:38:56,995 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:56,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1721151774, now seen corresponding path program 1 times [2025-02-08 05:38:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035190629] [2025-02-08 05:38:56,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:57,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 05:38:57,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 05:38:57,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:57,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:38:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035190629] [2025-02-08 05:38:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035190629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:57,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377880995] [2025-02-08 05:38:57,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:57,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:57,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:57,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-02-08 05:38:57,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 360 transitions, 851 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-02-08 05:38:57,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-02-08 05:38:57,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:58,022 INFO L124 PetriNetUnfolderBase]: 89/1146 cut-off events. [2025-02-08 05:38:58,023 INFO L125 PetriNetUnfolderBase]: For 68/71 co-relation queries the response was YES. [2025-02-08 05:38:58,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 1146 events. 89/1146 cut-off events. For 68/71 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6482 event pairs, 5 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 1516. Up to 66 conditions per place. [2025-02-08 05:38:58,029 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/363 dead transitions. [2025-02-08 05:38:58,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 363 transitions, 923 flow [2025-02-08 05:38:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-02-08 05:38:58,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-02-08 05:38:58,031 INFO L175 Difference]: Start difference. First operand has 374 places, 360 transitions, 851 flow. Second operand 6 states and 2637 transitions. [2025-02-08 05:38:58,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 363 transitions, 923 flow [2025-02-08 05:38:58,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 363 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:38:58,035 INFO L231 Difference]: Finished difference. Result has 374 places, 359 transitions, 857 flow [2025-02-08 05:38:58,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=857, PETRI_PLACES=374, PETRI_TRANSITIONS=359} [2025-02-08 05:38:58,036 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2025-02-08 05:38:58,036 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 359 transitions, 857 flow [2025-02-08 05:38:58,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-02-08 05:38:58,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:58,037 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] [2025-02-08 05:38:58,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:38:58,037 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:58,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:58,038 INFO L85 PathProgramCache]: Analyzing trace with hash 854681217, now seen corresponding path program 1 times [2025-02-08 05:38:58,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:58,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040802508] [2025-02-08 05:38:58,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:58,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:38:58,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:38:58,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:58,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:38:58,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:58,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040802508] [2025-02-08 05:38:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040802508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:58,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267939166] [2025-02-08 05:38:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:58,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:58,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:58,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:58,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:58,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-02-08 05:38:58,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 359 transitions, 857 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-02-08 05:38:58,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:58,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-02-08 05:38:58,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:58,926 INFO L124 PetriNetUnfolderBase]: 79/1333 cut-off events. [2025-02-08 05:38:58,926 INFO L125 PetriNetUnfolderBase]: For 52/53 co-relation queries the response was YES. [2025-02-08 05:38:58,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1333 events. 79/1333 cut-off events. For 52/53 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7995 event pairs, 4 based on Foata normal form. 0/1273 useless extension candidates. Maximal degree in co-relation 1740. Up to 42 conditions per place. [2025-02-08 05:38:58,933 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/361 dead transitions. [2025-02-08 05:38:58,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 361 transitions, 927 flow [2025-02-08 05:38:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-02-08 05:38:58,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-02-08 05:38:58,935 INFO L175 Difference]: Start difference. First operand has 374 places, 359 transitions, 857 flow. Second operand 6 states and 2637 transitions. [2025-02-08 05:38:58,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 361 transitions, 927 flow [2025-02-08 05:38:58,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 361 transitions, 918 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:38:58,940 INFO L231 Difference]: Finished difference. Result has 373 places, 357 transitions, 856 flow [2025-02-08 05:38:58,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=373, PETRI_TRANSITIONS=357} [2025-02-08 05:38:58,940 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -63 predicate places. [2025-02-08 05:38:58,940 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 357 transitions, 856 flow [2025-02-08 05:38:58,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-02-08 05:38:58,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:58,941 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] [2025-02-08 05:38:58,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:38:58,942 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:58,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:58,943 INFO L85 PathProgramCache]: Analyzing trace with hash 602967622, now seen corresponding path program 1 times [2025-02-08 05:38:58,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:58,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858686591] [2025-02-08 05:38:58,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:58,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-08 05:38:58,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-08 05:38:58,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:58,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:38:59,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:59,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858686591] [2025-02-08 05:38:59,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858686591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:59,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:59,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:59,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846618046] [2025-02-08 05:38:59,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:59,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:59,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:59,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:59,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:59,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-02-08 05:38:59,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 357 transitions, 856 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-02-08 05:38:59,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:59,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-02-08 05:38:59,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:59,901 INFO L124 PetriNetUnfolderBase]: 84/1120 cut-off events. [2025-02-08 05:38:59,902 INFO L125 PetriNetUnfolderBase]: For 90/93 co-relation queries the response was YES. [2025-02-08 05:38:59,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 1120 events. 84/1120 cut-off events. For 90/93 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6149 event pairs, 5 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1496. Up to 61 conditions per place. [2025-02-08 05:38:59,911 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/359 dead transitions. [2025-02-08 05:38:59,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 359 transitions, 926 flow [2025-02-08 05:38:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-02-08 05:38:59,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-02-08 05:38:59,914 INFO L175 Difference]: Start difference. First operand has 373 places, 357 transitions, 856 flow. Second operand 6 states and 2637 transitions. [2025-02-08 05:38:59,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 359 transitions, 926 flow [2025-02-08 05:38:59,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 359 transitions, 914 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:59,921 INFO L231 Difference]: Finished difference. Result has 371 places, 355 transitions, 852 flow [2025-02-08 05:38:59,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=852, PETRI_PLACES=371, PETRI_TRANSITIONS=355} [2025-02-08 05:38:59,922 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -65 predicate places. [2025-02-08 05:38:59,923 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 355 transitions, 852 flow [2025-02-08 05:38:59,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-02-08 05:38:59,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:59,924 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] [2025-02-08 05:38:59,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:38:59,925 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:38:59,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1917655128, now seen corresponding path program 1 times [2025-02-08 05:38:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879860077] [2025-02-08 05:38:59,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:59,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-08 05:38:59,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-08 05:38:59,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:59,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:38:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879860077] [2025-02-08 05:38:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879860077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:59,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:59,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598060613] [2025-02-08 05:38:59,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:59,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:59,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:59,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:00,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-08 05:39:00,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 355 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-02-08 05:39:00,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:00,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-08 05:39:00,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:00,142 INFO L124 PetriNetUnfolderBase]: 66/1173 cut-off events. [2025-02-08 05:39:00,142 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2025-02-08 05:39:00,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 1173 events. 66/1173 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6330 event pairs, 4 based on Foata normal form. 0/1135 useless extension candidates. Maximal degree in co-relation 1485. Up to 36 conditions per place. [2025-02-08 05:39:00,151 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 7 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2025-02-08 05:39:00,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 355 transitions, 871 flow [2025-02-08 05:39:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-02-08 05:39:00,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95630725863284 [2025-02-08 05:39:00,153 INFO L175 Difference]: Start difference. First operand has 371 places, 355 transitions, 852 flow. Second operand 3 states and 1357 transitions. [2025-02-08 05:39:00,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 355 transitions, 871 flow [2025-02-08 05:39:00,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 355 transitions, 859 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:00,160 INFO L231 Difference]: Finished difference. Result has 367 places, 354 transitions, 842 flow [2025-02-08 05:39:00,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=367, PETRI_TRANSITIONS=354} [2025-02-08 05:39:00,161 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -69 predicate places. [2025-02-08 05:39:00,161 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 354 transitions, 842 flow [2025-02-08 05:39:00,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-02-08 05:39:00,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:00,161 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] [2025-02-08 05:39:00,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:39:00,161 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-08 05:39:00,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:00,162 INFO L85 PathProgramCache]: Analyzing trace with hash -998548652, now seen corresponding path program 1 times [2025-02-08 05:39:00,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:00,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437147865] [2025-02-08 05:39:00,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:00,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:00,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-08 05:39:00,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-08 05:39:00,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:00,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:39:00,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:00,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437147865] [2025-02-08 05:39:00,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437147865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:00,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:00,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13031038] [2025-02-08 05:39:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:00,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:00,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:00,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:00,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:00,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-08 05:39:00,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 354 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-02-08 05:39:00,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:00,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-08 05:39:00,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:00,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L77-2-->L77: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_3|) InVars {thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_3|} AuxVars[] AssignedVars[#race~res2~0][262], [Black: 514#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 646#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 491#(= |#race~count1~0| 0), Black: 520#true, Black: 653#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 473#(= |#race~n1~0| 0), 158#L100true, 638#true, Black: 587#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), 601#true, 524#true, 485#(= |#race~n2~0| 0), Black: 535#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 522#(= |#race~get2~0| 0), Black: 489#true, 10#L77true, Black: 493#true, 667#true, 670#true, 507#(= |#race~get1~0| 0), Black: 630#(not (= ~count2~0 ~count1~0)), Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 633#true, Black: 505#true, 635#(= ~count2~0 ~count1~0)]) [2025-02-08 05:39:00,353 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-02-08 05:39:00,353 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-02-08 05:39:00,353 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-02-08 05:39:00,353 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-02-08 05:39:00,353 INFO L124 PetriNetUnfolderBase]: 65/1014 cut-off events. [2025-02-08 05:39:00,353 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2025-02-08 05:39:00,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 1014 events. 65/1014 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4997 event pairs, 4 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1275. Up to 44 conditions per place. [2025-02-08 05:39:00,358 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2025-02-08 05:39:00,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 354 transitions, 863 flow [2025-02-08 05:39:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-08 05:39:00,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-08 05:39:00,360 INFO L175 Difference]: Start difference. First operand has 367 places, 354 transitions, 842 flow. Second operand 3 states and 1358 transitions. [2025-02-08 05:39:00,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 354 transitions, 863 flow [2025-02-08 05:39:00,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 354 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:00,364 INFO L231 Difference]: Finished difference. Result has 366 places, 0 transitions, 0 flow [2025-02-08 05:39:00,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=366, PETRI_TRANSITIONS=0} [2025-02-08 05:39:00,365 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -70 predicate places. [2025-02-08 05:39:00,365 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 0 transitions, 0 flow [2025-02-08 05:39:00,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-02-08 05:39:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2025-02-08 05:39:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2025-02-08 05:39:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2025-02-08 05:39:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2025-02-08 05:39:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2025-02-08 05:39:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2025-02-08 05:39:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2025-02-08 05:39:00,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2025-02-08 05:39:00,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2025-02-08 05:39:00,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2025-02-08 05:39:00,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2025-02-08 05:39:00,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2025-02-08 05:39:00,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2025-02-08 05:39:00,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2025-02-08 05:39:00,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2025-02-08 05:39:00,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2025-02-08 05:39:00,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2025-02-08 05:39:00,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2025-02-08 05:39:00,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2025-02-08 05:39:00,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:39:00,374 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-08 05:39:00,379 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:00,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:00,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:00 BasicIcfg [2025-02-08 05:39:00,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:00,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:00,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:00,386 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:00,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:43" (3/4) ... [2025-02-08 05:39:00,388 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:00,390 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:00,390 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:00,398 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-08 05:39:00,398 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:00,398 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:00,399 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:00,474 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:00,474 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:00,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:00,475 INFO L158 Benchmark]: Toolchain (without parser) took 17910.13ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 112.2MB in the beginning and 460.7MB in the end (delta: -348.5MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2025-02-08 05:39:00,476 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:00,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.60ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:00,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.16ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:00,477 INFO L158 Benchmark]: Boogie Preprocessor took 44.14ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 95.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:00,477 INFO L158 Benchmark]: IcfgBuilder took 840.34ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 60.0MB in the end (delta: 35.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:39:00,478 INFO L158 Benchmark]: TraceAbstraction took 16613.67ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 59.5MB in the beginning and 469.1MB in the end (delta: -409.6MB). Peak memory consumption was 309.5MB. Max. memory is 16.1GB. [2025-02-08 05:39:00,479 INFO L158 Benchmark]: Witness Printer took 88.53ms. Allocated memory is still 562.0MB. Free memory was 469.1MB in the beginning and 460.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:00,481 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.60ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.16ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.14ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 95.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 840.34ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 60.0MB in the end (delta: 35.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16613.67ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 59.5MB in the beginning and 469.1MB in the end (delta: -409.6MB). Peak memory consumption was 309.5MB. Max. memory is 16.1GB. * Witness Printer took 88.53ms. Allocated memory is still 562.0MB. Free memory was 469.1MB in the beginning and 460.7MB 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: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: 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: 57]: 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: 50]: 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: 51]: 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: 51]: 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: 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: 80]: 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: 80]: 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: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: 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: 116]: 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: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: 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 5 procedures, 668 locations, 94 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: 16.4s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3948 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2415 mSDsluCounter, 3845 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3523 mSDsCounter, 634 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5495 IncrementalHoareTripleChecker+Invalid, 6129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 634 mSolverCounterUnsat, 322 mSDtfsCounter, 5495 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1347occurred in iteration=26, InterpolantAutomatonStates: 148, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 4444 NumberOfCodeBlocks, 4444 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4411 ConstructedInterpolants, 0 QuantifiedInterpolants, 5751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 15/15 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 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:00,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE