./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-5.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/parallel-ticket-5.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 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:33,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:33,511 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:39:33,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:33,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:33,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:33,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:33,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:33,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:33,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:33,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:33,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:33,545 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:33,546 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:33,546 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:33,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:33,546 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:33,546 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:33,546 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:33,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:33,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:33,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:33,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:33,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:33,547 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:33,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:33,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:33,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:33,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:33,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:33,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:33,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:33,547 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 -> 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f [2025-02-08 05:39:33,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:33,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:33,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:33,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:33,767 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:33,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2025-02-08 05:39:35,124 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dfb5d025/989a3626e03a40999102104a7651affa/FLAG92ea547d8 [2025-02-08 05:39:35,362 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:35,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2025-02-08 05:39:35,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dfb5d025/989a3626e03a40999102104a7651affa/FLAG92ea547d8 [2025-02-08 05:39:35,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dfb5d025/989a3626e03a40999102104a7651affa [2025-02-08 05:39:35,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:35,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:35,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:35,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:35,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:35,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a83c4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35, skipping insertion in model container [2025-02-08 05:39:35,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:35,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:35,848 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:35,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:35,871 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:35,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35 WrapperNode [2025-02-08 05:39:35,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:35,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:35,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:35,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:35,877 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:39:35" (1/1) ... [2025-02-08 05:39:35,882 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:39:35" (1/1) ... [2025-02-08 05:39:35,907 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 256 [2025-02-08 05:39:35,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:35,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:35,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:35,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:35,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,923 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:35,935 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:35,935 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:35,935 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:35,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35" (1/1) ... [2025-02-08 05:39:35,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:35,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:35,967 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:39:35,975 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:39:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:39:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:39:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-08 05:39:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-08 05:39:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:35,993 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:39:36,089 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:36,091 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:36,386 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:36,387 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:36,428 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:36,428 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:36,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:36 BoogieIcfgContainer [2025-02-08 05:39:36,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:36,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:36,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:36,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:36,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:35" (1/3) ... [2025-02-08 05:39:36,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3d3f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:36, skipping insertion in model container [2025-02-08 05:39:36,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:35" (2/3) ... [2025-02-08 05:39:36,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3d3f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:36, skipping insertion in model container [2025-02-08 05:39:36,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:36" (3/3) ... [2025-02-08 05:39:36,439 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2025-02-08 05:39:36,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:36,450 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-5.wvr.c that has 6 procedures, 271 locations, 1 initial locations, 0 loop locations, and 15 error locations. [2025-02-08 05:39:36,450 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:36,514 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-02-08 05:39:36,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 281 transitions, 597 flow [2025-02-08 05:39:36,603 INFO L124 PetriNetUnfolderBase]: 11/276 cut-off events. [2025-02-08 05:39:36,604 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:39:36,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 276 events. 11/276 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 490 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 233. Up to 2 conditions per place. [2025-02-08 05:39:36,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 281 transitions, 597 flow [2025-02-08 05:39:36,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 259 transitions, 545 flow [2025-02-08 05:39:36,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:36,632 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;@7eeeee09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:36,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-08 05:39:36,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:36,637 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-02-08 05:39:36,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:36,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:36,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:36,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:39:36,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:36,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1738636137, now seen corresponding path program 1 times [2025-02-08 05:39:36,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807754530] [2025-02-08 05:39:36,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:36,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:39:36,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:39:36,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:36,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:36,751 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:39:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:36,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807754530] [2025-02-08 05:39:36,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807754530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:36,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:36,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:36,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063678351] [2025-02-08 05:39:36,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:36,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:36,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:36,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:36,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:36,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-08 05:39:36,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 259 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:36,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:36,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-08 05:39:36,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:40,207 INFO L124 PetriNetUnfolderBase]: 8140/22951 cut-off events. [2025-02-08 05:39:40,208 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2025-02-08 05:39:40,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34557 conditions, 22951 events. 8140/22951 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 262123 event pairs, 5691 based on Foata normal form. 1950/21770 useless extension candidates. Maximal degree in co-relation 33945. Up to 10336 conditions per place. [2025-02-08 05:39:40,391 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 34 selfloop transitions, 2 changer transitions 1/252 dead transitions. [2025-02-08 05:39:40,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 252 transitions, 603 flow [2025-02-08 05:39:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2025-02-08 05:39:40,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8837485172004745 [2025-02-08 05:39:40,405 INFO L175 Difference]: Start difference. First operand has 265 places, 259 transitions, 545 flow. Second operand 3 states and 745 transitions. [2025-02-08 05:39:40,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 252 transitions, 603 flow [2025-02-08 05:39:40,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 252 transitions, 586 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 05:39:40,418 INFO L231 Difference]: Finished difference. Result has 257 places, 251 transitions, 516 flow [2025-02-08 05:39:40,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=257, PETRI_TRANSITIONS=251} [2025-02-08 05:39:40,424 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -8 predicate places. [2025-02-08 05:39:40,424 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 251 transitions, 516 flow [2025-02-08 05:39:40,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:40,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:40,425 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] [2025-02-08 05:39:40,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:40,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:39:40,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2130051975, now seen corresponding path program 1 times [2025-02-08 05:39:40,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:40,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894268617] [2025-02-08 05:39:40,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:40,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:39:40,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:39:40,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:40,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:40,465 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:39:40,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:40,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894268617] [2025-02-08 05:39:40,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894268617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:40,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:40,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:40,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770786156] [2025-02-08 05:39:40,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:40,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:40,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:40,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:40,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:40,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-08 05:39:40,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 251 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:40,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:40,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-08 05:39:40,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,747 INFO L124 PetriNetUnfolderBase]: 9181/24265 cut-off events. [2025-02-08 05:39:42,747 INFO L125 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2025-02-08 05:39:42,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36917 conditions, 24265 events. 9181/24265 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 270295 event pairs, 6649 based on Foata normal form. 0/21006 useless extension candidates. Maximal degree in co-relation 36881. Up to 11675 conditions per place. [2025-02-08 05:39:43,066 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2025-02-08 05:39:43,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 250 transitions, 586 flow [2025-02-08 05:39:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-02-08 05:39:43,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-02-08 05:39:43,073 INFO L175 Difference]: Start difference. First operand has 257 places, 251 transitions, 516 flow. Second operand 3 states and 739 transitions. [2025-02-08 05:39:43,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 250 transitions, 586 flow [2025-02-08 05:39:43,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 250 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:43,081 INFO L231 Difference]: Finished difference. Result has 255 places, 250 transitions, 514 flow [2025-02-08 05:39:43,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=255, PETRI_TRANSITIONS=250} [2025-02-08 05:39:43,082 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -10 predicate places. [2025-02-08 05:39:43,082 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 514 flow [2025-02-08 05:39:43,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:43,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:43,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:43,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:43,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:39:43,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1997808468, now seen corresponding path program 1 times [2025-02-08 05:39:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482283251] [2025-02-08 05:39:43,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:43,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:39:43,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:39:43,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:43,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:43,155 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:39:43,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:43,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482283251] [2025-02-08 05:39:43,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482283251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:43,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:43,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:43,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106394974] [2025-02-08 05:39:43,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:43,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:43,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:43,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:43,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-08 05:39:43,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:43,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:43,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-08 05:39:43,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:45,243 INFO L124 PetriNetUnfolderBase]: 9267/24292 cut-off events. [2025-02-08 05:39:45,244 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2025-02-08 05:39:45,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37061 conditions, 24292 events. 9267/24292 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 270744 event pairs, 6740 based on Foata normal form. 0/20931 useless extension candidates. Maximal degree in co-relation 37017. Up to 11781 conditions per place. [2025-02-08 05:39:45,382 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2025-02-08 05:39:45,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 249 transitions, 584 flow [2025-02-08 05:39:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-02-08 05:39:45,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-02-08 05:39:45,385 INFO L175 Difference]: Start difference. First operand has 255 places, 250 transitions, 514 flow. Second operand 3 states and 739 transitions. [2025-02-08 05:39:45,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 249 transitions, 584 flow [2025-02-08 05:39:45,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 249 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:45,389 INFO L231 Difference]: Finished difference. Result has 254 places, 249 transitions, 512 flow [2025-02-08 05:39:45,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=254, PETRI_TRANSITIONS=249} [2025-02-08 05:39:45,391 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -11 predicate places. [2025-02-08 05:39:45,391 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 249 transitions, 512 flow [2025-02-08 05:39:45,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:45,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:45,392 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:39:45,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:45,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:39:45,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1541127045, now seen corresponding path program 1 times [2025-02-08 05:39:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:45,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47912240] [2025-02-08 05:39:45,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:45,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:39:45,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:39:45,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:45,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:45,448 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:39:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47912240] [2025-02-08 05:39:45,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47912240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:45,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761289614] [2025-02-08 05:39:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:45,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:45,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:45,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:45,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:45,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-08 05:39:45,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 249 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:45,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:45,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-08 05:39:45,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:47,437 INFO L124 PetriNetUnfolderBase]: 9706/21096 cut-off events. [2025-02-08 05:39:47,437 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2025-02-08 05:39:47,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34356 conditions, 21096 events. 9706/21096 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 205825 event pairs, 7189 based on Foata normal form. 0/18384 useless extension candidates. Maximal degree in co-relation 34304. Up to 12334 conditions per place. [2025-02-08 05:39:47,566 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2025-02-08 05:39:47,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 248 transitions, 582 flow [2025-02-08 05:39:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-02-08 05:39:47,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-02-08 05:39:47,568 INFO L175 Difference]: Start difference. First operand has 254 places, 249 transitions, 512 flow. Second operand 3 states and 739 transitions. [2025-02-08 05:39:47,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 248 transitions, 582 flow [2025-02-08 05:39:47,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:47,571 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 510 flow [2025-02-08 05:39:47,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2025-02-08 05:39:47,572 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -12 predicate places. [2025-02-08 05:39:47,572 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 510 flow [2025-02-08 05:39:47,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:47,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:47,573 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] [2025-02-08 05:39:47,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:47,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:39:47,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:47,573 INFO L85 PathProgramCache]: Analyzing trace with hash 63339555, now seen corresponding path program 1 times [2025-02-08 05:39:47,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:47,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548078193] [2025-02-08 05:39:47,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:47,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:47,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:39:47,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:39:47,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:47,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:47,603 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:39:47,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548078193] [2025-02-08 05:39:47,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548078193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:47,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:47,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:47,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609648849] [2025-02-08 05:39:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:47,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:47,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:47,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:47,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-08 05:39:47,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:47,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:47,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-08 05:39:47,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:49,906 INFO L124 PetriNetUnfolderBase]: 8685/22770 cut-off events. [2025-02-08 05:39:49,907 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2025-02-08 05:39:49,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34475 conditions, 22770 events. 8685/22770 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 248313 event pairs, 6215 based on Foata normal form. 0/19671 useless extension candidates. Maximal degree in co-relation 34415. Up to 11049 conditions per place. [2025-02-08 05:39:50,070 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2025-02-08 05:39:50,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 247 transitions, 580 flow [2025-02-08 05:39:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-02-08 05:39:50,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766310794780545 [2025-02-08 05:39:50,073 INFO L175 Difference]: Start difference. First operand has 253 places, 248 transitions, 510 flow. Second operand 3 states and 739 transitions. [2025-02-08 05:39:50,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 247 transitions, 580 flow [2025-02-08 05:39:50,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 247 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:50,078 INFO L231 Difference]: Finished difference. Result has 252 places, 247 transitions, 508 flow [2025-02-08 05:39:50,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=252, PETRI_TRANSITIONS=247} [2025-02-08 05:39:50,079 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -13 predicate places. [2025-02-08 05:39:50,079 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 247 transitions, 508 flow [2025-02-08 05:39:50,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:50,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:50,084 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] [2025-02-08 05:39:50,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:50,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:39:50,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash 654571398, now seen corresponding path program 1 times [2025-02-08 05:39:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250415561] [2025-02-08 05:39:50,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:50,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:39:50,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:39:50,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:50,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:50,171 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:39:50,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:50,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250415561] [2025-02-08 05:39:50,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250415561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:50,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:50,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:50,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708687578] [2025-02-08 05:39:50,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:50,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:50,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:50,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:50,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:50,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-02-08 05:39:50,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 247 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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:50,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:50,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-02-08 05:39:50,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:52,779 INFO L124 PetriNetUnfolderBase]: 11755/30292 cut-off events. [2025-02-08 05:39:52,780 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2025-02-08 05:39:52,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46458 conditions, 30292 events. 11755/30292 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 1216. Compared 345963 event pairs, 6460 based on Foata normal form. 0/26240 useless extension candidates. Maximal degree in co-relation 46390. Up to 11588 conditions per place. [2025-02-08 05:39:52,990 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 49 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-02-08 05:39:52,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 262 transitions, 645 flow [2025-02-08 05:39:52,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-02-08 05:39:52,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015421115065243 [2025-02-08 05:39:52,992 INFO L175 Difference]: Start difference. First operand has 252 places, 247 transitions, 508 flow. Second operand 3 states and 760 transitions. [2025-02-08 05:39:52,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 262 transitions, 645 flow [2025-02-08 05:39:52,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:52,995 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 506 flow [2025-02-08 05:39:52,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2025-02-08 05:39:52,996 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -14 predicate places. [2025-02-08 05:39:52,996 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 506 flow [2025-02-08 05:39:52,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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:52,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:52,997 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] [2025-02-08 05:39:52,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:52,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:39:52,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1901759544, now seen corresponding path program 1 times [2025-02-08 05:39:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:52,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730490183] [2025-02-08 05:39:52,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:52,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:53,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:39:53,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:39:53,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:53,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:53,055 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:39:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730490183] [2025-02-08 05:39:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730490183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:53,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051698585] [2025-02-08 05:39:53,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:53,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:53,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:53,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:53,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-02-08 05:39:53,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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:53,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:53,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-02-08 05:39:53,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:54,908 INFO L124 PetriNetUnfolderBase]: 10729/21932 cut-off events. [2025-02-08 05:39:54,908 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2025-02-08 05:39:54,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36888 conditions, 21932 events. 10729/21932 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 201080 event pairs, 5362 based on Foata normal form. 0/20328 useless extension candidates. Maximal degree in co-relation 27803. Up to 9906 conditions per place. [2025-02-08 05:39:55,031 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 48 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2025-02-08 05:39:55,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 261 transitions, 639 flow [2025-02-08 05:39:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 764 transitions. [2025-02-08 05:39:55,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9062870699881376 [2025-02-08 05:39:55,033 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 506 flow. Second operand 3 states and 764 transitions. [2025-02-08 05:39:55,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 261 transitions, 639 flow [2025-02-08 05:39:55,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:55,037 INFO L231 Difference]: Finished difference. Result has 250 places, 245 transitions, 502 flow [2025-02-08 05:39:55,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=250, PETRI_TRANSITIONS=245} [2025-02-08 05:39:55,037 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places. [2025-02-08 05:39:55,038 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 245 transitions, 502 flow [2025-02-08 05:39:55,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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:55,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:55,038 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] [2025-02-08 05:39:55,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:55,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:39:55,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash -452901935, now seen corresponding path program 1 times [2025-02-08 05:39:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397044874] [2025-02-08 05:39:55,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:55,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:39:55,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:39:55,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:55,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:55,075 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:39:55,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:55,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397044874] [2025-02-08 05:39:55,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397044874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:55,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:55,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734295508] [2025-02-08 05:39:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:55,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:55,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:55,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:55,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:55,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-02-08 05:39:55,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 245 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:55,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:55,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-02-08 05:39:55,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:57,908 INFO L124 PetriNetUnfolderBase]: 14428/32703 cut-off events. [2025-02-08 05:39:57,909 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2025-02-08 05:39:57,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52534 conditions, 32703 events. 14428/32703 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 355218 event pairs, 7947 based on Foata normal form. 0/28649 useless extension candidates. Maximal degree in co-relation 40943. Up to 13745 conditions per place. [2025-02-08 05:39:58,112 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2025-02-08 05:39:58,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 261 transitions, 643 flow [2025-02-08 05:39:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2025-02-08 05:39:58,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027283511269276 [2025-02-08 05:39:58,114 INFO L175 Difference]: Start difference. First operand has 250 places, 245 transitions, 502 flow. Second operand 3 states and 761 transitions. [2025-02-08 05:39:58,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 261 transitions, 643 flow [2025-02-08 05:39:58,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:58,117 INFO L231 Difference]: Finished difference. Result has 250 places, 244 transitions, 503 flow [2025-02-08 05:39:58,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=503, PETRI_PLACES=250, PETRI_TRANSITIONS=244} [2025-02-08 05:39:58,118 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places. [2025-02-08 05:39:58,118 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 244 transitions, 503 flow [2025-02-08 05:39:58,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:58,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:58,119 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] [2025-02-08 05:39:58,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:58,119 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:39:58,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash 961141011, now seen corresponding path program 1 times [2025-02-08 05:39:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:58,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049555225] [2025-02-08 05:39:58,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:58,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:39:58,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:39:58,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:58,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:58,158 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:39:58,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:58,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049555225] [2025-02-08 05:39:58,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049555225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:58,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:58,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:58,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164987716] [2025-02-08 05:39:58,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:58,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:58,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:58,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:58,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:58,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-02-08 05:39:58,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 244 transitions, 503 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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:58,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:58,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-02-08 05:39:58,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:00,204 INFO L124 PetriNetUnfolderBase]: 11068/25050 cut-off events. [2025-02-08 05:40:00,205 INFO L125 PetriNetUnfolderBase]: For 864/864 co-relation queries the response was YES. [2025-02-08 05:40:00,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40703 conditions, 25050 events. 11068/25050 cut-off events. For 864/864 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 253624 event pairs, 4982 based on Foata normal form. 0/22705 useless extension candidates. Maximal degree in co-relation 31491. Up to 8803 conditions per place. [2025-02-08 05:40:00,351 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 49 selfloop transitions, 1 changer transitions 0/260 dead transitions. [2025-02-08 05:40:00,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 260 transitions, 640 flow [2025-02-08 05:40:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-02-08 05:40:00,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074733096085409 [2025-02-08 05:40:00,354 INFO L175 Difference]: Start difference. First operand has 250 places, 244 transitions, 503 flow. Second operand 3 states and 765 transitions. [2025-02-08 05:40:00,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 260 transitions, 640 flow [2025-02-08 05:40:00,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 260 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:00,359 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 499 flow [2025-02-08 05:40:00,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=249, PETRI_TRANSITIONS=243} [2025-02-08 05:40:00,360 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places. [2025-02-08 05:40:00,360 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 499 flow [2025-02-08 05:40:00,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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:40:00,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:00,361 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] [2025-02-08 05:40:00,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:00,361 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:40:00,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1562667426, now seen corresponding path program 1 times [2025-02-08 05:40:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728951511] [2025-02-08 05:40:00,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:00,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:40:00,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:40:00,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:00,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:00,403 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:40:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:00,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728951511] [2025-02-08 05:40:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728951511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:00,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:00,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:00,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130317154] [2025-02-08 05:40:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:00,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:00,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:00,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:00,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:00,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-02-08 05:40:00,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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:40:00,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:00,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-02-08 05:40:00,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:03,145 INFO L124 PetriNetUnfolderBase]: 14487/31582 cut-off events. [2025-02-08 05:40:03,146 INFO L125 PetriNetUnfolderBase]: For 603/603 co-relation queries the response was YES. [2025-02-08 05:40:03,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51474 conditions, 31582 events. 14487/31582 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 335150 event pairs, 7988 based on Foata normal form. 0/27701 useless extension candidates. Maximal degree in co-relation 40321. Up to 13706 conditions per place. [2025-02-08 05:40:03,314 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2025-02-08 05:40:03,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 259 transitions, 640 flow [2025-02-08 05:40:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2025-02-08 05:40:03,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027283511269276 [2025-02-08 05:40:03,316 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 499 flow. Second operand 3 states and 761 transitions. [2025-02-08 05:40:03,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 259 transitions, 640 flow [2025-02-08 05:40:03,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 259 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:03,320 INFO L231 Difference]: Finished difference. Result has 249 places, 242 transitions, 500 flow [2025-02-08 05:40:03,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=249, PETRI_TRANSITIONS=242} [2025-02-08 05:40:03,322 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places. [2025-02-08 05:40:03,322 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 242 transitions, 500 flow [2025-02-08 05:40:03,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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:40:03,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:03,323 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] [2025-02-08 05:40:03,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:03,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:40:03,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash 91933664, now seen corresponding path program 1 times [2025-02-08 05:40:03,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:03,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490589321] [2025-02-08 05:40:03,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:03,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:40:03,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:40:03,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:03,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:03,387 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:40:03,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:03,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490589321] [2025-02-08 05:40:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490589321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:03,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:03,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374871940] [2025-02-08 05:40:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:03,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:03,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:03,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:03,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:03,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-02-08 05:40:03,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 242 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:03,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-02-08 05:40:03,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:05,867 INFO L124 PetriNetUnfolderBase]: 10372/25666 cut-off events. [2025-02-08 05:40:05,867 INFO L125 PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES. [2025-02-08 05:40:05,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40457 conditions, 25666 events. 10372/25666 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 278071 event pairs, 3395 based on Foata normal form. 0/22524 useless extension candidates. Maximal degree in co-relation 31513. Up to 7615 conditions per place. [2025-02-08 05:40:06,003 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 49 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2025-02-08 05:40:06,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 258 transitions, 637 flow [2025-02-08 05:40:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-02-08 05:40:06,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074733096085409 [2025-02-08 05:40:06,005 INFO L175 Difference]: Start difference. First operand has 249 places, 242 transitions, 500 flow. Second operand 3 states and 765 transitions. [2025-02-08 05:40:06,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 258 transitions, 637 flow [2025-02-08 05:40:06,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 258 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:06,012 INFO L231 Difference]: Finished difference. Result has 248 places, 241 transitions, 496 flow [2025-02-08 05:40:06,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=248, PETRI_TRANSITIONS=241} [2025-02-08 05:40:06,013 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places. [2025-02-08 05:40:06,013 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 241 transitions, 496 flow [2025-02-08 05:40:06,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:06,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:06,013 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] [2025-02-08 05:40:06,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:06,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:40:06,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1204852429, now seen corresponding path program 1 times [2025-02-08 05:40:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:06,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091500567] [2025-02-08 05:40:06,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:06,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 05:40:06,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 05:40:06,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:06,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:06,047 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:40:06,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:06,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091500567] [2025-02-08 05:40:06,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091500567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:06,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:06,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622681925] [2025-02-08 05:40:06,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:06,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:06,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:06,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:06,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281 [2025-02-08 05:40:06,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 241 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 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:40:06,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:06,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281 [2025-02-08 05:40:06,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:08,086 INFO L124 PetriNetUnfolderBase]: 14972/27283 cut-off events. [2025-02-08 05:40:08,087 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES. [2025-02-08 05:40:08,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47682 conditions, 27283 events. 14972/27283 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 245071 event pairs, 8588 based on Foata normal form. 0/24254 useless extension candidates. Maximal degree in co-relation 37304. Up to 14363 conditions per place. [2025-02-08 05:40:08,435 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2025-02-08 05:40:08,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 257 transitions, 637 flow [2025-02-08 05:40:08,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2025-02-08 05:40:08,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027283511269276 [2025-02-08 05:40:08,437 INFO L175 Difference]: Start difference. First operand has 248 places, 241 transitions, 496 flow. Second operand 3 states and 761 transitions. [2025-02-08 05:40:08,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 257 transitions, 637 flow [2025-02-08 05:40:08,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 257 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:08,440 INFO L231 Difference]: Finished difference. Result has 248 places, 240 transitions, 497 flow [2025-02-08 05:40:08,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=248, PETRI_TRANSITIONS=240} [2025-02-08 05:40:08,441 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places. [2025-02-08 05:40:08,441 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 240 transitions, 497 flow [2025-02-08 05:40:08,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 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:40:08,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:08,442 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:40:08,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:08,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:40:08,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:08,442 INFO L85 PathProgramCache]: Analyzing trace with hash -732177675, now seen corresponding path program 1 times [2025-02-08 05:40:08,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:08,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663625184] [2025-02-08 05:40:08,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:08,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:08,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:40:08,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:40:08,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:08,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:08,479 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:40:08,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:08,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663625184] [2025-02-08 05:40:08,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663625184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:08,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:08,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784210175] [2025-02-08 05:40:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:08,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:08,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:08,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:08,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281 [2025-02-08 05:40:08,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 240 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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:40:08,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:08,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281 [2025-02-08 05:40:08,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand