./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.i --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/pthread-theta/unwind3-100.i -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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:47:33,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:47:33,074 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:47:33,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:47:33,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:47:33,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:47:33,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:47:33,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:47:33,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:47:33,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:47:33,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:47:33,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:47:33,115 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:47:33,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:47:33,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:47:33,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:47:33,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:47:33,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:47:33,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:47:33,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:47:33,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:47:33,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:47:33,117 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:47:33,117 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:47:33,117 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:47:33,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:47:33,117 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:47:33,117 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:47:33,117 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:47:33,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:47:33,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:47:33,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:47:33,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:47:33,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:47:33,119 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:47:33,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:47:33,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:47:33,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:47:33,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:47:33,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:47:33,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:47:33,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:47:33,119 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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-02-08 05:47:33,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:47:33,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:47:33,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:47:33,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:47:33,419 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:47:33,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-02-08 05:47:34,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59220c2fb/b78da089011a45238f4d3f99dcbd34d5/FLAG9d5049294 [2025-02-08 05:47:35,012 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:47:35,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-02-08 05:47:35,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59220c2fb/b78da089011a45238f4d3f99dcbd34d5/FLAG9d5049294 [2025-02-08 05:47:35,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59220c2fb/b78da089011a45238f4d3f99dcbd34d5 [2025-02-08 05:47:35,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:47:35,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:47:35,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:47:35,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:47:35,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:47:35,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30326cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35, skipping insertion in model container [2025-02-08 05:47:35,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:47:35,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:47:35,357 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:47:35,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:47:35,432 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:47:35,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35 WrapperNode [2025-02-08 05:47:35,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:47:35,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:47:35,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:47:35,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:47:35,441 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:47:35" (1/1) ... [2025-02-08 05:47:35,452 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:47:35" (1/1) ... [2025-02-08 05:47:35,475 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-02-08 05:47:35,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:47:35,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:47:35,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:47:35,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:47:35,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:47:35,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:47:35,504 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:47:35,505 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:47:35,507 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35" (1/1) ... [2025-02-08 05:47:35,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:47:35,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:47:35,534 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:47:35,537 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:47:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:47:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-08 05:47:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-08 05:47:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-08 05:47:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-08 05:47:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:47:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:47:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:47:35,556 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:47:35,676 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:47:35,678 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:47:35,869 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:47:35,869 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:47:35,889 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:47:35,889 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:47:35,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:47:35 BoogieIcfgContainer [2025-02-08 05:47:35,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:47:35,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:47:35,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:47:35,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:47:35,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:47:35" (1/3) ... [2025-02-08 05:47:35,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347a0467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:47:35, skipping insertion in model container [2025-02-08 05:47:35,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:35" (2/3) ... [2025-02-08 05:47:35,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347a0467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:47:35, skipping insertion in model container [2025-02-08 05:47:35,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:47:35" (3/3) ... [2025-02-08 05:47:35,898 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-02-08 05:47:35,910 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:47:35,911 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 99 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-02-08 05:47:35,912 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:47:35,976 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:47:36,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 105 transitions, 218 flow [2025-02-08 05:47:36,058 INFO L124 PetriNetUnfolderBase]: 10/154 cut-off events. [2025-02-08 05:47:36,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:36,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 154 events. 10/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 278 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. [2025-02-08 05:47:36,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 105 transitions, 218 flow [2025-02-08 05:47:36,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 88 transitions, 183 flow [2025-02-08 05:47:36,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:36,087 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;@4ceb7c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:36,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 05:47:36,093 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:36,094 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 05:47:36,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:36,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:36,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:36,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:47:36,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:36,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1266920311, now seen corresponding path program 1 times [2025-02-08 05:47:36,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:36,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018296285] [2025-02-08 05:47:36,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:36,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:36,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:47:36,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:47:36,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:36,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:36,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018296285] [2025-02-08 05:47:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018296285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:36,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:36,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:36,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614796793] [2025-02-08 05:47:36,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:36,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:36,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:36,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:36,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:36,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2025-02-08 05:47:36,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:47:36,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:36,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2025-02-08 05:47:36,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:36,386 INFO L124 PetriNetUnfolderBase]: 11/144 cut-off events. [2025-02-08 05:47:36,390 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:47:36,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 144 events. 11/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 291 event pairs, 8 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 101. Up to 33 conditions per place. [2025-02-08 05:47:36,392 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 13 selfloop transitions, 2 changer transitions 1/85 dead transitions. [2025-02-08 05:47:36,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 207 flow [2025-02-08 05:47:36,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2025-02-08 05:47:36,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-02-08 05:47:36,410 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 183 flow. Second operand 3 states and 270 transitions. [2025-02-08 05:47:36,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 207 flow [2025-02-08 05:47:36,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:36,421 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 178 flow [2025-02-08 05:47:36,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2025-02-08 05:47:36,429 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 0 predicate places. [2025-02-08 05:47:36,430 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 178 flow [2025-02-08 05:47:36,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:47:36,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:36,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:36,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:47:36,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:47:36,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1349731182, now seen corresponding path program 1 times [2025-02-08 05:47:36,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:36,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574391463] [2025-02-08 05:47:36,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:36,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:36,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:47:36,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:47:36,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:36,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:36,525 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:47:36,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:36,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574391463] [2025-02-08 05:47:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574391463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:36,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:36,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821829414] [2025-02-08 05:47:36,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:36,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:36,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:36,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:36,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2025-02-08 05:47:36,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:47:36,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:36,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2025-02-08 05:47:36,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:36,598 INFO L124 PetriNetUnfolderBase]: 7/126 cut-off events. [2025-02-08 05:47:36,602 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:47:36,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 126 events. 7/126 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 221 event pairs, 4 based on Foata normal form. 3/121 useless extension candidates. Maximal degree in co-relation 144. Up to 25 conditions per place. [2025-02-08 05:47:36,604 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 11 selfloop transitions, 1 changer transitions 24/79 dead transitions. [2025-02-08 05:47:36,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 196 flow [2025-02-08 05:47:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-02-08 05:47:36,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-02-08 05:47:36,607 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 178 flow. Second operand 3 states and 259 transitions. [2025-02-08 05:47:36,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 196 flow [2025-02-08 05:47:36,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 79 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:47:36,610 INFO L231 Difference]: Finished difference. Result has 84 places, 55 transitions, 116 flow [2025-02-08 05:47:36,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=84, PETRI_TRANSITIONS=55} [2025-02-08 05:47:36,610 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-02-08 05:47:36,611 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 55 transitions, 116 flow [2025-02-08 05:47:36,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:47:36,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:36,611 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:36,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:47:36,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:47:36,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash -744453045, now seen corresponding path program 1 times [2025-02-08 05:47:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:36,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322766717] [2025-02-08 05:47:36,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:36,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:47:36,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:47:36,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:36,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:36,766 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:47:36,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322766717] [2025-02-08 05:47:36,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322766717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:36,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:36,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:47:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114052310] [2025-02-08 05:47:36,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:36,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:47:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:36,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:47:36,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:47:36,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2025-02-08 05:47:36,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 55 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 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:47:36,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:36,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2025-02-08 05:47:36,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:36,853 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2025-02-08 05:47:36,854 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:47:36,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 61 events. 0/61 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-02-08 05:47:36,854 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 7 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-02-08 05:47:36,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 134 flow [2025-02-08 05:47:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:47:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:47:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-02-08 05:47:36,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547619047619047 [2025-02-08 05:47:36,859 INFO L175 Difference]: Start difference. First operand has 84 places, 55 transitions, 116 flow. Second operand 4 states and 359 transitions. [2025-02-08 05:47:36,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 134 flow [2025-02-08 05:47:36,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 54 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:36,861 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 119 flow [2025-02-08 05:47:36,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-02-08 05:47:36,866 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -29 predicate places. [2025-02-08 05:47:36,866 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 119 flow [2025-02-08 05:47:36,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 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:47:36,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:36,866 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:36,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:47:36,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:47:36,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:36,867 INFO L85 PathProgramCache]: Analyzing trace with hash -133445760, now seen corresponding path program 1 times [2025-02-08 05:47:36,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:36,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756501201] [2025-02-08 05:47:36,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:36,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:36,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:47:36,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:47:36,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:36,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:36,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:36,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:47:36,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:47:36,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:36,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:36,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:36,945 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:36,946 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-08 05:47:36,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-08 05:47:36,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-08 05:47:36,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-08 05:47:36,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-02-08 05:47:36,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-08 05:47:36,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-02-08 05:47:36,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-08 05:47:36,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-08 05:47:36,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:47:36,951 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:47:36,955 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:36,955 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:47:36,996 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:47:37,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 141 transitions, 302 flow [2025-02-08 05:47:37,043 INFO L124 PetriNetUnfolderBase]: 14/217 cut-off events. [2025-02-08 05:47:37,043 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:47:37,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 217 events. 14/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 466 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 228. Up to 6 conditions per place. [2025-02-08 05:47:37,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 141 transitions, 302 flow [2025-02-08 05:47:37,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 95 transitions, 203 flow [2025-02-08 05:47:37,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:37,047 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;@4ceb7c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:37,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 05:47:37,049 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:37,049 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 05:47:37,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:37,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:37,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:37,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:47:37,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1094109161, now seen corresponding path program 1 times [2025-02-08 05:47:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590097932] [2025-02-08 05:47:37,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:37,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:47:37,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:47:37,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:37,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:37,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:37,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590097932] [2025-02-08 05:47:37,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590097932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:37,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:37,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323065561] [2025-02-08 05:47:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:37,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:37,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:37,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:37,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 141 [2025-02-08 05:47:37,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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:47:37,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:37,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 141 [2025-02-08 05:47:37,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:37,196 INFO L124 PetriNetUnfolderBase]: 38/268 cut-off events. [2025-02-08 05:47:37,197 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 05:47:37,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 268 events. 38/268 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 891 event pairs, 34 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 185. Up to 83 conditions per place. [2025-02-08 05:47:37,199 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 15 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2025-02-08 05:47:37,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 231 flow [2025-02-08 05:47:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-02-08 05:47:37,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8486997635933806 [2025-02-08 05:47:37,202 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 203 flow. Second operand 3 states and 359 transitions. [2025-02-08 05:47:37,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 231 flow [2025-02-08 05:47:37,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 92 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:37,206 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 198 flow [2025-02-08 05:47:37,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2025-02-08 05:47:37,209 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2025-02-08 05:47:37,209 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 198 flow [2025-02-08 05:47:37,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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:47:37,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:37,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:37,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:47:37,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:47:37,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:37,210 INFO L85 PathProgramCache]: Analyzing trace with hash 99464955, now seen corresponding path program 1 times [2025-02-08 05:47:37,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:37,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874098452] [2025-02-08 05:47:37,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:37,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:37,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:47:37,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:47:37,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:37,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:37,233 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:47:37,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:37,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874098452] [2025-02-08 05:47:37,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874098452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:37,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109403752] [2025-02-08 05:47:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:37,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:37,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:37,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:37,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:37,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 141 [2025-02-08 05:47:37,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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:47:37,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:37,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 141 [2025-02-08 05:47:37,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:37,297 INFO L124 PetriNetUnfolderBase]: 26/230 cut-off events. [2025-02-08 05:47:37,298 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:47:37,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 230 events. 26/230 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 700 event pairs, 22 based on Foata normal form. 7/220 useless extension candidates. Maximal degree in co-relation 300. Up to 63 conditions per place. [2025-02-08 05:47:37,299 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 13 selfloop transitions, 1 changer transitions 18/86 dead transitions. [2025-02-08 05:47:37,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 86 transitions, 220 flow [2025-02-08 05:47:37,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-02-08 05:47:37,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8085106382978723 [2025-02-08 05:47:37,301 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 198 flow. Second operand 3 states and 342 transitions. [2025-02-08 05:47:37,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 86 transitions, 220 flow [2025-02-08 05:47:37,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 86 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:47:37,303 INFO L231 Difference]: Finished difference. Result has 93 places, 68 transitions, 148 flow [2025-02-08 05:47:37,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=93, PETRI_TRANSITIONS=68} [2025-02-08 05:47:37,304 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -6 predicate places. [2025-02-08 05:47:37,304 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 68 transitions, 148 flow [2025-02-08 05:47:37,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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:47:37,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:37,305 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:37,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:47:37,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:47:37,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash 797752002, now seen corresponding path program 1 times [2025-02-08 05:47:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255578678] [2025-02-08 05:47:37,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:37,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:37,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:47:37,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:47:37,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:37,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:37,401 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:47:37,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:37,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255578678] [2025-02-08 05:47:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255578678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:37,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:37,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:47:37,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173468946] [2025-02-08 05:47:37,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:37,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:47:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:37,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:47:37,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:47:37,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 141 [2025-02-08 05:47:37,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 68 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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:47:37,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:37,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 141 [2025-02-08 05:47:37,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:37,475 INFO L124 PetriNetUnfolderBase]: 2/107 cut-off events. [2025-02-08 05:47:37,475 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:47:37,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 107 events. 2/107 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 2 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 112. Up to 12 conditions per place. [2025-02-08 05:47:37,475 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 9 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2025-02-08 05:47:37,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 67 transitions, 170 flow [2025-02-08 05:47:37,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:47:37,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:47:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2025-02-08 05:47:37,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8528368794326241 [2025-02-08 05:47:37,478 INFO L175 Difference]: Start difference. First operand has 93 places, 68 transitions, 148 flow. Second operand 4 states and 481 transitions. [2025-02-08 05:47:37,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 67 transitions, 170 flow [2025-02-08 05:47:37,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 67 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:37,480 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 151 flow [2025-02-08 05:47:37,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2025-02-08 05:47:37,481 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -23 predicate places. [2025-02-08 05:47:37,481 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 151 flow [2025-02-08 05:47:37,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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:47:37,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:37,482 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:37,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:47:37,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:47:37,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash 78833892, now seen corresponding path program 1 times [2025-02-08 05:47:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307891723] [2025-02-08 05:47:37,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:37,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:37,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:47:37,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:47:37,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:37,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:37,497 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:37,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:47:37,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:47:37,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:37,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:37,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:37,520 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:37,520 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-08 05:47:37,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-08 05:47:37,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-08 05:47:37,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-08 05:47:37,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-08 05:47:37,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-08 05:47:37,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2025-02-08 05:47:37,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-08 05:47:37,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-08 05:47:37,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-08 05:47:37,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:47:37,521 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:47:37,522 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:37,522 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:47:37,558 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:47:37,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 177 transitions, 390 flow [2025-02-08 05:47:37,582 INFO L124 PetriNetUnfolderBase]: 18/280 cut-off events. [2025-02-08 05:47:37,582 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:47:37,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 280 events. 18/280 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 662 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 297. Up to 8 conditions per place. [2025-02-08 05:47:37,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 177 transitions, 390 flow [2025-02-08 05:47:37,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 102 transitions, 225 flow [2025-02-08 05:47:37,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:37,591 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;@4ceb7c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:37,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 05:47:37,593 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:37,593 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 05:47:37,593 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:37,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:37,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:37,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:47:37,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1607746871, now seen corresponding path program 1 times [2025-02-08 05:47:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:37,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745510439] [2025-02-08 05:47:37,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:37,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:37,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:47:37,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:47:37,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:37,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:37,619 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:47:37,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:37,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745510439] [2025-02-08 05:47:37,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745510439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:37,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:37,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:37,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525918530] [2025-02-08 05:47:37,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:37,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:37,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:37,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:37,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 177 [2025-02-08 05:47:37,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:47:37,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:37,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 177 [2025-02-08 05:47:37,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:37,748 INFO L124 PetriNetUnfolderBase]: 115/514 cut-off events. [2025-02-08 05:47:37,748 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-08 05:47:37,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 514 events. 115/514 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2375 event pairs, 110 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 384. Up to 207 conditions per place. [2025-02-08 05:47:37,752 INFO L140 encePairwiseOnDemand]: 172/177 looper letters, 17 selfloop transitions, 2 changer transitions 1/99 dead transitions. [2025-02-08 05:47:37,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 99 transitions, 257 flow [2025-02-08 05:47:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2025-02-08 05:47:37,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8436911487758946 [2025-02-08 05:47:37,755 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 225 flow. Second operand 3 states and 448 transitions. [2025-02-08 05:47:37,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 99 transitions, 257 flow [2025-02-08 05:47:37,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 99 transitions, 254 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:37,758 INFO L231 Difference]: Finished difference. Result has 108 places, 98 transitions, 218 flow [2025-02-08 05:47:37,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=108, PETRI_TRANSITIONS=98} [2025-02-08 05:47:37,759 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 0 predicate places. [2025-02-08 05:47:37,759 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 98 transitions, 218 flow [2025-02-08 05:47:37,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:47:37,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:37,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:37,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:47:37,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:47:37,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1088685740, now seen corresponding path program 1 times [2025-02-08 05:47:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:37,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220625811] [2025-02-08 05:47:37,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:37,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:37,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:47:37,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:47:37,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:37,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:37,787 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:47:37,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:37,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220625811] [2025-02-08 05:47:37,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220625811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:37,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:37,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464690520] [2025-02-08 05:47:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:37,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:37,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:37,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:37,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 177 [2025-02-08 05:47:37,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 98 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 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:47:37,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:37,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 177 [2025-02-08 05:47:37,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:37,874 INFO L124 PetriNetUnfolderBase]: 83/432 cut-off events. [2025-02-08 05:47:37,874 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:47:37,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 432 events. 83/432 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1867 event pairs, 78 based on Foata normal form. 15/417 useless extension candidates. Maximal degree in co-relation 626. Up to 159 conditions per place. [2025-02-08 05:47:37,876 INFO L140 encePairwiseOnDemand]: 171/177 looper letters, 15 selfloop transitions, 1 changer transitions 18/93 dead transitions. [2025-02-08 05:47:37,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 93 transitions, 244 flow [2025-02-08 05:47:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2025-02-08 05:47:37,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800376647834275 [2025-02-08 05:47:37,878 INFO L175 Difference]: Start difference. First operand has 108 places, 98 transitions, 218 flow. Second operand 3 states and 425 transitions. [2025-02-08 05:47:37,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 93 transitions, 244 flow [2025-02-08 05:47:37,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 93 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:47:37,880 INFO L231 Difference]: Finished difference. Result has 102 places, 75 transitions, 168 flow [2025-02-08 05:47:37,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=102, PETRI_TRANSITIONS=75} [2025-02-08 05:47:37,880 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, -6 predicate places. [2025-02-08 05:47:37,880 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 75 transitions, 168 flow [2025-02-08 05:47:37,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 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:47:37,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:37,881 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:37,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:47:37,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:47:37,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:37,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1835052990, now seen corresponding path program 1 times [2025-02-08 05:47:37,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:37,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792907853] [2025-02-08 05:47:37,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:37,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:37,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:47:37,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:47:37,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:37,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:37,985 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:47:37,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:37,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792907853] [2025-02-08 05:47:37,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792907853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:37,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:37,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:47:37,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362743704] [2025-02-08 05:47:37,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:37,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:47:37,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:37,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:47:37,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:47:38,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 177 [2025-02-08 05:47:38,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 75 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:47:38,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:38,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 177 [2025-02-08 05:47:38,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:38,070 INFO L124 PetriNetUnfolderBase]: 10/159 cut-off events. [2025-02-08 05:47:38,070 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:47:38,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 159 events. 10/159 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 305 event pairs, 10 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 192. Up to 28 conditions per place. [2025-02-08 05:47:38,072 INFO L140 encePairwiseOnDemand]: 173/177 looper letters, 11 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-02-08 05:47:38,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 74 transitions, 194 flow [2025-02-08 05:47:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:47:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:47:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2025-02-08 05:47:38,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8516949152542372 [2025-02-08 05:47:38,074 INFO L175 Difference]: Start difference. First operand has 102 places, 75 transitions, 168 flow. Second operand 4 states and 603 transitions. [2025-02-08 05:47:38,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 74 transitions, 194 flow [2025-02-08 05:47:38,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 74 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:38,076 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 171 flow [2025-02-08 05:47:38,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2025-02-08 05:47:38,076 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, -23 predicate places. [2025-02-08 05:47:38,077 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 171 flow [2025-02-08 05:47:38,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:47:38,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:38,077 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:38,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:47:38,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:47:38,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash -311238927, now seen corresponding path program 1 times [2025-02-08 05:47:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:38,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153433628] [2025-02-08 05:47:38,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:38,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:38,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:47:38,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:47:38,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:38,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:38,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:38,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:47:38,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:47:38,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:38,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:38,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:38,125 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:38,125 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 05:47:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-08 05:47:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-08 05:47:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-08 05:47:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-08 05:47:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-02-08 05:47:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-02-08 05:47:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-08 05:47:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-08 05:47:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-08 05:47:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-08 05:47:38,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:47:38,126 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:47:38,126 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:38,126 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:47:38,172 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:47:38,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 213 transitions, 482 flow [2025-02-08 05:47:38,203 INFO L124 PetriNetUnfolderBase]: 22/343 cut-off events. [2025-02-08 05:47:38,203 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:47:38,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 343 events. 22/343 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 866 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 367. Up to 10 conditions per place. [2025-02-08 05:47:38,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 213 transitions, 482 flow [2025-02-08 05:47:38,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 249 flow [2025-02-08 05:47:38,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:38,207 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;@4ceb7c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:38,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 05:47:38,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:38,208 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 05:47:38,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:38,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:38,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:38,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:47:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash -782553815, now seen corresponding path program 1 times [2025-02-08 05:47:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717440383] [2025-02-08 05:47:38,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:38,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:47:38,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:47:38,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:38,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:38,224 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:47:38,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:38,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717440383] [2025-02-08 05:47:38,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717440383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:38,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:38,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:38,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420591091] [2025-02-08 05:47:38,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:38,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:38,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:38,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:38,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:38,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 213 [2025-02-08 05:47:38,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 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:47:38,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:38,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 213 [2025-02-08 05:47:38,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:38,396 INFO L124 PetriNetUnfolderBase]: 316/1028 cut-off events. [2025-02-08 05:47:38,396 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-02-08 05:47:38,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 1028 events. 316/1028 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5858 event pairs, 310 based on Foata normal form. 1/964 useless extension candidates. Maximal degree in co-relation 835. Up to 503 conditions per place. [2025-02-08 05:47:38,404 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 19 selfloop transitions, 2 changer transitions 1/106 dead transitions. [2025-02-08 05:47:38,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 106 transitions, 285 flow [2025-02-08 05:47:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2025-02-08 05:47:38,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8403755868544601 [2025-02-08 05:47:38,406 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 249 flow. Second operand 3 states and 537 transitions. [2025-02-08 05:47:38,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 106 transitions, 285 flow [2025-02-08 05:47:38,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 106 transitions, 278 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:38,409 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 238 flow [2025-02-08 05:47:38,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2025-02-08 05:47:38,409 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2025-02-08 05:47:38,409 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 238 flow [2025-02-08 05:47:38,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 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:47:38,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:38,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:38,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:47:38,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:47:38,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash 22426241, now seen corresponding path program 1 times [2025-02-08 05:47:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:38,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263084963] [2025-02-08 05:47:38,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:38,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:38,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:47:38,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:47:38,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:38,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:38,456 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:47:38,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:38,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263084963] [2025-02-08 05:47:38,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263084963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:38,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:38,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:38,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542524186] [2025-02-08 05:47:38,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:38,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:38,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:38,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:38,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:38,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2025-02-08 05:47:38,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:47:38,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:38,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2025-02-08 05:47:38,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:38,584 INFO L124 PetriNetUnfolderBase]: 236/850 cut-off events. [2025-02-08 05:47:38,584 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-08 05:47:38,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 850 events. 236/850 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4610 event pairs, 230 based on Foata normal form. 31/834 useless extension candidates. Maximal degree in co-relation 1332. Up to 391 conditions per place. [2025-02-08 05:47:38,591 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 17 selfloop transitions, 1 changer transitions 18/100 dead transitions. [2025-02-08 05:47:38,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 100 transitions, 268 flow [2025-02-08 05:47:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2025-02-08 05:47:38,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7949921752738655 [2025-02-08 05:47:38,593 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 238 flow. Second operand 3 states and 508 transitions. [2025-02-08 05:47:38,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 100 transitions, 268 flow [2025-02-08 05:47:38,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:47:38,596 INFO L231 Difference]: Finished difference. Result has 111 places, 82 transitions, 188 flow [2025-02-08 05:47:38,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2025-02-08 05:47:38,597 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -6 predicate places. [2025-02-08 05:47:38,597 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 188 flow [2025-02-08 05:47:38,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:47:38,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:38,597 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:47:38,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:47:38,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash -724127361, now seen corresponding path program 1 times [2025-02-08 05:47:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:38,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094091180] [2025-02-08 05:47:38,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:38,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:47:38,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:47:38,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:38,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:38,665 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:47:38,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:38,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094091180] [2025-02-08 05:47:38,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094091180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:38,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:38,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:47:38,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834968772] [2025-02-08 05:47:38,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:38,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:47:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:38,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:47:38,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:47:38,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 213 [2025-02-08 05:47:38,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 82 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 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:47:38,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:38,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 213 [2025-02-08 05:47:38,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:38,750 INFO L124 PetriNetUnfolderBase]: 34/251 cut-off events. [2025-02-08 05:47:38,750 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-08 05:47:38,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 251 events. 34/251 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 744 event pairs, 34 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 348. Up to 68 conditions per place. [2025-02-08 05:47:38,752 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 13 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-02-08 05:47:38,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 81 transitions, 218 flow [2025-02-08 05:47:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:47:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:47:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions. [2025-02-08 05:47:38,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509389671361502 [2025-02-08 05:47:38,754 INFO L175 Difference]: Start difference. First operand has 111 places, 82 transitions, 188 flow. Second operand 4 states and 725 transitions. [2025-02-08 05:47:38,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 81 transitions, 218 flow [2025-02-08 05:47:38,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 81 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:38,756 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 191 flow [2025-02-08 05:47:38,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2025-02-08 05:47:38,757 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -23 predicate places. [2025-02-08 05:47:38,757 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 191 flow [2025-02-08 05:47:38,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 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:47:38,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:38,758 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:47:38,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:47:38,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -25308441, now seen corresponding path program 1 times [2025-02-08 05:47:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:38,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822449881] [2025-02-08 05:47:38,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:38,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:38,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 05:47:38,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 05:47:38,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:38,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:38,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:38,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 05:47:38,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 05:47:38,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:38,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:38,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:38,805 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:38,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-02-08 05:47:38,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-02-08 05:47:38,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-02-08 05:47:38,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-02-08 05:47:38,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-02-08 05:47:38,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-02-08 05:47:38,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining) [2025-02-08 05:47:38,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-02-08 05:47:38,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-02-08 05:47:38,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-02-08 05:47:38,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-02-08 05:47:38,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-02-08 05:47:38,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:47:38,818 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:47:38,819 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:38,819 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-08 05:47:38,870 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:47:38,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 249 transitions, 578 flow [2025-02-08 05:47:38,911 INFO L124 PetriNetUnfolderBase]: 26/406 cut-off events. [2025-02-08 05:47:38,911 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 05:47:38,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 406 events. 26/406 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1058 event pairs, 0 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 438. Up to 12 conditions per place. [2025-02-08 05:47:38,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 249 transitions, 578 flow [2025-02-08 05:47:38,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 116 transitions, 275 flow [2025-02-08 05:47:38,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:38,918 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;@4ceb7c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:38,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 05:47:38,921 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:38,922 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 05:47:38,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:38,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:38,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:38,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:47:38,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash -725278967, now seen corresponding path program 1 times [2025-02-08 05:47:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:38,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530569539] [2025-02-08 05:47:38,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:38,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:38,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:47:38,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:47:38,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:38,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:38,944 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:47:38,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:38,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530569539] [2025-02-08 05:47:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530569539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:38,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059711091] [2025-02-08 05:47:38,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:38,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:38,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:38,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:39,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 249 [2025-02-08 05:47:39,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 116 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 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:47:39,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:39,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 249 [2025-02-08 05:47:39,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:39,341 INFO L124 PetriNetUnfolderBase]: 813/2126 cut-off events. [2025-02-08 05:47:39,342 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2025-02-08 05:47:39,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3612 conditions, 2126 events. 813/2126 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 13744 event pairs, 806 based on Foata normal form. 1/2038 useless extension candidates. Maximal degree in co-relation 1830. Up to 1191 conditions per place. [2025-02-08 05:47:39,365 INFO L140 encePairwiseOnDemand]: 244/249 looper letters, 21 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2025-02-08 05:47:39,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 113 transitions, 315 flow [2025-02-08 05:47:39,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2025-02-08 05:47:39,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8380187416331994 [2025-02-08 05:47:39,368 INFO L175 Difference]: Start difference. First operand has 126 places, 116 transitions, 275 flow. Second operand 3 states and 626 transitions. [2025-02-08 05:47:39,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 113 transitions, 315 flow [2025-02-08 05:47:39,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 113 transitions, 302 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:39,372 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 258 flow [2025-02-08 05:47:39,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2025-02-08 05:47:39,373 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2025-02-08 05:47:39,373 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 258 flow [2025-02-08 05:47:39,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 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:47:39,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:39,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:39,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:47:39,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:47:39,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1195653754, now seen corresponding path program 1 times [2025-02-08 05:47:39,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:39,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505572979] [2025-02-08 05:47:39,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:39,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:47:39,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:47:39,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:39,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:39,404 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:47:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505572979] [2025-02-08 05:47:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505572979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:39,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571500302] [2025-02-08 05:47:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:39,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:39,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:39,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 249 [2025-02-08 05:47:39,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 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:47:39,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:39,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 249 [2025-02-08 05:47:39,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:39,679 INFO L124 PetriNetUnfolderBase]: 621/1740 cut-off events. [2025-02-08 05:47:39,679 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-02-08 05:47:39,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 1740 events. 621/1740 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 10817 event pairs, 614 based on Foata normal form. 63/1735 useless extension candidates. Maximal degree in co-relation 2878. Up to 935 conditions per place. [2025-02-08 05:47:39,689 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 19 selfloop transitions, 1 changer transitions 18/107 dead transitions. [2025-02-08 05:47:39,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 107 transitions, 292 flow [2025-02-08 05:47:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2025-02-08 05:47:39,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7911646586345381 [2025-02-08 05:47:39,691 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 258 flow. Second operand 3 states and 591 transitions. [2025-02-08 05:47:39,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 107 transitions, 292 flow [2025-02-08 05:47:39,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 107 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:47:39,693 INFO L231 Difference]: Finished difference. Result has 120 places, 89 transitions, 208 flow [2025-02-08 05:47:39,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=120, PETRI_TRANSITIONS=89} [2025-02-08 05:47:39,694 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -6 predicate places. [2025-02-08 05:47:39,695 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 89 transitions, 208 flow [2025-02-08 05:47:39,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 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:47:39,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:39,695 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:39,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:47:39,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:47:39,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1523832389, now seen corresponding path program 1 times [2025-02-08 05:47:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348583447] [2025-02-08 05:47:39,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:39,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:47:39,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:47:39,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:39,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:39,785 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:47:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348583447] [2025-02-08 05:47:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348583447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:39,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:39,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:47:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667588503] [2025-02-08 05:47:39,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:39,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:47:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:39,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:47:39,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:47:39,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 249 [2025-02-08 05:47:39,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 89 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:47:39,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:39,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 249 [2025-02-08 05:47:39,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:39,875 INFO L124 PetriNetUnfolderBase]: 98/431 cut-off events. [2025-02-08 05:47:39,875 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-02-08 05:47:39,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 431 events. 98/431 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1763 event pairs, 98 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 672. Up to 164 conditions per place. [2025-02-08 05:47:39,878 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 15 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2025-02-08 05:47:39,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 242 flow [2025-02-08 05:47:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:47:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:47:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 847 transitions. [2025-02-08 05:47:39,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8504016064257028 [2025-02-08 05:47:39,881 INFO L175 Difference]: Start difference. First operand has 120 places, 89 transitions, 208 flow. Second operand 4 states and 847 transitions. [2025-02-08 05:47:39,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 88 transitions, 242 flow [2025-02-08 05:47:39,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 88 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:39,883 INFO L231 Difference]: Finished difference. Result has 103 places, 88 transitions, 211 flow [2025-02-08 05:47:39,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=103, PETRI_TRANSITIONS=88} [2025-02-08 05:47:39,883 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -23 predicate places. [2025-02-08 05:47:39,883 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 211 flow [2025-02-08 05:47:39,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:47:39,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:39,885 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:39,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:47:39,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:47:39,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:39,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1175044602, now seen corresponding path program 1 times [2025-02-08 05:47:39,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:39,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65943504] [2025-02-08 05:47:39,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:39,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:39,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:47:39,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:47:39,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:39,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:39,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:39,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:47:39,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:47:39,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:39,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:39,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:39,933 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:39,933 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 05:47:39,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-02-08 05:47:39,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-02-08 05:47:39,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-02-08 05:47:39,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-02-08 05:47:39,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-02-08 05:47:39,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2025-02-08 05:47:39,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-02-08 05:47:39,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-02-08 05:47:39,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-02-08 05:47:39,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-02-08 05:47:39,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-02-08 05:47:39,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-02-08 05:47:39,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:47:39,936 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:47:39,936 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:39,936 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-02-08 05:47:39,981 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:47:39,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 285 transitions, 678 flow [2025-02-08 05:47:40,015 INFO L124 PetriNetUnfolderBase]: 30/469 cut-off events. [2025-02-08 05:47:40,015 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-08 05:47:40,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 469 events. 30/469 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1224 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 510. Up to 14 conditions per place. [2025-02-08 05:47:40,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 285 transitions, 678 flow [2025-02-08 05:47:40,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 123 transitions, 303 flow [2025-02-08 05:47:40,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:40,019 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;@4ceb7c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:40,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-08 05:47:40,020 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:40,020 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 05:47:40,020 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:40,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:40,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:40,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:47:40,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1435922327, now seen corresponding path program 1 times [2025-02-08 05:47:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:40,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995540083] [2025-02-08 05:47:40,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:40,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:47:40,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:47:40,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:40,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:40,038 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:47:40,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:40,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995540083] [2025-02-08 05:47:40,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995540083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:40,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:40,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:40,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498612420] [2025-02-08 05:47:40,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:40,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:40,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:40,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:40,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:40,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 285 [2025-02-08 05:47:40,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 123 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 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:47:40,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:40,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 285 [2025-02-08 05:47:40,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:40,592 INFO L124 PetriNetUnfolderBase]: 1998/4488 cut-off events. [2025-02-08 05:47:40,592 INFO L125 PetriNetUnfolderBase]: For 1165/1165 co-relation queries the response was YES. [2025-02-08 05:47:40,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7895 conditions, 4488 events. 1998/4488 cut-off events. For 1165/1165 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 31838 event pairs, 1990 based on Foata normal form. 1/4372 useless extension candidates. Maximal degree in co-relation 4009. Up to 2759 conditions per place. [2025-02-08 05:47:40,644 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 23 selfloop transitions, 2 changer transitions 1/120 dead transitions. [2025-02-08 05:47:40,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 120 transitions, 347 flow [2025-02-08 05:47:40,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-02-08 05:47:40,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8362573099415205 [2025-02-08 05:47:40,646 INFO L175 Difference]: Start difference. First operand has 135 places, 123 transitions, 303 flow. Second operand 3 states and 715 transitions. [2025-02-08 05:47:40,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 120 transitions, 347 flow [2025-02-08 05:47:40,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 120 transitions, 326 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:40,650 INFO L231 Difference]: Finished difference. Result has 135 places, 119 transitions, 278 flow [2025-02-08 05:47:40,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=135, PETRI_TRANSITIONS=119} [2025-02-08 05:47:40,651 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 0 predicate places. [2025-02-08 05:47:40,651 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 119 transitions, 278 flow [2025-02-08 05:47:40,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 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:47:40,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:40,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:40,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:47:40,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:47:40,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:40,652 INFO L85 PathProgramCache]: Analyzing trace with hash 313400983, now seen corresponding path program 1 times [2025-02-08 05:47:40,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:40,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642744578] [2025-02-08 05:47:40,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:40,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:40,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:47:40,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:47:40,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:40,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:40,674 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:47:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:40,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642744578] [2025-02-08 05:47:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642744578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:40,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:40,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136971631] [2025-02-08 05:47:40,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:40,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:40,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:40,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:40,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:40,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 285 [2025-02-08 05:47:40,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 119 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 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:47:40,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:40,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 285 [2025-02-08 05:47:40,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:41,077 INFO L124 PetriNetUnfolderBase]: 1550/3654 cut-off events. [2025-02-08 05:47:41,077 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-02-08 05:47:41,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6291 conditions, 3654 events. 1550/3654 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 25058 event pairs, 1542 based on Foata normal form. 127/3688 useless extension candidates. Maximal degree in co-relation 6264. Up to 2183 conditions per place. [2025-02-08 05:47:41,111 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 21 selfloop transitions, 1 changer transitions 18/114 dead transitions. [2025-02-08 05:47:41,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 114 transitions, 316 flow [2025-02-08 05:47:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2025-02-08 05:47:41,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7883040935672515 [2025-02-08 05:47:41,113 INFO L175 Difference]: Start difference. First operand has 135 places, 119 transitions, 278 flow. Second operand 3 states and 674 transitions. [2025-02-08 05:47:41,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 114 transitions, 316 flow [2025-02-08 05:47:41,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 114 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:47:41,117 INFO L231 Difference]: Finished difference. Result has 129 places, 96 transitions, 228 flow [2025-02-08 05:47:41,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=129, PETRI_TRANSITIONS=96} [2025-02-08 05:47:41,117 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, -6 predicate places. [2025-02-08 05:47:41,118 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 96 transitions, 228 flow [2025-02-08 05:47:41,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 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:47:41,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:41,119 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:41,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:47:41,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:47:41,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1441006672, now seen corresponding path program 1 times [2025-02-08 05:47:41,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:41,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157052693] [2025-02-08 05:47:41,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:41,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:41,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:47:41,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:47:41,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:41,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:41,196 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:47:41,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:41,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157052693] [2025-02-08 05:47:41,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157052693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:41,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:41,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:47:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721980173] [2025-02-08 05:47:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:41,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:47:41,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:41,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:47:41,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:47:41,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 285 [2025-02-08 05:47:41,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 96 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 240.25) internal successors, (961), 4 states have internal predecessors, (961), 0 states have call successors, (0), 0 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:47:41,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:41,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 285 [2025-02-08 05:47:41,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:41,370 INFO L124 PetriNetUnfolderBase]: 258/803 cut-off events. [2025-02-08 05:47:41,370 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-02-08 05:47:41,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 803 events. 258/803 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4055 event pairs, 258 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 1364. Up to 388 conditions per place. [2025-02-08 05:47:41,378 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 17 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-02-08 05:47:41,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 95 transitions, 266 flow [2025-02-08 05:47:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:47:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:47:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 969 transitions. [2025-02-08 05:47:41,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-02-08 05:47:41,382 INFO L175 Difference]: Start difference. First operand has 129 places, 96 transitions, 228 flow. Second operand 4 states and 969 transitions. [2025-02-08 05:47:41,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 95 transitions, 266 flow [2025-02-08 05:47:41,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 95 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:41,384 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 231 flow [2025-02-08 05:47:41,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2025-02-08 05:47:41,384 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, -23 predicate places. [2025-02-08 05:47:41,384 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 231 flow [2025-02-08 05:47:41,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 240.25) internal successors, (961), 4 states have internal predecessors, (961), 0 states have call successors, (0), 0 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:47:41,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:41,385 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:41,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:47:41,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:47:41,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1442125426, now seen corresponding path program 1 times [2025-02-08 05:47:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671231333] [2025-02-08 05:47:41,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:41,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 05:47:41,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 05:47:41,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:41,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:41,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:41,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 05:47:41,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 05:47:41,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:41,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:41,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:41,426 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:41,426 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-02-08 05:47:41,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-02-08 05:47:41,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-02-08 05:47:41,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-02-08 05:47:41,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-02-08 05:47:41,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-02-08 05:47:41,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2025-02-08 05:47:41,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-02-08 05:47:41,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-02-08 05:47:41,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-02-08 05:47:41,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-02-08 05:47:41,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-02-08 05:47:41,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-02-08 05:47:41,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-02-08 05:47:41,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:47:41,427 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:47:41,428 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:41,428 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-02-08 05:47:41,485 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:47:41,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 321 transitions, 782 flow [2025-02-08 05:47:41,528 INFO L124 PetriNetUnfolderBase]: 34/532 cut-off events. [2025-02-08 05:47:41,528 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-08 05:47:41,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 532 events. 34/532 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1449 event pairs, 0 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 583. Up to 16 conditions per place. [2025-02-08 05:47:41,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 321 transitions, 782 flow [2025-02-08 05:47:41,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 130 transitions, 333 flow [2025-02-08 05:47:41,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:41,534 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;@4ceb7c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:41,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 05:47:41,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:41,535 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 05:47:41,535 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:41,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:41,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:41,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:47:41,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:41,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1380483401, now seen corresponding path program 1 times [2025-02-08 05:47:41,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:41,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629430360] [2025-02-08 05:47:41,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:41,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:41,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:47:41,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:47:41,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:41,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:41,556 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:47:41,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629430360] [2025-02-08 05:47:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629430360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:41,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184587753] [2025-02-08 05:47:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:41,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:41,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:41,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:41,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 321 [2025-02-08 05:47:41,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 130 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 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:47:41,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:41,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 321 [2025-02-08 05:47:41,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:42,691 INFO L124 PetriNetUnfolderBase]: 4751/9570 cut-off events. [2025-02-08 05:47:42,692 INFO L125 PetriNetUnfolderBase]: For 3091/3091 co-relation queries the response was YES. [2025-02-08 05:47:42,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17266 conditions, 9570 events. 4751/9570 cut-off events. For 3091/3091 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 72588 event pairs, 4742 based on Foata normal form. 1/9422 useless extension candidates. Maximal degree in co-relation 8748. Up to 6279 conditions per place. [2025-02-08 05:47:42,863 INFO L140 encePairwiseOnDemand]: 316/321 looper letters, 25 selfloop transitions, 2 changer transitions 1/127 dead transitions. [2025-02-08 05:47:42,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 127 transitions, 381 flow [2025-02-08 05:47:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2025-02-08 05:47:42,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8348909657320872 [2025-02-08 05:47:42,866 INFO L175 Difference]: Start difference. First operand has 144 places, 130 transitions, 333 flow. Second operand 3 states and 804 transitions. [2025-02-08 05:47:42,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 127 transitions, 381 flow [2025-02-08 05:47:42,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 127 transitions, 350 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:42,870 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 298 flow [2025-02-08 05:47:42,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2025-02-08 05:47:42,870 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2025-02-08 05:47:42,870 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 298 flow [2025-02-08 05:47:42,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 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:47:42,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:42,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:42,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:47:42,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:47:42,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:42,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1670635224, now seen corresponding path program 1 times [2025-02-08 05:47:42,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:42,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994118976] [2025-02-08 05:47:42,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:42,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:42,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:47:42,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:47:42,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:42,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:42,886 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:47:42,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:42,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994118976] [2025-02-08 05:47:42,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994118976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:42,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:42,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:42,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145043203] [2025-02-08 05:47:42,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:42,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:42,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:42,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:42,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:42,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 321 [2025-02-08 05:47:42,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:47:42,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:42,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 321 [2025-02-08 05:47:42,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:43,956 INFO L124 PetriNetUnfolderBase]: 3727/7776 cut-off events. [2025-02-08 05:47:43,956 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-02-08 05:47:43,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13678 conditions, 7776 events. 3727/7776 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 57140 event pairs, 3718 based on Foata normal form. 255/7909 useless extension candidates. Maximal degree in co-relation 13650. Up to 4999 conditions per place. [2025-02-08 05:47:44,002 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 23 selfloop transitions, 1 changer transitions 18/121 dead transitions. [2025-02-08 05:47:44,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 121 transitions, 340 flow [2025-02-08 05:47:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2025-02-08 05:47:44,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7860851505711319 [2025-02-08 05:47:44,005 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 298 flow. Second operand 3 states and 757 transitions. [2025-02-08 05:47:44,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 121 transitions, 340 flow [2025-02-08 05:47:44,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 121 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:47:44,008 INFO L231 Difference]: Finished difference. Result has 138 places, 103 transitions, 248 flow [2025-02-08 05:47:44,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=138, PETRI_TRANSITIONS=103} [2025-02-08 05:47:44,009 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -6 predicate places. [2025-02-08 05:47:44,009 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 103 transitions, 248 flow [2025-02-08 05:47:44,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:47:44,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:44,009 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:44,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:47:44,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:47:44,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1313476128, now seen corresponding path program 1 times [2025-02-08 05:47:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:44,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949390769] [2025-02-08 05:47:44,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:44,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:44,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 05:47:44,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 05:47:44,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:44,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:44,100 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:47:44,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:44,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949390769] [2025-02-08 05:47:44,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949390769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:44,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:44,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:47:44,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016812035] [2025-02-08 05:47:44,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:44,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:47:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:44,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:47:44,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:47:44,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 321 [2025-02-08 05:47:44,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 103 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 0 states have call successors, (0), 0 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:47:44,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:44,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 321 [2025-02-08 05:47:44,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:44,384 INFO L124 PetriNetUnfolderBase]: 642/1591 cut-off events. [2025-02-08 05:47:44,385 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2025-02-08 05:47:44,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2886 conditions, 1591 events. 642/1591 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9348 event pairs, 642 based on Foata normal form. 0/1492 useless extension candidates. Maximal degree in co-relation 2856. Up to 900 conditions per place. [2025-02-08 05:47:44,402 INFO L140 encePairwiseOnDemand]: 317/321 looper letters, 19 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-02-08 05:47:44,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 102 transitions, 290 flow [2025-02-08 05:47:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:47:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:47:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1091 transitions. [2025-02-08 05:47:44,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8496884735202492 [2025-02-08 05:47:44,405 INFO L175 Difference]: Start difference. First operand has 138 places, 103 transitions, 248 flow. Second operand 4 states and 1091 transitions. [2025-02-08 05:47:44,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 102 transitions, 290 flow [2025-02-08 05:47:44,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 102 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:44,408 INFO L231 Difference]: Finished difference. Result has 121 places, 102 transitions, 251 flow [2025-02-08 05:47:44,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=121, PETRI_TRANSITIONS=102} [2025-02-08 05:47:44,408 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -23 predicate places. [2025-02-08 05:47:44,409 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 102 transitions, 251 flow [2025-02-08 05:47:44,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 0 states have call successors, (0), 0 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:47:44,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:44,409 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:44,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:47:44,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:47:44,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1309863615, now seen corresponding path program 1 times [2025-02-08 05:47:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:44,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953945365] [2025-02-08 05:47:44,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:44,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 05:47:44,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 05:47:44,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:44,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:44,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:44,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 05:47:44,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 05:47:44,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:44,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:44,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:44,475 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-02-08 05:47:44,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-02-08 05:47:44,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-02-08 05:47:44,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:47:44,476 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:47:44,476 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:44,476 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-02-08 05:47:44,543 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:47:44,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 364 places, 357 transitions, 890 flow [2025-02-08 05:47:44,608 INFO L124 PetriNetUnfolderBase]: 38/595 cut-off events. [2025-02-08 05:47:44,608 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-02-08 05:47:44,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 595 events. 38/595 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1596 event pairs, 0 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 657. Up to 18 conditions per place. [2025-02-08 05:47:44,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 357 transitions, 890 flow [2025-02-08 05:47:44,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 137 transitions, 365 flow [2025-02-08 05:47:44,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:44,613 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;@4ceb7c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:44,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 05:47:44,614 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:44,614 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-08 05:47:44,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:44,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:44,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:44,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:47:44,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash -865996375, now seen corresponding path program 1 times [2025-02-08 05:47:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636923051] [2025-02-08 05:47:44,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:44,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:47:44,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:47:44,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:44,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:44,632 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:47:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:44,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636923051] [2025-02-08 05:47:44,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636923051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:44,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:44,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012964194] [2025-02-08 05:47:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:44,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:44,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:44,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:44,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 357 [2025-02-08 05:47:44,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 137 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 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:47:44,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:44,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 357 [2025-02-08 05:47:44,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:47,048 INFO L124 PetriNetUnfolderBase]: 11024/20476 cut-off events. [2025-02-08 05:47:47,048 INFO L125 PetriNetUnfolderBase]: For 7962/7962 co-relation queries the response was YES. [2025-02-08 05:47:47,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37645 conditions, 20476 events. 11024/20476 cut-off events. For 7962/7962 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 164340 event pairs, 11014 based on Foata normal form. 1/20292 useless extension candidates. Maximal degree in co-relation 18991. Up to 14087 conditions per place. [2025-02-08 05:47:47,258 INFO L140 encePairwiseOnDemand]: 352/357 looper letters, 27 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-02-08 05:47:47,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 134 transitions, 417 flow [2025-02-08 05:47:47,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-02-08 05:47:47,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8338001867413632 [2025-02-08 05:47:47,261 INFO L175 Difference]: Start difference. First operand has 153 places, 137 transitions, 365 flow. Second operand 3 states and 893 transitions. [2025-02-08 05:47:47,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 134 transitions, 417 flow [2025-02-08 05:47:47,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 134 transitions, 374 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:47,267 INFO L231 Difference]: Finished difference. Result has 153 places, 133 transitions, 318 flow [2025-02-08 05:47:47,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=153, PETRI_TRANSITIONS=133} [2025-02-08 05:47:47,269 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 0 predicate places. [2025-02-08 05:47:47,269 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 133 transitions, 318 flow [2025-02-08 05:47:47,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 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:47:47,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:47,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:47,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:47:47,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:47:47,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash 972389181, now seen corresponding path program 1 times [2025-02-08 05:47:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:47,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116048678] [2025-02-08 05:47:47,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:47,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:47,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:47:47,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:47:47,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:47,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:47,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:47,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116048678] [2025-02-08 05:47:47,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116048678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:47,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:47,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:47,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049710028] [2025-02-08 05:47:47,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:47,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:47,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:47,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:47,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:47,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 357 [2025-02-08 05:47:47,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 133 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 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:47:47,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:47,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 357 [2025-02-08 05:47:47,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:49,153 INFO L124 PetriNetUnfolderBase]: 8720/16634 cut-off events. [2025-02-08 05:47:49,153 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2025-02-08 05:47:49,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29705 conditions, 16634 events. 8720/16634 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 129966 event pairs, 8710 based on Foata normal form. 511/16990 useless extension candidates. Maximal degree in co-relation 29676. Up to 11271 conditions per place. [2025-02-08 05:47:49,244 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 25 selfloop transitions, 1 changer transitions 18/128 dead transitions. [2025-02-08 05:47:49,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 128 transitions, 364 flow [2025-02-08 05:47:49,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2025-02-08 05:47:49,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-02-08 05:47:49,246 INFO L175 Difference]: Start difference. First operand has 153 places, 133 transitions, 318 flow. Second operand 3 states and 840 transitions. [2025-02-08 05:47:49,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 128 transitions, 364 flow [2025-02-08 05:47:49,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 128 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:47:49,249 INFO L231 Difference]: Finished difference. Result has 147 places, 110 transitions, 268 flow [2025-02-08 05:47:49,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=147, PETRI_TRANSITIONS=110} [2025-02-08 05:47:49,250 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -6 predicate places. [2025-02-08 05:47:49,250 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 110 transitions, 268 flow [2025-02-08 05:47:49,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 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:47:49,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:49,251 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:49,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:47:49,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:47:49,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash -510188235, now seen corresponding path program 1 times [2025-02-08 05:47:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:49,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429142277] [2025-02-08 05:47:49,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:49,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:47:49,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:47:49,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:49,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:49,331 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:47:49,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:49,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429142277] [2025-02-08 05:47:49,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429142277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:49,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:49,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:47:49,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828521738] [2025-02-08 05:47:49,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:49,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:47:49,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:49,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:47:49,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:47:49,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 357 [2025-02-08 05:47:49,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 110 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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:47:49,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:49,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 357 [2025-02-08 05:47:49,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:49,653 INFO L124 PetriNetUnfolderBase]: 1538/3275 cut-off events. [2025-02-08 05:47:49,654 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2025-02-08 05:47:49,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6107 conditions, 3275 events. 1538/3275 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 21565 event pairs, 1538 based on Foata normal form. 0/3112 useless extension candidates. Maximal degree in co-relation 6076. Up to 2052 conditions per place. [2025-02-08 05:47:49,686 INFO L140 encePairwiseOnDemand]: 353/357 looper letters, 21 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-02-08 05:47:49,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 109 transitions, 314 flow [2025-02-08 05:47:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:47:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:47:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1213 transitions. [2025-02-08 05:47:49,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8494397759103641 [2025-02-08 05:47:49,688 INFO L175 Difference]: Start difference. First operand has 147 places, 110 transitions, 268 flow. Second operand 4 states and 1213 transitions. [2025-02-08 05:47:49,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 109 transitions, 314 flow [2025-02-08 05:47:49,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 109 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:49,690 INFO L231 Difference]: Finished difference. Result has 130 places, 109 transitions, 271 flow [2025-02-08 05:47:49,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=130, PETRI_TRANSITIONS=109} [2025-02-08 05:47:49,691 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -23 predicate places. [2025-02-08 05:47:49,691 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 109 transitions, 271 flow [2025-02-08 05:47:49,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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:47:49,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:49,692 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:49,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:47:49,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:47:49,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1655289561, now seen corresponding path program 1 times [2025-02-08 05:47:49,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:49,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193863809] [2025-02-08 05:47:49,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:49,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:47:49,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:47:49,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:49,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:49,715 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:49,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:47:49,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:47:49,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:49,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:49,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:49,744 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:49,744 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 05:47:49,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-02-08 05:47:49,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-08 05:47:49,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-08 05:47:49,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-08 05:47:49,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-08 05:47:49,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:47:49,745 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:47:49,746 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:49,746 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-02-08 05:47:49,809 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:47:49,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 393 transitions, 1002 flow [2025-02-08 05:47:49,869 INFO L124 PetriNetUnfolderBase]: 42/658 cut-off events. [2025-02-08 05:47:49,869 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-02-08 05:47:49,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 658 events. 42/658 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1789 event pairs, 0 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 732. Up to 20 conditions per place. [2025-02-08 05:47:49,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 393 transitions, 1002 flow [2025-02-08 05:47:49,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 144 transitions, 399 flow [2025-02-08 05:47:49,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:49,874 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;@4ceb7c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:49,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 05:47:49,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:49,875 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 05:47:49,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:49,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:49,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:49,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:47:49,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash 414572937, now seen corresponding path program 1 times [2025-02-08 05:47:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:49,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163665857] [2025-02-08 05:47:49,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:49,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:47:49,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:47:49,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:49,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:49,891 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:47:49,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:49,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163665857] [2025-02-08 05:47:49,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163665857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:49,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:49,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:49,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053660430] [2025-02-08 05:47:49,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:49,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:49,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:49,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:49,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 393 [2025-02-08 05:47:49,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 144 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:47:49,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:49,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 393 [2025-02-08 05:47:49,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:54,953 INFO L124 PetriNetUnfolderBase]: 25105/43798 cut-off events. [2025-02-08 05:47:54,953 INFO L125 PetriNetUnfolderBase]: For 20002/20002 co-relation queries the response was YES. [2025-02-08 05:47:55,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81704 conditions, 43798 events. 25105/43798 cut-off events. For 20002/20002 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 366579 event pairs, 25094 based on Foata normal form. 1/43574 useless extension candidates. Maximal degree in co-relation 41010. Up to 31239 conditions per place. [2025-02-08 05:47:55,298 INFO L140 encePairwiseOnDemand]: 388/393 looper letters, 29 selfloop transitions, 2 changer transitions 1/141 dead transitions. [2025-02-08 05:47:55,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 141 transitions, 455 flow [2025-02-08 05:47:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2025-02-08 05:47:55,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8329092451229856 [2025-02-08 05:47:55,299 INFO L175 Difference]: Start difference. First operand has 162 places, 144 transitions, 399 flow. Second operand 3 states and 982 transitions. [2025-02-08 05:47:55,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 141 transitions, 455 flow [2025-02-08 05:47:55,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 141 transitions, 398 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:55,305 INFO L231 Difference]: Finished difference. Result has 162 places, 140 transitions, 338 flow [2025-02-08 05:47:55,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=162, PETRI_TRANSITIONS=140} [2025-02-08 05:47:55,305 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 0 predicate places. [2025-02-08 05:47:55,305 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 140 transitions, 338 flow [2025-02-08 05:47:55,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:47:55,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:55,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:55,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:47:55,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:47:55,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1781337146, now seen corresponding path program 1 times [2025-02-08 05:47:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:55,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308782333] [2025-02-08 05:47:55,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:55,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:55,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:47:55,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:47:55,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:55,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:55,320 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:47:55,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:55,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308782333] [2025-02-08 05:47:55,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308782333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:55,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:55,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:55,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009517435] [2025-02-08 05:47:55,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:55,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:55,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:55,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:55,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 393 [2025-02-08 05:47:55,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 140 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 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:47:55,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:55,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 393 [2025-02-08 05:47:55,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:59,062 INFO L124 PetriNetUnfolderBase]: 19985/35604 cut-off events. [2025-02-08 05:47:59,062 INFO L125 PetriNetUnfolderBase]: For 1568/1568 co-relation queries the response was YES. [2025-02-08 05:47:59,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64292 conditions, 35604 events. 19985/35604 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 290540 event pairs, 19974 based on Foata normal form. 1023/36435 useless extension candidates. Maximal degree in co-relation 64262. Up to 25095 conditions per place. [2025-02-08 05:47:59,255 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 27 selfloop transitions, 1 changer transitions 18/135 dead transitions. [2025-02-08 05:47:59,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 135 transitions, 388 flow [2025-02-08 05:47:59,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-02-08 05:47:59,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7828668363019508 [2025-02-08 05:47:59,257 INFO L175 Difference]: Start difference. First operand has 162 places, 140 transitions, 338 flow. Second operand 3 states and 923 transitions. [2025-02-08 05:47:59,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 135 transitions, 388 flow [2025-02-08 05:47:59,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 135 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:47:59,259 INFO L231 Difference]: Finished difference. Result has 156 places, 117 transitions, 288 flow [2025-02-08 05:47:59,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=156, PETRI_TRANSITIONS=117} [2025-02-08 05:47:59,260 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -6 predicate places. [2025-02-08 05:47:59,260 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 117 transitions, 288 flow [2025-02-08 05:47:59,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 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:47:59,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:59,261 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:59,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:47:59,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:47:59,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash -772803441, now seen corresponding path program 1 times [2025-02-08 05:47:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990132376] [2025-02-08 05:47:59,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:59,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:47:59,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:47:59,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:59,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:59,327 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:47:59,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:59,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990132376] [2025-02-08 05:47:59,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990132376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:59,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:59,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:47:59,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955222130] [2025-02-08 05:47:59,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:59,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:47:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:59,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:47:59,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:47:59,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 393 [2025-02-08 05:47:59,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 117 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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:47:59,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:59,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 393 [2025-02-08 05:47:59,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:48:00,507 INFO L124 PetriNetUnfolderBase]: 3586/6879 cut-off events. [2025-02-08 05:48:00,507 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2025-02-08 05:48:00,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13040 conditions, 6879 events. 3586/6879 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 49336 event pairs, 3586 based on Foata normal form. 0/6623 useless extension candidates. Maximal degree in co-relation 13008. Up to 4612 conditions per place. [2025-02-08 05:48:00,603 INFO L140 encePairwiseOnDemand]: 389/393 looper letters, 23 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-02-08 05:48:00,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 116 transitions, 338 flow [2025-02-08 05:48:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:48:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:48:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1335 transitions. [2025-02-08 05:48:00,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8492366412213741 [2025-02-08 05:48:00,606 INFO L175 Difference]: Start difference. First operand has 156 places, 117 transitions, 288 flow. Second operand 4 states and 1335 transitions. [2025-02-08 05:48:00,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 116 transitions, 338 flow [2025-02-08 05:48:00,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 116 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:48:00,610 INFO L231 Difference]: Finished difference. Result has 139 places, 116 transitions, 291 flow [2025-02-08 05:48:00,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=139, PETRI_TRANSITIONS=116} [2025-02-08 05:48:00,610 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -23 predicate places. [2025-02-08 05:48:00,611 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 116 transitions, 291 flow [2025-02-08 05:48:00,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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:48:00,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:48:00,611 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:00,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 05:48:00,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:48:00,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash -993330404, now seen corresponding path program 1 times [2025-02-08 05:48:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491960982] [2025-02-08 05:48:00,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:00,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 05:48:00,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 05:48:00,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:00,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:48:00,645 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:48:00,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 05:48:00,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 05:48:00,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:00,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:48:00,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:48:00,679 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:48:00,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-08 05:48:00,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-02-08 05:48:00,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-02-08 05:48:00,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-02-08 05:48:00,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 05:48:00,680 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:48:00,681 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:48:00,681 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-02-08 05:48:00,760 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:48:00,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 438 places, 429 transitions, 1118 flow [2025-02-08 05:48:00,836 INFO L124 PetriNetUnfolderBase]: 46/721 cut-off events. [2025-02-08 05:48:00,836 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-02-08 05:48:00,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 721 events. 46/721 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1981 event pairs, 0 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 808. Up to 22 conditions per place. [2025-02-08 05:48:00,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 438 places, 429 transitions, 1118 flow [2025-02-08 05:48:00,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 151 transitions, 435 flow [2025-02-08 05:48:00,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:48:00,841 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;@4ceb7c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:48:00,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 05:48:00,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:48:00,842 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-02-08 05:48:00,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:48:00,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:48:00,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:00,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:48:00,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:00,843 INFO L85 PathProgramCache]: Analyzing trace with hash 927224041, now seen corresponding path program 1 times [2025-02-08 05:48:00,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:00,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440606458] [2025-02-08 05:48:00,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:00,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:00,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:48:00,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:48:00,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:00,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:00,860 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:48:00,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:00,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440606458] [2025-02-08 05:48:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440606458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:00,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:48:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137636611] [2025-02-08 05:48:00,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:00,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:48:00,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:00,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:48:00,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:48:00,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 429 [2025-02-08 05:48:00,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 151 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 0 states have call successors, (0), 0 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:48:00,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:48:00,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 429 [2025-02-08 05:48:00,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:48:12,175 INFO L124 PetriNetUnfolderBase]: 56338/93488 cut-off events. [2025-02-08 05:48:12,175 INFO L125 PetriNetUnfolderBase]: For 49195/49195 co-relation queries the response was YES. [2025-02-08 05:48:12,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176451 conditions, 93488 events. 56338/93488 cut-off events. For 49195/49195 co-relation queries the response was YES. Maximal size of possible extension queue 2442. Compared 811518 event pairs, 56326 based on Foata normal form. 1/93220 useless extension candidates. Maximal degree in co-relation 88117. Up to 68615 conditions per place. [2025-02-08 05:48:13,142 INFO L140 encePairwiseOnDemand]: 424/429 looper letters, 31 selfloop transitions, 2 changer transitions 1/148 dead transitions. [2025-02-08 05:48:13,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 148 transitions, 495 flow [2025-02-08 05:48:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:48:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:48:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2025-02-08 05:48:13,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8321678321678322 [2025-02-08 05:48:13,144 INFO L175 Difference]: Start difference. First operand has 171 places, 151 transitions, 435 flow. Second operand 3 states and 1071 transitions. [2025-02-08 05:48:13,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 148 transitions, 495 flow [2025-02-08 05:48:13,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 148 transitions, 422 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-02-08 05:48:13,157 INFO L231 Difference]: Finished difference. Result has 171 places, 147 transitions, 358 flow [2025-02-08 05:48:13,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=171, PETRI_TRANSITIONS=147} [2025-02-08 05:48:13,158 INFO L279 CegarLoopForPetriNet]: 171 programPoint places, 0 predicate places. [2025-02-08 05:48:13,158 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 147 transitions, 358 flow [2025-02-08 05:48:13,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 0 states have call successors, (0), 0 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:48:13,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:48:13,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:13,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 05:48:13,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:48:13,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1999390835, now seen corresponding path program 1 times [2025-02-08 05:48:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:13,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750199931] [2025-02-08 05:48:13,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:13,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:13,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:48:13,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:48:13,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:13,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:48:13,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:13,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750199931] [2025-02-08 05:48:13,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750199931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:13,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:13,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:48:13,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013207623] [2025-02-08 05:48:13,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:13,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:48:13,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:13,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:48:13,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:48:13,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 429 [2025-02-08 05:48:13,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 147 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 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:48:13,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:48:13,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 429 [2025-02-08 05:48:13,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand