/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All -i ../../../trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:14:10,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:14:10,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 22:14:10,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:14:10,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:14:10,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:14:10,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:14:10,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:14:10,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:14:10,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:14:10,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:14:10,406 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:14:10,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:14:10,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:14:10,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:14:10,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:14:10,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:14:10,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:14:10,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:14:10,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:14:10,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 22:14:10,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:14:10,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:14:10,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:14:10,676 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:14:10,676 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:14:10,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c [2025-03-14 22:14:11,854 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6fcddda4/dcb705bdd03f433587659ce76facaf54/FLAG276a81d6b [2025-03-14 22:14:12,014 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:14:12,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c [2025-03-14 22:14:12,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6fcddda4/dcb705bdd03f433587659ce76facaf54/FLAG276a81d6b [2025-03-14 22:14:12,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6fcddda4/dcb705bdd03f433587659ce76facaf54 [2025-03-14 22:14:12,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:14:12,043 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:14:12,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:14:12,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:14:12,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:14:12,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bebce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12, skipping insertion in model container [2025-03-14 22:14:12,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:14:12,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c[4875,4888] [2025-03-14 22:14:12,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:14:12,223 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:14:12,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c[4875,4888] [2025-03-14 22:14:12,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:14:12,258 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:14:12,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12 WrapperNode [2025-03-14 22:14:12,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:14:12,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:14:12,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:14:12,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:14:12,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,293 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 298 [2025-03-14 22:14:12,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:14:12,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:14:12,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:14:12,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:14:12,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:14:12,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:14:12,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:14:12,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:14:12,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (1/1) ... [2025-03-14 22:14:12,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:14:12,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:14:12,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 22:14:12,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 22:14:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:14:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:14:12,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:14:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:14:12,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:14:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 22:14:12,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 22:14:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:14:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 22:14:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 22:14:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:14:12,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:14:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 22:14:12,368 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 22:14:12,440 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:14:12,442 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:14:12,757 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:14:12,757 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:14:12,766 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:14:12,767 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-14 22:14:12,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:14:12 BoogieIcfgContainer [2025-03-14 22:14:12,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:14:12,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:14:12,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:14:12,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:14:12,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:14:12" (1/3) ... [2025-03-14 22:14:12,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738b0f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:14:12, skipping insertion in model container [2025-03-14 22:14:12,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:12" (2/3) ... [2025-03-14 22:14:12,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738b0f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:14:12, skipping insertion in model container [2025-03-14 22:14:12,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:14:12" (3/3) ... [2025-03-14 22:14:12,773 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2025-03-14 22:14:12,783 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:14:12,784 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-subst.wvr.c that has 4 procedures, 360 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 22:14:12,784 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:14:12,882 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 22:14:12,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:14:12,936 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=All, 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;@7cda4424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:14:12,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 22:14:13,067 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:14:13,068 INFO L124 PetriNetUnfolderBase]: 25/375 cut-off events. [2025-03-14 22:14:13,069 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 22:14:13,070 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:13,070 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:13,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:13,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1624024883, now seen corresponding path program 1 times [2025-03-14 22:14:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:13,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928668760] [2025-03-14 22:14:13,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:14:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928668760] [2025-03-14 22:14:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928668760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:13,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:13,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 22:14:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242182987] [2025-03-14 22:14:13,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:13,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 22:14:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:13,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 22:14:13,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 22:14:13,343 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 384 [2025-03-14 22:14:13,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 384 transitions, 789 flow. Second operand has 2 states, 2 states have (on average 363.5) internal successors, (727), 2 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:13,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:13,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 384 [2025-03-14 22:14:13,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:13,437 INFO L124 PetriNetUnfolderBase]: 7/358 cut-off events. [2025-03-14 22:14:13,437 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-03-14 22:14:13,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 358 events. 7/358 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 866 event pairs, 0 based on Foata normal form. 34/370 useless extension candidates. Maximal degree in co-relation 282. Up to 7 conditions per place. [2025-03-14 22:14:13,447 INFO L140 encePairwiseOnDemand]: 365/384 looper letters, 6 selfloop transitions, 0 changer transitions 3/358 dead transitions. [2025-03-14 22:14:13,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 358 transitions, 746 flow [2025-03-14 22:14:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 22:14:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 22:14:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 743 transitions. [2025-03-14 22:14:13,459 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9674479166666666 [2025-03-14 22:14:13,463 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, -7 predicate places. [2025-03-14 22:14:13,463 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 358 transitions, 746 flow [2025-03-14 22:14:13,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 363.5) internal successors, (727), 2 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:13,464 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:13,464 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:13,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:14:13,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:13,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:13,466 INFO L85 PathProgramCache]: Analyzing trace with hash 644991549, now seen corresponding path program 1 times [2025-03-14 22:14:13,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:13,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529326798] [2025-03-14 22:14:13,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:13,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:14:13,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:13,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529326798] [2025-03-14 22:14:13,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529326798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:13,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:13,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 22:14:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528113635] [2025-03-14 22:14:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:13,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 22:14:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:13,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 22:14:13,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 22:14:13,764 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 344 out of 384 [2025-03-14 22:14:13,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 358 transitions, 746 flow. Second operand has 5 states, 5 states have (on average 347.4) internal successors, (1737), 5 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:13,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:13,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 344 of 384 [2025-03-14 22:14:13,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:13,882 INFO L124 PetriNetUnfolderBase]: 7/365 cut-off events. [2025-03-14 22:14:13,882 INFO L125 PetriNetUnfolderBase]: For 23/31 co-relation queries the response was YES. [2025-03-14 22:14:13,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 365 events. 7/365 cut-off events. For 23/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 863 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 310. Up to 11 conditions per place. [2025-03-14 22:14:13,886 INFO L140 encePairwiseOnDemand]: 377/384 looper letters, 19 selfloop transitions, 6 changer transitions 3/362 dead transitions. [2025-03-14 22:14:13,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 362 transitions, 804 flow [2025-03-14 22:14:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 22:14:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 22:14:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1746 transitions. [2025-03-14 22:14:13,892 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.909375 [2025-03-14 22:14:13,892 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, -3 predicate places. [2025-03-14 22:14:13,896 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 362 transitions, 804 flow [2025-03-14 22:14:13,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 347.4) internal successors, (1737), 5 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:13,897 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:13,897 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:13,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:14:13,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:13,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash 773512054, now seen corresponding path program 1 times [2025-03-14 22:14:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:13,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959855941] [2025-03-14 22:14:13,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:13,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:14:14,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959855941] [2025-03-14 22:14:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959855941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:14:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616122219] [2025-03-14 22:14:14,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:14,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:14:14,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:14:14,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:14:14,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 22:14:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:14,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 22:14:14,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:14:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:14:14,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:14:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:14:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616122219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:14:14,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:14:14,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-14 22:14:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852887141] [2025-03-14 22:14:14,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:14:14,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:14:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:14,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:14:14,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:14:14,520 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 384 [2025-03-14 22:14:14,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 362 transitions, 804 flow. Second operand has 14 states, 14 states have (on average 346.0) internal successors, (4844), 14 states have internal predecessors, (4844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:14,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:14,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 384 [2025-03-14 22:14:14,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:14,742 INFO L124 PetriNetUnfolderBase]: 7/375 cut-off events. [2025-03-14 22:14:14,742 INFO L125 PetriNetUnfolderBase]: For 54/68 co-relation queries the response was YES. [2025-03-14 22:14:14,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 375 events. 7/375 cut-off events. For 54/68 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 853 event pairs, 0 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 354. Up to 16 conditions per place. [2025-03-14 22:14:14,747 INFO L140 encePairwiseOnDemand]: 374/384 looper letters, 20 selfloop transitions, 13 changer transitions 3/369 dead transitions. [2025-03-14 22:14:14,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 369 transitions, 894 flow [2025-03-14 22:14:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 22:14:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 22:14:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3808 transitions. [2025-03-14 22:14:14,753 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9015151515151515 [2025-03-14 22:14:14,754 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, 7 predicate places. [2025-03-14 22:14:14,754 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 369 transitions, 894 flow [2025-03-14 22:14:14,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 346.0) internal successors, (4844), 14 states have internal predecessors, (4844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:14,756 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:14,756 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:14,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 22:14:14,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:14:14,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:14,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash 838104598, now seen corresponding path program 2 times [2025-03-14 22:14:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:14,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377865600] [2025-03-14 22:14:14,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:14:14,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:14,995 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:14:14,995 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:15,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377865600] [2025-03-14 22:14:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377865600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:15,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:15,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:14:15,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886111564] [2025-03-14 22:14:15,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:15,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:14:15,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:15,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:14:15,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:14:15,749 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 384 [2025-03-14 22:14:15,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 369 transitions, 894 flow. Second operand has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:15,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:15,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 384 [2025-03-14 22:14:15,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:20,177 INFO L124 PetriNetUnfolderBase]: 9409/34007 cut-off events. [2025-03-14 22:14:20,178 INFO L125 PetriNetUnfolderBase]: For 11170/11232 co-relation queries the response was YES. [2025-03-14 22:14:20,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51845 conditions, 34007 events. 9409/34007 cut-off events. For 11170/11232 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 454759 event pairs, 3196 based on Foata normal form. 3/30803 useless extension candidates. Maximal degree in co-relation 50782. Up to 4903 conditions per place. [2025-03-14 22:14:20,461 INFO L140 encePairwiseOnDemand]: 354/384 looper letters, 320 selfloop transitions, 46 changer transitions 17/672 dead transitions. [2025-03-14 22:14:20,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 672 transitions, 2545 flow [2025-03-14 22:14:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-14 22:14:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-14 22:14:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 7794 transitions. [2025-03-14 22:14:20,476 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7806490384615384 [2025-03-14 22:14:20,477 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, 32 predicate places. [2025-03-14 22:14:20,477 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 672 transitions, 2545 flow [2025-03-14 22:14:20,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:20,479 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:20,480 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:20,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:14:20,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:20,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -671252748, now seen corresponding path program 3 times [2025-03-14 22:14:20,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:20,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991125420] [2025-03-14 22:14:20,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:14:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:20,518 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:14:20,518 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:21,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:21,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991125420] [2025-03-14 22:14:21,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991125420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:21,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:21,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:14:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936617136] [2025-03-14 22:14:21,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:21,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:14:21,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:21,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:14:21,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:14:21,180 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 384 [2025-03-14 22:14:21,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 672 transitions, 2545 flow. Second operand has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:21,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:21,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 384 [2025-03-14 22:14:21,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:26,261 INFO L124 PetriNetUnfolderBase]: 12733/42393 cut-off events. [2025-03-14 22:14:26,261 INFO L125 PetriNetUnfolderBase]: For 17817/27905 co-relation queries the response was YES. [2025-03-14 22:14:26,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85204 conditions, 42393 events. 12733/42393 cut-off events. For 17817/27905 co-relation queries the response was YES. Maximal size of possible extension queue 1571. Compared 574527 event pairs, 3116 based on Foata normal form. 470/39156 useless extension candidates. Maximal degree in co-relation 83807. Up to 7082 conditions per place. [2025-03-14 22:14:26,671 INFO L140 encePairwiseOnDemand]: 354/384 looper letters, 779 selfloop transitions, 114 changer transitions 33/1215 dead transitions. [2025-03-14 22:14:26,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 1215 transitions, 6983 flow [2025-03-14 22:14:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-14 22:14:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-14 22:14:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 7828 transitions. [2025-03-14 22:14:26,686 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7840544871794872 [2025-03-14 22:14:26,689 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, 57 predicate places. [2025-03-14 22:14:26,689 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 1215 transitions, 6983 flow [2025-03-14 22:14:26,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:26,691 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:26,691 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:26,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 22:14:26,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:26,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:26,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2073959648, now seen corresponding path program 4 times [2025-03-14 22:14:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:26,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5234128] [2025-03-14 22:14:26,693 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:14:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:26,746 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:14:26,746 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:27,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:27,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5234128] [2025-03-14 22:14:27,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5234128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:27,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:27,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:14:27,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330321479] [2025-03-14 22:14:27,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:27,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:14:27,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:27,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:14:27,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:14:27,419 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 384 [2025-03-14 22:14:27,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 1215 transitions, 6983 flow. Second operand has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:27,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:27,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 384 [2025-03-14 22:14:27,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:48,028 INFO L124 PetriNetUnfolderBase]: 49920/170984 cut-off events. [2025-03-14 22:14:48,028 INFO L125 PetriNetUnfolderBase]: For 150730/369517 co-relation queries the response was YES. [2025-03-14 22:14:48,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394879 conditions, 170984 events. 49920/170984 cut-off events. For 150730/369517 co-relation queries the response was YES. Maximal size of possible extension queue 4695. Compared 2737725 event pairs, 6936 based on Foata normal form. 1309/155704 useless extension candidates. Maximal degree in co-relation 388530. Up to 16641 conditions per place. [2025-03-14 22:14:49,457 INFO L140 encePairwiseOnDemand]: 354/384 looper letters, 2736 selfloop transitions, 519 changer transitions 481/4092 dead transitions. [2025-03-14 22:14:49,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 4092 transitions, 35505 flow [2025-03-14 22:14:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 22:14:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 22:14:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 10552 transitions. [2025-03-14 22:14:49,470 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7851190476190476 [2025-03-14 22:14:49,470 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, 91 predicate places. [2025-03-14 22:14:49,470 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 4092 transitions, 35505 flow [2025-03-14 22:14:49,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:49,472 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:49,472 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:49,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 22:14:49,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:14:49,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:49,473 INFO L85 PathProgramCache]: Analyzing trace with hash -162523224, now seen corresponding path program 5 times [2025-03-14 22:14:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242128272] [2025-03-14 22:14:49,473 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:14:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:49,502 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 22:14:49,503 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-14 22:14:50,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:50,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242128272] [2025-03-14 22:14:50,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242128272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:14:50,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791264549] [2025-03-14 22:14:50,663 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:14:50,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:14:50,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:14:50,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:14:50,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 22:14:50,771 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 22:14:50,771 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:50,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-14 22:14:50,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:14:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:51,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:14:51,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791264549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:51,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:14:51,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [18] total 22 [2025-03-14 22:14:51,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660243568] [2025-03-14 22:14:51,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:51,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:14:51,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:51,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:14:51,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-03-14 22:14:51,091 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 384 [2025-03-14 22:14:51,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 4092 transitions, 35505 flow. Second operand has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:51,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:51,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 384 [2025-03-14 22:14:51,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:15:30,539 INFO L124 PetriNetUnfolderBase]: 71500/244417 cut-off events. [2025-03-14 22:15:30,539 INFO L125 PetriNetUnfolderBase]: For 296173/1431995 co-relation queries the response was YES. [2025-03-14 22:15:31,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665368 conditions, 244417 events. 71500/244417 cut-off events. For 296173/1431995 co-relation queries the response was YES. Maximal size of possible extension queue 6301. Compared 4078167 event pairs, 8043 based on Foata normal form. 4378/225711 useless extension candidates. Maximal degree in co-relation 518337. Up to 30396 conditions per place. [2025-03-14 22:15:32,890 INFO L140 encePairwiseOnDemand]: 358/384 looper letters, 6134 selfloop transitions, 703 changer transitions 783/7943 dead transitions. [2025-03-14 22:15:32,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 7943 transitions, 87258 flow [2025-03-14 22:15:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 22:15:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 22:15:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 7497 transitions. [2025-03-14 22:15:32,894 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7809375 [2025-03-14 22:15:32,894 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, 115 predicate places. [2025-03-14 22:15:32,894 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 7943 transitions, 87258 flow [2025-03-14 22:15:32,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:32,895 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:15:32,896 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:15:32,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 22:15:33,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-14 22:15:33,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:15:33,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:15:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1153882064, now seen corresponding path program 6 times [2025-03-14 22:15:33,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:15:33,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462486670] [2025-03-14 22:15:33,097 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:15:33,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:15:33,122 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:15:33,122 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:15:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:33,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:33,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462486670] [2025-03-14 22:15:33,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462486670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:15:33,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:15:33,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:15:33,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335135879] [2025-03-14 22:15:33,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:15:33,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:15:33,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:33,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:15:33,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:15:33,502 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 384 [2025-03-14 22:15:33,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 7943 transitions, 87258 flow. Second operand has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:33,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:33,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 384 [2025-03-14 22:15:33,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:16:59,099 INFO L124 PetriNetUnfolderBase]: 95689/331502 cut-off events. [2025-03-14 22:16:59,100 INFO L125 PetriNetUnfolderBase]: For 569370/2965757 co-relation queries the response was YES. [2025-03-14 22:17:00,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025356 conditions, 331502 events. 95689/331502 cut-off events. For 569370/2965757 co-relation queries the response was YES. Maximal size of possible extension queue 8677. Compared 5761628 event pairs, 10154 based on Foata normal form. 19482/320217 useless extension candidates. Maximal degree in co-relation 796223. Up to 46383 conditions per place. [2025-03-14 22:17:02,530 INFO L140 encePairwiseOnDemand]: 353/384 looper letters, 8851 selfloop transitions, 1717 changer transitions 1534/12425 dead transitions. [2025-03-14 22:17:02,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 12425 transitions, 163392 flow [2025-03-14 22:17:02,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 22:17:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 22:17:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 9647 transitions. [2025-03-14 22:17:02,534 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7850748697916666 [2025-03-14 22:17:02,535 INFO L298 CegarLoopForPetriNet]: 369 programPoint places, 146 predicate places. [2025-03-14 22:17:02,535 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 12425 transitions, 163392 flow [2025-03-14 22:17:02,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:17:02,536 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:17:02,536 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:17:02,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 22:17:02,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:17:02,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:17:02,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1076823718, now seen corresponding path program 7 times [2025-03-14 22:17:02,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:17:02,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883446889] [2025-03-14 22:17:02,537 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:17:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:17:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:17:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:17:02,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:17:02,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883446889] [2025-03-14 22:17:02,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883446889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:17:02,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:17:02,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:17:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637682852] [2025-03-14 22:17:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:17:02,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:17:02,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:17:02,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:17:02,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:17:02,898 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 384 [2025-03-14 22:17:02,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 12425 transitions, 163392 flow. Second operand has 14 states, 14 states have (on average 289.0) internal successors, (4046), 14 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:17:02,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:17:02,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 384 [2025-03-14 22:17:02,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand