/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/array-eq-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:57:47,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:57:47,768 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 21:57:47,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:57:47,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:57:47,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:57:47,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:57:47,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:57:47,800 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:57:47,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:57:47,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:57:47,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:57:47,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:57:47,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:57:47,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:57:47,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:57:47,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:57:47,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:57:47,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:57:47,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:57:47,803 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 21:57:48,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:57:48,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:57:48,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:57:48,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:57:48,022 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:57:48,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2025-03-14 21:57:49,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8523b84/0328c7441c224f8d9622ab4af0c32bba/FLAG0dd136b11 [2025-03-14 21:57:49,350 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:57:49,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2025-03-14 21:57:49,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8523b84/0328c7441c224f8d9622ab4af0c32bba/FLAG0dd136b11 [2025-03-14 21:57:49,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8523b84/0328c7441c224f8d9622ab4af0c32bba [2025-03-14 21:57:49,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:57:49,376 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:57:49,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:57:49,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:57:49,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:57:49,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e3feae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49, skipping insertion in model container [2025-03-14 21:57:49,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:57:49,518 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/array-eq-symm.wvr.c[2277,2290] [2025-03-14 21:57:49,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:57:49,535 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:57:49,551 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/array-eq-symm.wvr.c[2277,2290] [2025-03-14 21:57:49,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:57:49,566 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:57:49,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49 WrapperNode [2025-03-14 21:57:49,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:57:49,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:57:49,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:57:49,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:57:49,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,593 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 99 [2025-03-14 21:57:49,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:57:49,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:57:49,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:57:49,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:57:49,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:57:49,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:57:49,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:57:49,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:57:49,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (1/1) ... [2025-03-14 21:57:49,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:57:49,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:57:49,641 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 21:57:49,646 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 21:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 21:57:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 21:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 21:57:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 21:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 21:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 21:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:57:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 21:57:49,662 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 21:57:49,727 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:57:49,728 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:57:49,933 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:57:49,933 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:57:49,944 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:57:49,945 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 21:57:49,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:57:49 BoogieIcfgContainer [2025-03-14 21:57:49,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:57:49,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:57:49,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:57:49,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:57:49,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:57:49" (1/3) ... [2025-03-14 21:57:49,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d08775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:57:49, skipping insertion in model container [2025-03-14 21:57:49,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:49" (2/3) ... [2025-03-14 21:57:49,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d08775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:57:49, skipping insertion in model container [2025-03-14 21:57:49,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:57:49" (3/3) ... [2025-03-14 21:57:49,954 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2025-03-14 21:57:49,965 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:57:49,967 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-symm.wvr.c that has 3 procedures, 156 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 21:57:49,967 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:57:50,026 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 21:57:50,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:57:50,066 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;@65288f00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:57:50,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 21:57:50,130 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:57:50,131 INFO L124 PetriNetUnfolderBase]: 11/158 cut-off events. [2025-03-14 21:57:50,132 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 21:57:50,134 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:50,135 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] [2025-03-14 21:57:50,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:57:50,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash 159653316, now seen corresponding path program 1 times [2025-03-14 21:57:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:50,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99318289] [2025-03-14 21:57:50,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:50,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:50,784 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 21:57:50,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:50,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99318289] [2025-03-14 21:57:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99318289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 21:57:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705120130] [2025-03-14 21:57:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:50,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 21:57:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:50,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 21:57:50,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 21:57:50,818 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 166 [2025-03-14 21:57:50,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 166 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 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 21:57:50,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:50,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 166 [2025-03-14 21:57:50,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:51,154 INFO L124 PetriNetUnfolderBase]: 180/642 cut-off events. [2025-03-14 21:57:51,154 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-14 21:57:51,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 642 events. 180/642 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3151 event pairs, 41 based on Foata normal form. 9/558 useless extension candidates. Maximal degree in co-relation 761. Up to 138 conditions per place. [2025-03-14 21:57:51,165 INFO L140 encePairwiseOnDemand]: 148/166 looper letters, 77 selfloop transitions, 5 changer transitions 11/194 dead transitions. [2025-03-14 21:57:51,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 194 transitions, 601 flow [2025-03-14 21:57:51,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:57:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:57:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1066 transitions. [2025-03-14 21:57:51,184 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.713520749665328 [2025-03-14 21:57:51,187 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1 predicate places. [2025-03-14 21:57:51,188 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 194 transitions, 601 flow [2025-03-14 21:57:51,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 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 21:57:51,188 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:51,189 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] [2025-03-14 21:57:51,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:57:51,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:57:51,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1608476911, now seen corresponding path program 1 times [2025-03-14 21:57:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:51,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203497034] [2025-03-14 21:57:51,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:51,412 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 21:57:51,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:51,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203497034] [2025-03-14 21:57:51,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203497034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:51,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:51,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:57:51,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691473883] [2025-03-14 21:57:51,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:51,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:57:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:51,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:57:51,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:57:51,417 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 166 [2025-03-14 21:57:51,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 194 transitions, 601 flow. Second operand has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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 21:57:51,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:51,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 166 [2025-03-14 21:57:51,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:51,656 INFO L124 PetriNetUnfolderBase]: 249/969 cut-off events. [2025-03-14 21:57:51,656 INFO L125 PetriNetUnfolderBase]: For 299/331 co-relation queries the response was YES. [2025-03-14 21:57:51,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 969 events. 249/969 cut-off events. For 299/331 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5206 event pairs, 64 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1188. Up to 251 conditions per place. [2025-03-14 21:57:51,665 INFO L140 encePairwiseOnDemand]: 153/166 looper letters, 97 selfloop transitions, 15 changer transitions 15/243 dead transitions. [2025-03-14 21:57:51,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 243 transitions, 1018 flow [2025-03-14 21:57:51,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 21:57:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 21:57:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1229 transitions. [2025-03-14 21:57:51,668 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7403614457831326 [2025-03-14 21:57:51,669 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 10 predicate places. [2025-03-14 21:57:51,669 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 243 transitions, 1018 flow [2025-03-14 21:57:51,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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 21:57:51,670 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:51,670 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] [2025-03-14 21:57:51,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 21:57:51,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:57:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2030134281, now seen corresponding path program 1 times [2025-03-14 21:57:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662948948] [2025-03-14 21:57:51,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:57:51,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:51,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662948948] [2025-03-14 21:57:51,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662948948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:51,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:51,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:57:51,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387607088] [2025-03-14 21:57:51,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:51,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:57:51,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:51,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:57:51,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:57:51,868 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 166 [2025-03-14 21:57:51,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 243 transitions, 1018 flow. Second operand has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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 21:57:51,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:51,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 166 [2025-03-14 21:57:51,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:52,118 INFO L124 PetriNetUnfolderBase]: 219/859 cut-off events. [2025-03-14 21:57:52,118 INFO L125 PetriNetUnfolderBase]: For 514/560 co-relation queries the response was YES. [2025-03-14 21:57:52,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 859 events. 219/859 cut-off events. For 514/560 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4286 event pairs, 56 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 1412. Up to 208 conditions per place. [2025-03-14 21:57:52,123 INFO L140 encePairwiseOnDemand]: 153/166 looper letters, 67 selfloop transitions, 11 changer transitions 37/235 dead transitions. [2025-03-14 21:57:52,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 235 transitions, 1173 flow [2025-03-14 21:57:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 21:57:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 21:57:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1229 transitions. [2025-03-14 21:57:52,128 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7403614457831326 [2025-03-14 21:57:52,129 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 19 predicate places. [2025-03-14 21:57:52,129 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 235 transitions, 1173 flow [2025-03-14 21:57:52,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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 21:57:52,129 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:52,129 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] [2025-03-14 21:57:52,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 21:57:52,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:57:52,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash 875356070, now seen corresponding path program 1 times [2025-03-14 21:57:52,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813775358] [2025-03-14 21:57:52,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:52,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:57:52,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:52,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813775358] [2025-03-14 21:57:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813775358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:52,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:57:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822095443] [2025-03-14 21:57:52,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:52,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:57:52,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:52,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:57:52,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:57:52,288 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 166 [2025-03-14 21:57:52,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 235 transitions, 1173 flow. Second operand has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 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 21:57:52,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:52,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 166 [2025-03-14 21:57:52,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:52,504 INFO L124 PetriNetUnfolderBase]: 255/1071 cut-off events. [2025-03-14 21:57:52,504 INFO L125 PetriNetUnfolderBase]: For 1190/1310 co-relation queries the response was YES. [2025-03-14 21:57:52,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2974 conditions, 1071 events. 255/1071 cut-off events. For 1190/1310 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5829 event pairs, 70 based on Foata normal form. 2/943 useless extension candidates. Maximal degree in co-relation 1652. Up to 251 conditions per place. [2025-03-14 21:57:52,512 INFO L140 encePairwiseOnDemand]: 153/166 looper letters, 86 selfloop transitions, 15 changer transitions 56/273 dead transitions. [2025-03-14 21:57:52,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 273 transitions, 1774 flow [2025-03-14 21:57:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 21:57:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 21:57:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1214 transitions. [2025-03-14 21:57:52,526 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7313253012048193 [2025-03-14 21:57:52,527 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 28 predicate places. [2025-03-14 21:57:52,527 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 273 transitions, 1774 flow [2025-03-14 21:57:52,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 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 21:57:52,528 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:52,528 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] [2025-03-14 21:57:52,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 21:57:52,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:57:52,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:52,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1948587802, now seen corresponding path program 1 times [2025-03-14 21:57:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:52,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174375655] [2025-03-14 21:57:52,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:57:52,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:52,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174375655] [2025-03-14 21:57:52,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174375655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:52,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:52,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:57:52,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986558115] [2025-03-14 21:57:52,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:52,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:57:52,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:52,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:57:52,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:57:52,671 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 166 [2025-03-14 21:57:52,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 273 transitions, 1774 flow. Second operand has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 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 21:57:52,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:52,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 166 [2025-03-14 21:57:52,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:52,928 INFO L124 PetriNetUnfolderBase]: 225/961 cut-off events. [2025-03-14 21:57:52,928 INFO L125 PetriNetUnfolderBase]: For 1626/1736 co-relation queries the response was YES. [2025-03-14 21:57:52,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3020 conditions, 961 events. 225/961 cut-off events. For 1626/1736 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4893 event pairs, 62 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1876. Up to 208 conditions per place. [2025-03-14 21:57:52,933 INFO L140 encePairwiseOnDemand]: 153/166 looper letters, 71 selfloop transitions, 11 changer transitions 63/265 dead transitions. [2025-03-14 21:57:52,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 265 transitions, 1957 flow [2025-03-14 21:57:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 21:57:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 21:57:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1214 transitions. [2025-03-14 21:57:52,935 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7313253012048193 [2025-03-14 21:57:52,937 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 37 predicate places. [2025-03-14 21:57:52,938 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 265 transitions, 1957 flow [2025-03-14 21:57:52,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 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 21:57:52,938 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:52,938 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] [2025-03-14 21:57:52,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 21:57:52,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:57:52,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1993408958, now seen corresponding path program 1 times [2025-03-14 21:57:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:52,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958971819] [2025-03-14 21:57:52,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:57:53,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958971819] [2025-03-14 21:57:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958971819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:57:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778760938] [2025-03-14 21:57:53,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:53,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:57:53,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:57:53,216 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 21:57:53,217 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 21:57:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:53,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 21:57:53,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:57:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:57:53,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:57:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:57:54,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778760938] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 21:57:54,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 21:57:54,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 30 [2025-03-14 21:57:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327348612] [2025-03-14 21:57:54,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:54,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 21:57:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:54,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 21:57:54,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2025-03-14 21:57:54,216 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 166 [2025-03-14 21:57:54,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 265 transitions, 1957 flow. Second operand has 11 states, 11 states have (on average 115.9090909090909) internal successors, (1275), 11 states have internal predecessors, (1275), 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 21:57:54,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:54,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 166 [2025-03-14 21:57:54,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:54,658 INFO L124 PetriNetUnfolderBase]: 212/985 cut-off events. [2025-03-14 21:57:54,658 INFO L125 PetriNetUnfolderBase]: For 2744/2916 co-relation queries the response was YES. [2025-03-14 21:57:54,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3451 conditions, 985 events. 212/985 cut-off events. For 2744/2916 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5216 event pairs, 56 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 2118. Up to 246 conditions per place. [2025-03-14 21:57:54,663 INFO L140 encePairwiseOnDemand]: 146/166 looper letters, 77 selfloop transitions, 16 changer transitions 63/274 dead transitions. [2025-03-14 21:57:54,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 274 transitions, 2374 flow [2025-03-14 21:57:54,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 21:57:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 21:57:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1785 transitions. [2025-03-14 21:57:54,666 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7168674698795181 [2025-03-14 21:57:54,667 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 51 predicate places. [2025-03-14 21:57:54,667 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 274 transitions, 2374 flow [2025-03-14 21:57:54,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 115.9090909090909) internal successors, (1275), 11 states have internal predecessors, (1275), 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 21:57:54,667 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:54,668 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] [2025-03-14 21:57:54,676 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 21:57:54,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-14 21:57:54,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:57:54,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash -290619646, now seen corresponding path program 1 times [2025-03-14 21:57:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180241030] [2025-03-14 21:57:54,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:57:55,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:55,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180241030] [2025-03-14 21:57:55,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180241030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:57:55,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220063792] [2025-03-14 21:57:55,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:55,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:57:55,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:57:55,114 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 21:57:55,115 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 21:57:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:55,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 21:57:55,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:57:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:57:55,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:57:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:57:55,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220063792] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 21:57:55,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 21:57:55,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 30 [2025-03-14 21:57:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317582833] [2025-03-14 21:57:55,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:55,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 21:57:55,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:55,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 21:57:55,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2025-03-14 21:57:55,887 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 166 [2025-03-14 21:57:55,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 274 transitions, 2374 flow. Second operand has 11 states, 11 states have (on average 115.9090909090909) internal successors, (1275), 11 states have internal predecessors, (1275), 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 21:57:55,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:55,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 166 [2025-03-14 21:57:55,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:56,274 INFO L124 PetriNetUnfolderBase]: 178/1003 cut-off events. [2025-03-14 21:57:56,274 INFO L125 PetriNetUnfolderBase]: For 3622/3862 co-relation queries the response was YES. [2025-03-14 21:57:56,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 1003 events. 178/1003 cut-off events. For 3622/3862 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5482 event pairs, 51 based on Foata normal form. 5/918 useless extension candidates. Maximal degree in co-relation 2174. Up to 243 conditions per place. [2025-03-14 21:57:56,279 INFO L140 encePairwiseOnDemand]: 146/166 looper letters, 88 selfloop transitions, 18 changer transitions 63/283 dead transitions. [2025-03-14 21:57:56,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 283 transitions, 2838 flow [2025-03-14 21:57:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 21:57:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 21:57:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1783 transitions. [2025-03-14 21:57:56,283 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7160642570281125 [2025-03-14 21:57:56,285 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 65 predicate places. [2025-03-14 21:57:56,285 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 283 transitions, 2838 flow [2025-03-14 21:57:56,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 115.9090909090909) internal successors, (1275), 11 states have internal predecessors, (1275), 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 21:57:56,286 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:56,286 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] [2025-03-14 21:57:56,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 21:57:56,486 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 21:57:56,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:57:56,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash -485416495, now seen corresponding path program 1 times [2025-03-14 21:57:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855932768] [2025-03-14 21:57:56,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:56,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:57:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:57,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855932768] [2025-03-14 21:57:57,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855932768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:57,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:57,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:57:57,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115988165] [2025-03-14 21:57:57,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:57,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:57:57,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:57,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:57:57,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:57:57,135 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:57:57,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 283 transitions, 2838 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:57:57,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:57,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:57:57,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:58,014 INFO L124 PetriNetUnfolderBase]: 688/1942 cut-off events. [2025-03-14 21:57:58,014 INFO L125 PetriNetUnfolderBase]: For 8992/9148 co-relation queries the response was YES. [2025-03-14 21:57:58,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8046 conditions, 1942 events. 688/1942 cut-off events. For 8992/9148 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 11541 event pairs, 47 based on Foata normal form. 4/1765 useless extension candidates. Maximal degree in co-relation 5479. Up to 464 conditions per place. [2025-03-14 21:57:58,026 INFO L140 encePairwiseOnDemand]: 135/166 looper letters, 214 selfloop transitions, 63 changer transitions 63/442 dead transitions. [2025-03-14 21:57:58,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 442 transitions, 4457 flow [2025-03-14 21:57:58,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-14 21:57:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-14 21:57:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4095 transitions. [2025-03-14 21:57:58,034 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6491756499682942 [2025-03-14 21:57:58,034 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 102 predicate places. [2025-03-14 21:57:58,034 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 442 transitions, 4457 flow [2025-03-14 21:57:58,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:57:58,035 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:58,035 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] [2025-03-14 21:57:58,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 21:57:58,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:57:58,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash -786068011, now seen corresponding path program 2 times [2025-03-14 21:57:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560789859] [2025-03-14 21:57:58,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:57:58,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:58,057 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:57:58,058 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:57:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:57:58,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:58,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560789859] [2025-03-14 21:57:58,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560789859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:58,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:58,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:57:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042802351] [2025-03-14 21:57:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:58,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:57:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:58,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:57:58,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:57:58,631 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:57:58,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 442 transitions, 4457 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:57:58,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:58,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:57:58,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:59,361 INFO L124 PetriNetUnfolderBase]: 707/1977 cut-off events. [2025-03-14 21:57:59,362 INFO L125 PetriNetUnfolderBase]: For 9937/10137 co-relation queries the response was YES. [2025-03-14 21:57:59,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 1977 events. 707/1977 cut-off events. For 9937/10137 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 11708 event pairs, 37 based on Foata normal form. 11/1803 useless extension candidates. Maximal degree in co-relation 6796. Up to 796 conditions per place. [2025-03-14 21:57:59,375 INFO L140 encePairwiseOnDemand]: 133/166 looper letters, 245 selfloop transitions, 66 changer transitions 71/484 dead transitions. [2025-03-14 21:57:59,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 484 transitions, 5412 flow [2025-03-14 21:57:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 21:57:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 21:57:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2999 transitions. [2025-03-14 21:57:59,381 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.645223752151463 [2025-03-14 21:57:59,382 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 129 predicate places. [2025-03-14 21:57:59,382 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 484 transitions, 5412 flow [2025-03-14 21:57:59,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:57:59,383 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:59,383 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] [2025-03-14 21:57:59,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 21:57:59,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:57:59,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash 807287833, now seen corresponding path program 3 times [2025-03-14 21:57:59,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:59,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182428788] [2025-03-14 21:57:59,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:57:59,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:59,397 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 21:57:59,397 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:57:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:57:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:59,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182428788] [2025-03-14 21:57:59,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182428788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:59,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:59,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:57:59,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859785835] [2025-03-14 21:57:59,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:59,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:57:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:59,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:57:59,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:57:59,864 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:57:59,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 484 transitions, 5412 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:57:59,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:59,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:57:59,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:00,669 INFO L124 PetriNetUnfolderBase]: 713/2005 cut-off events. [2025-03-14 21:58:00,669 INFO L125 PetriNetUnfolderBase]: For 11163/11410 co-relation queries the response was YES. [2025-03-14 21:58:00,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11217 conditions, 2005 events. 713/2005 cut-off events. For 11163/11410 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 11946 event pairs, 22 based on Foata normal form. 5/1825 useless extension candidates. Maximal degree in co-relation 8116. Up to 796 conditions per place. [2025-03-14 21:58:00,685 INFO L140 encePairwiseOnDemand]: 135/166 looper letters, 258 selfloop transitions, 86 changer transitions 101/547 dead transitions. [2025-03-14 21:58:00,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 547 transitions, 6884 flow [2025-03-14 21:58:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 21:58:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 21:58:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3620 transitions. [2025-03-14 21:58:00,689 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6413890857547838 [2025-03-14 21:58:00,689 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 162 predicate places. [2025-03-14 21:58:00,689 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 547 transitions, 6884 flow [2025-03-14 21:58:00,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:00,690 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:00,690 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] [2025-03-14 21:58:00,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 21:58:00,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:00,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash 65916173, now seen corresponding path program 1 times [2025-03-14 21:58:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:00,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924627663] [2025-03-14 21:58:00,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:58:00,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:58:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924627663] [2025-03-14 21:58:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924627663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:01,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:01,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:01,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452798461] [2025-03-14 21:58:01,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:01,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:01,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:01,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:01,203 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:01,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 547 transitions, 6884 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:01,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:01,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:01,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:02,006 INFO L124 PetriNetUnfolderBase]: 722/2035 cut-off events. [2025-03-14 21:58:02,006 INFO L125 PetriNetUnfolderBase]: For 13185/13596 co-relation queries the response was YES. [2025-03-14 21:58:02,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12888 conditions, 2035 events. 722/2035 cut-off events. For 13185/13596 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 12174 event pairs, 14 based on Foata normal form. 22/1872 useless extension candidates. Maximal degree in co-relation 9462. Up to 796 conditions per place. [2025-03-14 21:58:02,023 INFO L140 encePairwiseOnDemand]: 135/166 looper letters, 265 selfloop transitions, 82 changer transitions 125/574 dead transitions. [2025-03-14 21:58:02,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 574 transitions, 8110 flow [2025-03-14 21:58:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 21:58:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 21:58:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3622 transitions. [2025-03-14 21:58:02,029 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6417434443656981 [2025-03-14 21:58:02,030 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 195 predicate places. [2025-03-14 21:58:02,030 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 574 transitions, 8110 flow [2025-03-14 21:58:02,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:02,030 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:02,031 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] [2025-03-14 21:58:02,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 21:58:02,031 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:02,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:02,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1248921335, now seen corresponding path program 2 times [2025-03-14 21:58:02,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:02,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113856675] [2025-03-14 21:58:02,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:58:02,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:02,042 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:58:02,042 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:02,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:02,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113856675] [2025-03-14 21:58:02,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113856675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:02,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:02,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:58:02,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829443997] [2025-03-14 21:58:02,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:02,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:58:02,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:02,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:58:02,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:58:02,499 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:02,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 574 transitions, 8110 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:02,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:02,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:02,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:03,246 INFO L124 PetriNetUnfolderBase]: 732/2053 cut-off events. [2025-03-14 21:58:03,247 INFO L125 PetriNetUnfolderBase]: For 14646/15023 co-relation queries the response was YES. [2025-03-14 21:58:03,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14587 conditions, 2053 events. 732/2053 cut-off events. For 14646/15023 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 12356 event pairs, 14 based on Foata normal form. 18/1886 useless extension candidates. Maximal degree in co-relation 10888. Up to 796 conditions per place. [2025-03-14 21:58:03,260 INFO L140 encePairwiseOnDemand]: 133/166 looper letters, 273 selfloop transitions, 83 changer transitions 125/583 dead transitions. [2025-03-14 21:58:03,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 583 transitions, 9174 flow [2025-03-14 21:58:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 21:58:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 21:58:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3111 transitions. [2025-03-14 21:58:03,263 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6462401329455754 [2025-03-14 21:58:03,263 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 223 predicate places. [2025-03-14 21:58:03,263 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 583 transitions, 9174 flow [2025-03-14 21:58:03,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:03,264 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:03,264 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] [2025-03-14 21:58:03,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 21:58:03,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:03,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash 271388553, now seen corresponding path program 3 times [2025-03-14 21:58:03,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:03,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762207196] [2025-03-14 21:58:03,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:58:03,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:03,281 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 21:58:03,282 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:03,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:03,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762207196] [2025-03-14 21:58:03,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762207196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:03,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:03,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:58:03,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014306768] [2025-03-14 21:58:03,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:03,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:58:03,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:03,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:58:03,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:58:03,695 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:03,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 583 transitions, 9174 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:03,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:03,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:03,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:04,542 INFO L124 PetriNetUnfolderBase]: 780/2154 cut-off events. [2025-03-14 21:58:04,543 INFO L125 PetriNetUnfolderBase]: For 15812/16177 co-relation queries the response was YES. [2025-03-14 21:58:04,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17001 conditions, 2154 events. 780/2154 cut-off events. For 15812/16177 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 13051 event pairs, 50 based on Foata normal form. 11/1974 useless extension candidates. Maximal degree in co-relation 13029. Up to 796 conditions per place. [2025-03-14 21:58:04,557 INFO L140 encePairwiseOnDemand]: 135/166 looper letters, 314 selfloop transitions, 123 changer transitions 129/668 dead transitions. [2025-03-14 21:58:04,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 668 transitions, 11653 flow [2025-03-14 21:58:04,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-14 21:58:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-14 21:58:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4066 transitions. [2025-03-14 21:58:04,560 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6445783132530121 [2025-03-14 21:58:04,560 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 260 predicate places. [2025-03-14 21:58:04,560 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 668 transitions, 11653 flow [2025-03-14 21:58:04,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:04,561 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:04,561 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] [2025-03-14 21:58:04,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 21:58:04,561 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1622441775, now seen corresponding path program 4 times [2025-03-14 21:58:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:04,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352473033] [2025-03-14 21:58:04,562 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:58:04,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:04,586 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 21:58:04,586 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:04,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:04,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352473033] [2025-03-14 21:58:04,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352473033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:04,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:04,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 21:58:04,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189024204] [2025-03-14 21:58:04,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:04,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:58:04,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:04,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:58:04,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:58:04,967 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:58:04,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 668 transitions, 11653 flow. Second operand has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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 21:58:04,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:04,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:58:04,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:05,463 INFO L124 PetriNetUnfolderBase]: 826/2266 cut-off events. [2025-03-14 21:58:05,464 INFO L125 PetriNetUnfolderBase]: For 18477/18946 co-relation queries the response was YES. [2025-03-14 21:58:05,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19518 conditions, 2266 events. 826/2266 cut-off events. For 18477/18946 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 13971 event pairs, 50 based on Foata normal form. 13/2082 useless extension candidates. Maximal degree in co-relation 15169. Up to 881 conditions per place. [2025-03-14 21:58:05,480 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 374 selfloop transitions, 95 changer transitions 129/719 dead transitions. [2025-03-14 21:58:05,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 719 transitions, 13785 flow [2025-03-14 21:58:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 21:58:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 21:58:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1736 transitions. [2025-03-14 21:58:05,482 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8044485634847081 [2025-03-14 21:58:05,482 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 272 predicate places. [2025-03-14 21:58:05,482 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 719 transitions, 13785 flow [2025-03-14 21:58:05,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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 21:58:05,483 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:05,483 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] [2025-03-14 21:58:05,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 21:58:05,483 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:05,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -212767275, now seen corresponding path program 5 times [2025-03-14 21:58:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417314661] [2025-03-14 21:58:05,484 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:05,497 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:05,497 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:58:06,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417314661] [2025-03-14 21:58:06,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417314661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:58:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930893658] [2025-03-14 21:58:06,137 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:06,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:58:06,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:58:06,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:58:06,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 21:58:06,200 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:06,200 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:06,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-14 21:58:06,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:58:06,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-14 21:58:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:06,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:58:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930893658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:06,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:58:06,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 24 [2025-03-14 21:58:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140046129] [2025-03-14 21:58:06,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:06,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:06,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:06,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2025-03-14 21:58:06,657 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:06,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 719 transitions, 13785 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:06,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:06,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:06,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:07,673 INFO L124 PetriNetUnfolderBase]: 891/2396 cut-off events. [2025-03-14 21:58:07,673 INFO L125 PetriNetUnfolderBase]: For 21856/22378 co-relation queries the response was YES. [2025-03-14 21:58:07,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22711 conditions, 2396 events. 891/2396 cut-off events. For 21856/22378 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 15065 event pairs, 50 based on Foata normal form. 17/2208 useless extension candidates. Maximal degree in co-relation 17861. Up to 996 conditions per place. [2025-03-14 21:58:07,692 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 464 selfloop transitions, 140 changer transitions 129/835 dead transitions. [2025-03-14 21:58:07,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 835 transitions, 17742 flow [2025-03-14 21:58:07,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-14 21:58:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-14 21:58:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3868 transitions. [2025-03-14 21:58:07,695 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6472556894243642 [2025-03-14 21:58:07,695 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 307 predicate places. [2025-03-14 21:58:07,696 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 835 transitions, 17742 flow [2025-03-14 21:58:07,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:07,696 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:07,696 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] [2025-03-14 21:58:07,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 21:58:07,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:58:07,901 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:07,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash -721718977, now seen corresponding path program 4 times [2025-03-14 21:58:07,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:07,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387554251] [2025-03-14 21:58:07,902 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:58:07,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:07,923 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 21:58:07,923 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387554251] [2025-03-14 21:58:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387554251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:08,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:08,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 21:58:08,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434275143] [2025-03-14 21:58:08,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:08,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:58:08,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:08,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:58:08,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-14 21:58:08,182 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:58:08,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 835 transitions, 17742 flow. Second operand has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:08,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:08,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:58:08,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:08,764 INFO L124 PetriNetUnfolderBase]: 894/2409 cut-off events. [2025-03-14 21:58:08,765 INFO L125 PetriNetUnfolderBase]: For 24024/24586 co-relation queries the response was YES. [2025-03-14 21:58:08,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24632 conditions, 2409 events. 894/2409 cut-off events. For 24024/24586 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 15261 event pairs, 50 based on Foata normal form. 11/2215 useless extension candidates. Maximal degree in co-relation 20980. Up to 996 conditions per place. [2025-03-14 21:58:08,787 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 502 selfloop transitions, 82 changer transitions 135/840 dead transitions. [2025-03-14 21:58:08,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 840 transitions, 19211 flow [2025-03-14 21:58:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 21:58:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 21:58:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1599 transitions. [2025-03-14 21:58:08,789 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.802710843373494 [2025-03-14 21:58:08,789 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 318 predicate places. [2025-03-14 21:58:08,790 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 840 transitions, 19211 flow [2025-03-14 21:58:08,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:08,790 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:08,790 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] [2025-03-14 21:58:08,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 21:58:08,791 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:08,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1024800825, now seen corresponding path program 5 times [2025-03-14 21:58:08,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:08,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198116705] [2025-03-14 21:58:08,792 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:08,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:08,809 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:08,809 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:58:09,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198116705] [2025-03-14 21:58:09,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198116705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:58:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300460230] [2025-03-14 21:58:09,404 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:09,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:58:09,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:58:09,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:58:09,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 21:58:09,468 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:09,468 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:09,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 21:58:09,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:58:09,788 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-14 21:58:09,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-03-14 21:58:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:09,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:58:09,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300460230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:09,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:58:09,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20] total 25 [2025-03-14 21:58:09,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480110356] [2025-03-14 21:58:09,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:09,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:58:09,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:09,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:58:09,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-03-14 21:58:09,800 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:58:09,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 840 transitions, 19211 flow. Second operand has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:09,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:09,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:58:09,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:10,496 INFO L124 PetriNetUnfolderBase]: 900/2431 cut-off events. [2025-03-14 21:58:10,496 INFO L125 PetriNetUnfolderBase]: For 27524/28214 co-relation queries the response was YES. [2025-03-14 21:58:10,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26684 conditions, 2431 events. 900/2431 cut-off events. For 27524/28214 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 15463 event pairs, 50 based on Foata normal form. 16/2242 useless extension candidates. Maximal degree in co-relation 23490. Up to 996 conditions per place. [2025-03-14 21:58:10,513 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 531 selfloop transitions, 93 changer transitions 148/893 dead transitions. [2025-03-14 21:58:10,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 893 transitions, 22057 flow [2025-03-14 21:58:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 21:58:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 21:58:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2237 transitions. [2025-03-14 21:58:10,515 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7927002126151665 [2025-03-14 21:58:10,515 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 334 predicate places. [2025-03-14 21:58:10,515 INFO L471 AbstractCegarLoop]: Abstraction has has 496 places, 893 transitions, 22057 flow [2025-03-14 21:58:10,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:10,516 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:10,516 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] [2025-03-14 21:58:10,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 21:58:10,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-14 21:58:10,717 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:10,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:10,717 INFO L85 PathProgramCache]: Analyzing trace with hash -810839015, now seen corresponding path program 6 times [2025-03-14 21:58:10,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:10,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708853231] [2025-03-14 21:58:10,717 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 21:58:10,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:10,727 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 21:58:10,727 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:11,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708853231] [2025-03-14 21:58:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708853231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:11,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:11,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838535901] [2025-03-14 21:58:11,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:11,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:11,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:11,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:11,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:11,096 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:11,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 893 transitions, 22057 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:11,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:11,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:11,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:11,918 INFO L124 PetriNetUnfolderBase]: 942/2512 cut-off events. [2025-03-14 21:58:11,918 INFO L125 PetriNetUnfolderBase]: For 30546/31278 co-relation queries the response was YES. [2025-03-14 21:58:11,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29499 conditions, 2512 events. 942/2512 cut-off events. For 30546/31278 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 15894 event pairs, 50 based on Foata normal form. 13/2307 useless extension candidates. Maximal degree in co-relation 23694. Up to 996 conditions per place. [2025-03-14 21:58:11,939 INFO L140 encePairwiseOnDemand]: 133/166 looper letters, 576 selfloop transitions, 125 changer transitions 161/964 dead transitions. [2025-03-14 21:58:11,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 964 transitions, 25343 flow [2025-03-14 21:58:11,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 21:58:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 21:58:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3103 transitions. [2025-03-14 21:58:11,942 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6445783132530121 [2025-03-14 21:58:11,942 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 362 predicate places. [2025-03-14 21:58:11,942 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 964 transitions, 25343 flow [2025-03-14 21:58:11,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:11,943 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:11,943 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] [2025-03-14 21:58:11,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 21:58:11,943 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:11,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash 746244369, now seen corresponding path program 7 times [2025-03-14 21:58:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:11,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556724381] [2025-03-14 21:58:11,944 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 21:58:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:58:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:12,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556724381] [2025-03-14 21:58:12,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556724381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:12,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:12,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:58:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366624342] [2025-03-14 21:58:12,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:12,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:58:12,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:12,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:58:12,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:58:12,436 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:12,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 964 transitions, 25343 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:12,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:12,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:12,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:13,381 INFO L124 PetriNetUnfolderBase]: 1001/2642 cut-off events. [2025-03-14 21:58:13,381 INFO L125 PetriNetUnfolderBase]: For 35626/36531 co-relation queries the response was YES. [2025-03-14 21:58:13,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33229 conditions, 2642 events. 1001/2642 cut-off events. For 35626/36531 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 17101 event pairs, 50 based on Foata normal form. 8/2426 useless extension candidates. Maximal degree in co-relation 26843. Up to 1110 conditions per place. [2025-03-14 21:58:13,405 INFO L140 encePairwiseOnDemand]: 133/166 looper letters, 608 selfloop transitions, 157 changer transitions 161/1028 dead transitions. [2025-03-14 21:58:13,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 1028 transitions, 29075 flow [2025-03-14 21:58:13,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 21:58:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 21:58:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3219 transitions. [2025-03-14 21:58:13,408 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6463855421686747 [2025-03-14 21:58:13,408 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 391 predicate places. [2025-03-14 21:58:13,408 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 1028 transitions, 29075 flow [2025-03-14 21:58:13,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:13,409 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:13,409 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] [2025-03-14 21:58:13,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 21:58:13,409 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:13,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1387728321, now seen corresponding path program 8 times [2025-03-14 21:58:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:13,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682202472] [2025-03-14 21:58:13,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:58:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:13,420 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:58:13,421 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682202472] [2025-03-14 21:58:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682202472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:13,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:13,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:13,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473375031] [2025-03-14 21:58:13,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:13,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:13,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:13,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:13,788 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:13,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 1028 transitions, 29075 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:13,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:13,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:13,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:14,628 INFO L124 PetriNetUnfolderBase]: 1001/2637 cut-off events. [2025-03-14 21:58:14,628 INFO L125 PetriNetUnfolderBase]: For 38489/39540 co-relation queries the response was YES. [2025-03-14 21:58:14,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35367 conditions, 2637 events. 1001/2637 cut-off events. For 38489/39540 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 17068 event pairs, 50 based on Foata normal form. 13/2428 useless extension candidates. Maximal degree in co-relation 31684. Up to 1110 conditions per place. [2025-03-14 21:58:14,650 INFO L140 encePairwiseOnDemand]: 133/166 looper letters, 641 selfloop transitions, 122 changer transitions 165/1030 dead transitions. [2025-03-14 21:58:14,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 1030 transitions, 30919 flow [2025-03-14 21:58:14,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 21:58:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 21:58:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3107 transitions. [2025-03-14 21:58:14,652 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6454092230992937 [2025-03-14 21:58:14,653 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 419 predicate places. [2025-03-14 21:58:14,653 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 1030 transitions, 30919 flow [2025-03-14 21:58:14,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:14,653 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:14,653 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] [2025-03-14 21:58:14,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 21:58:14,654 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:14,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:14,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1258361103, now seen corresponding path program 9 times [2025-03-14 21:58:14,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:14,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889491107] [2025-03-14 21:58:14,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:58:14,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:14,665 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 21:58:14,665 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:14,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889491107] [2025-03-14 21:58:14,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889491107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:14,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:14,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:58:14,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045078952] [2025-03-14 21:58:14,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:14,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:58:14,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:14,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:58:14,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:58:14,988 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:14,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 1030 transitions, 30919 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:14,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:14,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:14,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:15,955 INFO L124 PetriNetUnfolderBase]: 1032/2706 cut-off events. [2025-03-14 21:58:15,956 INFO L125 PetriNetUnfolderBase]: For 43745/44952 co-relation queries the response was YES. [2025-03-14 21:58:15,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38513 conditions, 2706 events. 1032/2706 cut-off events. For 43745/44952 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 17691 event pairs, 50 based on Foata normal form. 10/2491 useless extension candidates. Maximal degree in co-relation 31325. Up to 1167 conditions per place. [2025-03-14 21:58:15,982 INFO L140 encePairwiseOnDemand]: 133/166 looper letters, 645 selfloop transitions, 153 changer transitions 165/1065 dead transitions. [2025-03-14 21:58:15,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 1065 transitions, 33965 flow [2025-03-14 21:58:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 21:58:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 21:58:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3322 transitions. [2025-03-14 21:58:15,984 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6455499417022931 [2025-03-14 21:58:15,984 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 449 predicate places. [2025-03-14 21:58:15,984 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 1065 transitions, 33965 flow [2025-03-14 21:58:15,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:15,985 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:15,985 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] [2025-03-14 21:58:15,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 21:58:15,986 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:15,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:15,986 INFO L85 PathProgramCache]: Analyzing trace with hash 434809047, now seen corresponding path program 10 times [2025-03-14 21:58:15,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:15,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174859657] [2025-03-14 21:58:15,986 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:58:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:15,998 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 21:58:15,998 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:16,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:16,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174859657] [2025-03-14 21:58:16,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174859657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:16,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:16,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 21:58:16,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013871545] [2025-03-14 21:58:16,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:16,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:58:16,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:16,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:58:16,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-14 21:58:16,185 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:58:16,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 1065 transitions, 33965 flow. Second operand has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:16,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:16,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:58:16,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:16,848 INFO L124 PetriNetUnfolderBase]: 1016/2685 cut-off events. [2025-03-14 21:58:16,848 INFO L125 PetriNetUnfolderBase]: For 46702/48067 co-relation queries the response was YES. [2025-03-14 21:58:16,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40144 conditions, 2685 events. 1016/2685 cut-off events. For 46702/48067 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 17521 event pairs, 50 based on Foata normal form. 13/2476 useless extension candidates. Maximal degree in co-relation 32743. Up to 1138 conditions per place. [2025-03-14 21:58:16,890 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 652 selfloop transitions, 101 changer transitions 175/1049 dead transitions. [2025-03-14 21:58:16,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 1049 transitions, 35163 flow [2025-03-14 21:58:16,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 21:58:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 21:58:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1843 transitions. [2025-03-14 21:58:16,897 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7930292598967298 [2025-03-14 21:58:16,901 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 462 predicate places. [2025-03-14 21:58:16,901 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 1049 transitions, 35163 flow [2025-03-14 21:58:16,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:16,902 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:16,902 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] [2025-03-14 21:58:16,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 21:58:16,902 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:16,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash -713791935, now seen corresponding path program 11 times [2025-03-14 21:58:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262920020] [2025-03-14 21:58:16,903 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:16,921 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:16,921 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:58:17,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262920020] [2025-03-14 21:58:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262920020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:58:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308880449] [2025-03-14 21:58:17,703 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:17,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:58:17,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:58:17,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:58:17,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 21:58:17,763 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:17,763 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:17,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-14 21:58:17,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:58:18,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-14 21:58:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:18,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:58:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308880449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:18,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:58:18,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [24] total 34 [2025-03-14 21:58:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133321168] [2025-03-14 21:58:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:18,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:18,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:18,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 21:58:18,259 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:18,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 1049 transitions, 35163 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:18,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:18,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:18,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:19,485 INFO L124 PetriNetUnfolderBase]: 1078/2810 cut-off events. [2025-03-14 21:58:19,485 INFO L125 PetriNetUnfolderBase]: For 53076/54626 co-relation queries the response was YES. [2025-03-14 21:58:19,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44659 conditions, 2810 events. 1078/2810 cut-off events. For 53076/54626 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 18562 event pairs, 50 based on Foata normal form. 31/2612 useless extension candidates. Maximal degree in co-relation 36585. Up to 1253 conditions per place. [2025-03-14 21:58:19,519 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 660 selfloop transitions, 179 changer transitions 175/1116 dead transitions. [2025-03-14 21:58:19,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 1116 transitions, 39711 flow [2025-03-14 21:58:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-14 21:58:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-14 21:58:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3868 transitions. [2025-03-14 21:58:19,521 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6472556894243642 [2025-03-14 21:58:19,522 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 497 predicate places. [2025-03-14 21:58:19,522 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 1116 transitions, 39711 flow [2025-03-14 21:58:19,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:19,522 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:19,522 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] [2025-03-14 21:58:19,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 21:58:19,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-14 21:58:19,723 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:19,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash 238672867, now seen corresponding path program 6 times [2025-03-14 21:58:19,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:19,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482050753] [2025-03-14 21:58:19,724 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 21:58:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:19,732 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 21:58:19,733 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:20,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:20,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482050753] [2025-03-14 21:58:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482050753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:20,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:20,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:20,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899460503] [2025-03-14 21:58:20,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:20,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:20,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:20,058 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:20,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 1116 transitions, 39711 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:20,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:20,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:20,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:21,042 INFO L124 PetriNetUnfolderBase]: 1081/2814 cut-off events. [2025-03-14 21:58:21,042 INFO L125 PetriNetUnfolderBase]: For 56959/58400 co-relation queries the response was YES. [2025-03-14 21:58:21,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47044 conditions, 2814 events. 1081/2814 cut-off events. For 56959/58400 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 18566 event pairs, 50 based on Foata normal form. 8/2593 useless extension candidates. Maximal degree in co-relation 38581. Up to 1253 conditions per place. [2025-03-14 21:58:21,074 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 721 selfloop transitions, 117 changer transitions 181/1121 dead transitions. [2025-03-14 21:58:21,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 1121 transitions, 41872 flow [2025-03-14 21:58:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 21:58:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 21:58:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3203 transitions. [2025-03-14 21:58:21,076 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6431726907630522 [2025-03-14 21:58:21,077 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 526 predicate places. [2025-03-14 21:58:21,077 INFO L471 AbstractCegarLoop]: Abstraction has has 688 places, 1121 transitions, 41872 flow [2025-03-14 21:58:21,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:21,077 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:21,077 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] [2025-03-14 21:58:21,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 21:58:21,077 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:21,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1790304587, now seen corresponding path program 7 times [2025-03-14 21:58:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608310321] [2025-03-14 21:58:21,078 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 21:58:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:58:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608310321] [2025-03-14 21:58:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608310321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:21,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:21,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897385704] [2025-03-14 21:58:21,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:21,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:21,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:21,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:21,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:21,460 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:21,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 1121 transitions, 41872 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:21,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:21,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:21,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:22,426 INFO L124 PetriNetUnfolderBase]: 1083/2828 cut-off events. [2025-03-14 21:58:22,426 INFO L125 PetriNetUnfolderBase]: For 61005/62546 co-relation queries the response was YES. [2025-03-14 21:58:22,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49417 conditions, 2828 events. 1083/2828 cut-off events. For 61005/62546 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 18786 event pairs, 50 based on Foata normal form. 6/2605 useless extension candidates. Maximal degree in co-relation 40561. Up to 1253 conditions per place. [2025-03-14 21:58:22,462 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 717 selfloop transitions, 119 changer transitions 186/1124 dead transitions. [2025-03-14 21:58:22,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 1124 transitions, 43977 flow [2025-03-14 21:58:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 21:58:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 21:58:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3095 transitions. [2025-03-14 21:58:22,464 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6429164935604487 [2025-03-14 21:58:22,464 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 554 predicate places. [2025-03-14 21:58:22,464 INFO L471 AbstractCegarLoop]: Abstraction has has 716 places, 1124 transitions, 43977 flow [2025-03-14 21:58:22,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:22,465 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:22,465 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] [2025-03-14 21:58:22,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 21:58:22,465 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:22,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash 16957581, now seen corresponding path program 8 times [2025-03-14 21:58:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:22,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783876243] [2025-03-14 21:58:22,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:58:22,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:22,475 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:58:22,475 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:22,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:22,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783876243] [2025-03-14 21:58:22,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783876243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:22,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:22,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:22,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653525557] [2025-03-14 21:58:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:22,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:22,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:22,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:22,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:22,835 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:22,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 1124 transitions, 43977 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:22,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:22,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:22,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:23,847 INFO L124 PetriNetUnfolderBase]: 1089/2851 cut-off events. [2025-03-14 21:58:23,847 INFO L125 PetriNetUnfolderBase]: For 68937/70686 co-relation queries the response was YES. [2025-03-14 21:58:23,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52027 conditions, 2851 events. 1089/2851 cut-off events. For 68937/70686 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 19029 event pairs, 50 based on Foata normal form. 10/2632 useless extension candidates. Maximal degree in co-relation 46375. Up to 1253 conditions per place. [2025-03-14 21:58:23,882 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 721 selfloop transitions, 111 changer transitions 199/1133 dead transitions. [2025-03-14 21:58:23,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 1133 transitions, 46376 flow [2025-03-14 21:58:23,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 21:58:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 21:58:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3405 transitions. [2025-03-14 21:58:23,884 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6410015060240963 [2025-03-14 21:58:23,885 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 585 predicate places. [2025-03-14 21:58:23,885 INFO L471 AbstractCegarLoop]: Abstraction has has 747 places, 1133 transitions, 46376 flow [2025-03-14 21:58:23,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:23,885 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:23,885 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] [2025-03-14 21:58:23,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 21:58:23,885 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:23,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash -53766579, now seen corresponding path program 9 times [2025-03-14 21:58:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:23,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121909848] [2025-03-14 21:58:23,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:58:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:23,893 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 21:58:23,893 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:24,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:24,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121909848] [2025-03-14 21:58:24,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121909848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:24,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:24,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:58:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903946988] [2025-03-14 21:58:24,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:24,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:58:24,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:24,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:58:24,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:58:24,249 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:24,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 1133 transitions, 46376 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:24,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:24,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:24,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:25,278 INFO L124 PetriNetUnfolderBase]: 1105/2893 cut-off events. [2025-03-14 21:58:25,278 INFO L125 PetriNetUnfolderBase]: For 74596/76439 co-relation queries the response was YES. [2025-03-14 21:58:25,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55028 conditions, 2893 events. 1105/2893 cut-off events. For 74596/76439 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 19376 event pairs, 50 based on Foata normal form. 13/2675 useless extension candidates. Maximal degree in co-relation 45320. Up to 1253 conditions per place. [2025-03-14 21:58:25,314 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 704 selfloop transitions, 149 changer transitions 199/1154 dead transitions. [2025-03-14 21:58:25,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 776 places, 1154 transitions, 49332 flow [2025-03-14 21:58:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 21:58:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 21:58:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3211 transitions. [2025-03-14 21:58:25,316 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6447791164658635 [2025-03-14 21:58:25,316 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 614 predicate places. [2025-03-14 21:58:25,316 INFO L471 AbstractCegarLoop]: Abstraction has has 776 places, 1154 transitions, 49332 flow [2025-03-14 21:58:25,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:25,317 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:25,317 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] [2025-03-14 21:58:25,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 21:58:25,317 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:25,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:25,318 INFO L85 PathProgramCache]: Analyzing trace with hash -380323979, now seen corresponding path program 10 times [2025-03-14 21:58:25,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:25,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554269262] [2025-03-14 21:58:25,318 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:58:25,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:25,330 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 21:58:25,331 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:25,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:25,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554269262] [2025-03-14 21:58:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554269262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:25,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:25,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 21:58:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171330716] [2025-03-14 21:58:25,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:25,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:58:25,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:25,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:58:25,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:58:25,536 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:58:25,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 776 places, 1154 transitions, 49332 flow. Second operand has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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 21:58:25,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:25,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:58:25,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:26,390 INFO L124 PetriNetUnfolderBase]: 1120/2926 cut-off events. [2025-03-14 21:58:26,391 INFO L125 PetriNetUnfolderBase]: For 79829/81568 co-relation queries the response was YES. [2025-03-14 21:58:26,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58002 conditions, 2926 events. 1120/2926 cut-off events. For 79829/81568 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 19656 event pairs, 50 based on Foata normal form. 13/2706 useless extension candidates. Maximal degree in co-relation 47979. Up to 1253 conditions per place. [2025-03-14 21:58:26,430 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 723 selfloop transitions, 130 changer transitions 199/1173 dead transitions. [2025-03-14 21:58:26,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 1173 transitions, 52234 flow [2025-03-14 21:58:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 21:58:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 21:58:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1741 transitions. [2025-03-14 21:58:26,431 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8067655236329935 [2025-03-14 21:58:26,432 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 626 predicate places. [2025-03-14 21:58:26,432 INFO L471 AbstractCegarLoop]: Abstraction has has 788 places, 1173 transitions, 52234 flow [2025-03-14 21:58:26,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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 21:58:26,432 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:26,435 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] [2025-03-14 21:58:26,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 21:58:26,435 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:26,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1786473187, now seen corresponding path program 11 times [2025-03-14 21:58:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:26,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629971989] [2025-03-14 21:58:26,436 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:26,446 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:26,447 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:58:27,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:27,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629971989] [2025-03-14 21:58:27,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629971989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:58:27,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442476455] [2025-03-14 21:58:27,121 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:27,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:58:27,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:58:27,123 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:58:27,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 21:58:27,179 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:27,179 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:27,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 21:58:27,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:58:27,433 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-14 21:58:27,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-14 21:58:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:27,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:58:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442476455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:27,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:58:27,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [24] total 29 [2025-03-14 21:58:27,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894249303] [2025-03-14 21:58:27,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:27,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:58:27,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:27,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:58:27,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-03-14 21:58:27,443 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:58:27,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 788 places, 1173 transitions, 52234 flow. Second operand has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:27,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:27,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:58:27,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:28,538 INFO L124 PetriNetUnfolderBase]: 1165/3040 cut-off events. [2025-03-14 21:58:28,538 INFO L125 PetriNetUnfolderBase]: For 86263/88118 co-relation queries the response was YES. [2025-03-14 21:58:28,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62573 conditions, 3040 events. 1165/3040 cut-off events. For 86263/88118 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 20721 event pairs, 47 based on Foata normal form. 13/2814 useless extension candidates. Maximal degree in co-relation 52235. Up to 1253 conditions per place. [2025-03-14 21:58:28,584 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 748 selfloop transitions, 205 changer transitions 199/1273 dead transitions. [2025-03-14 21:58:28,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 805 places, 1273 transitions, 59269 flow [2025-03-14 21:58:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 21:58:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 21:58:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2382 transitions. [2025-03-14 21:58:28,586 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7971887550200804 [2025-03-14 21:58:28,586 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 643 predicate places. [2025-03-14 21:58:28,586 INFO L471 AbstractCegarLoop]: Abstraction has has 805 places, 1273 transitions, 59269 flow [2025-03-14 21:58:28,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:28,586 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:28,586 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] [2025-03-14 21:58:28,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 21:58:28,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-14 21:58:28,787 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:28,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash 111850481, now seen corresponding path program 12 times [2025-03-14 21:58:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:28,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338788777] [2025-03-14 21:58:28,788 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 21:58:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:28,795 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 21:58:28,795 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:29,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:29,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338788777] [2025-03-14 21:58:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338788777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:29,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:29,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:29,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846047048] [2025-03-14 21:58:29,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:29,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:29,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:29,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:29,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:29,201 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:29,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 805 places, 1273 transitions, 59269 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:29,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:29,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:29,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:30,560 INFO L124 PetriNetUnfolderBase]: 1192/3072 cut-off events. [2025-03-14 21:58:30,561 INFO L125 PetriNetUnfolderBase]: For 90908/93045 co-relation queries the response was YES. [2025-03-14 21:58:30,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66208 conditions, 3072 events. 1192/3072 cut-off events. For 90908/93045 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 20816 event pairs, 47 based on Foata normal form. 15/2839 useless extension candidates. Maximal degree in co-relation 55515. Up to 1253 conditions per place. [2025-03-14 21:58:30,601 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 866 selfloop transitions, 134 changer transitions 215/1317 dead transitions. [2025-03-14 21:58:30,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 836 places, 1317 transitions, 63691 flow [2025-03-14 21:58:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 21:58:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 21:58:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3411 transitions. [2025-03-14 21:58:30,603 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6421310240963856 [2025-03-14 21:58:30,604 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 674 predicate places. [2025-03-14 21:58:30,604 INFO L471 AbstractCegarLoop]: Abstraction has has 836 places, 1317 transitions, 63691 flow [2025-03-14 21:58:30,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:30,604 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:30,605 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] [2025-03-14 21:58:30,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 21:58:30,605 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:30,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2057450965, now seen corresponding path program 13 times [2025-03-14 21:58:30,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:30,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079334236] [2025-03-14 21:58:30,606 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 21:58:30,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:58:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079334236] [2025-03-14 21:58:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079334236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:30,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:30,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339962913] [2025-03-14 21:58:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:30,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:30,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:30,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:30,997 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:30,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 836 places, 1317 transitions, 63691 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:30,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:30,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:30,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:32,344 INFO L124 PetriNetUnfolderBase]: 1188/3087 cut-off events. [2025-03-14 21:58:32,345 INFO L125 PetriNetUnfolderBase]: For 98137/100211 co-relation queries the response was YES. [2025-03-14 21:58:32,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68610 conditions, 3087 events. 1188/3087 cut-off events. For 98137/100211 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 21032 event pairs, 47 based on Foata normal form. 13/2856 useless extension candidates. Maximal degree in co-relation 57562. Up to 1253 conditions per place. [2025-03-14 21:58:32,395 INFO L140 encePairwiseOnDemand]: 133/166 looper letters, 859 selfloop transitions, 135 changer transitions 218/1314 dead transitions. [2025-03-14 21:58:32,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 864 places, 1314 transitions, 65907 flow [2025-03-14 21:58:32,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 21:58:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 21:58:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3100 transitions. [2025-03-14 21:58:32,398 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6439551308683008 [2025-03-14 21:58:32,398 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 702 predicate places. [2025-03-14 21:58:32,398 INFO L471 AbstractCegarLoop]: Abstraction has has 864 places, 1314 transitions, 65907 flow [2025-03-14 21:58:32,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:32,399 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:32,399 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] [2025-03-14 21:58:32,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-14 21:58:32,399 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:32,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:32,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1037012751, now seen corresponding path program 14 times [2025-03-14 21:58:32,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:32,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965113355] [2025-03-14 21:58:32,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:58:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:32,413 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:58:32,414 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:32,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:32,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965113355] [2025-03-14 21:58:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965113355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:32,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:32,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:32,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078904064] [2025-03-14 21:58:32,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:32,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:32,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:32,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:32,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:32,830 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:32,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 864 places, 1314 transitions, 65907 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:32,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:32,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:32,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:34,085 INFO L124 PetriNetUnfolderBase]: 1186/3078 cut-off events. [2025-03-14 21:58:34,086 INFO L125 PetriNetUnfolderBase]: For 99700/102042 co-relation queries the response was YES. [2025-03-14 21:58:34,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71013 conditions, 3078 events. 1186/3078 cut-off events. For 99700/102042 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 20943 event pairs, 71 based on Foata normal form. 8/2844 useless extension candidates. Maximal degree in co-relation 59606. Up to 1254 conditions per place. [2025-03-14 21:58:34,132 INFO L140 encePairwiseOnDemand]: 133/166 looper letters, 844 selfloop transitions, 146 changer transitions 218/1310 dead transitions. [2025-03-14 21:58:34,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 891 places, 1310 transitions, 68075 flow [2025-03-14 21:58:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 21:58:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 21:58:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2996 transitions. [2025-03-14 21:58:34,133 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6445783132530121 [2025-03-14 21:58:34,134 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 729 predicate places. [2025-03-14 21:58:34,134 INFO L471 AbstractCegarLoop]: Abstraction has has 891 places, 1310 transitions, 68075 flow [2025-03-14 21:58:34,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:34,134 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:34,134 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] [2025-03-14 21:58:34,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-14 21:58:34,134 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:34,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:34,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1784247561, now seen corresponding path program 15 times [2025-03-14 21:58:34,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:34,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134822410] [2025-03-14 21:58:34,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:58:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:34,143 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 21:58:34,143 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:34,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:34,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134822410] [2025-03-14 21:58:34,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134822410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:34,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:34,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:58:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453850397] [2025-03-14 21:58:34,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:34,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:58:34,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:34,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:58:34,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:58:34,511 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:34,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 1310 transitions, 68075 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:34,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:34,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:34,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:35,852 INFO L124 PetriNetUnfolderBase]: 1214/3128 cut-off events. [2025-03-14 21:58:35,852 INFO L125 PetriNetUnfolderBase]: For 111508/114206 co-relation queries the response was YES. [2025-03-14 21:58:35,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75087 conditions, 3128 events. 1214/3128 cut-off events. For 111508/114206 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 21356 event pairs, 47 based on Foata normal form. 8/2890 useless extension candidates. Maximal degree in co-relation 63081. Up to 1310 conditions per place. [2025-03-14 21:58:35,902 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 866 selfloop transitions, 156 changer transitions 218/1342 dead transitions. [2025-03-14 21:58:35,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 1342 transitions, 72343 flow [2025-03-14 21:58:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 21:58:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 21:58:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3110 transitions. [2025-03-14 21:58:35,904 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.646032405484005 [2025-03-14 21:58:35,904 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 757 predicate places. [2025-03-14 21:58:35,905 INFO L471 AbstractCegarLoop]: Abstraction has has 919 places, 1342 transitions, 72343 flow [2025-03-14 21:58:35,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:35,905 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:35,905 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] [2025-03-14 21:58:35,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-14 21:58:35,905 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:35,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:35,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2002109525, now seen corresponding path program 16 times [2025-03-14 21:58:35,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:35,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678583546] [2025-03-14 21:58:35,906 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:58:35,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:35,940 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 21:58:35,941 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678583546] [2025-03-14 21:58:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678583546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:36,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:36,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 21:58:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162475629] [2025-03-14 21:58:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:36,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:58:36,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:36,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:58:36,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-14 21:58:36,147 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:58:36,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 1342 transitions, 72343 flow. Second operand has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:36,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:36,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:58:36,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:37,207 INFO L124 PetriNetUnfolderBase]: 1216/3152 cut-off events. [2025-03-14 21:58:37,207 INFO L125 PetriNetUnfolderBase]: For 121068/123964 co-relation queries the response was YES. [2025-03-14 21:58:37,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77738 conditions, 3152 events. 1216/3152 cut-off events. For 121068/123964 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 21641 event pairs, 47 based on Foata normal form. 11/2917 useless extension candidates. Maximal degree in co-relation 65409. Up to 1310 conditions per place. [2025-03-14 21:58:37,258 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 894 selfloop transitions, 104 changer transitions 227/1346 dead transitions. [2025-03-14 21:58:37,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 1346 transitions, 74933 flow [2025-03-14 21:58:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 21:58:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 21:58:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1972 transitions. [2025-03-14 21:58:37,259 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7919678714859437 [2025-03-14 21:58:37,259 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 771 predicate places. [2025-03-14 21:58:37,259 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 1346 transitions, 74933 flow [2025-03-14 21:58:37,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:37,260 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:37,260 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] [2025-03-14 21:58:37,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-14 21:58:37,260 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:37,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:37,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1499978831, now seen corresponding path program 17 times [2025-03-14 21:58:37,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:37,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364351316] [2025-03-14 21:58:37,261 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:37,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:37,270 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:37,270 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:58:37,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:37,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364351316] [2025-03-14 21:58:37,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364351316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:58:37,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969776342] [2025-03-14 21:58:37,736 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:37,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:58:37,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:58:37,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:58:37,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 21:58:37,796 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:37,796 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:37,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 21:58:37,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:58:38,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 21:58:38,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-03-14 21:58:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:38,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:58:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969776342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:38,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:58:38,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 26 [2025-03-14 21:58:38,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135193308] [2025-03-14 21:58:38,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:38,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:58:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:38,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:58:38,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-14 21:58:38,052 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:58:38,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 1346 transitions, 74933 flow. Second operand has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:38,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:38,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:58:38,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:39,342 INFO L124 PetriNetUnfolderBase]: 1263/3241 cut-off events. [2025-03-14 21:58:39,342 INFO L125 PetriNetUnfolderBase]: For 131350/134402 co-relation queries the response was YES. [2025-03-14 21:58:39,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82952 conditions, 3241 events. 1263/3241 cut-off events. For 131350/134402 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 22332 event pairs, 47 based on Foata normal form. 38/3025 useless extension candidates. Maximal degree in co-relation 70036. Up to 1368 conditions per place. [2025-03-14 21:58:39,408 INFO L140 encePairwiseOnDemand]: 150/166 looper letters, 846 selfloop transitions, 210 changer transitions 231/1408 dead transitions. [2025-03-14 21:58:39,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 946 places, 1408 transitions, 81123 flow [2025-03-14 21:58:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 21:58:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 21:58:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1881 transitions. [2025-03-14 21:58:39,410 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8093803786574871 [2025-03-14 21:58:39,410 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 784 predicate places. [2025-03-14 21:58:39,410 INFO L471 AbstractCegarLoop]: Abstraction has has 946 places, 1408 transitions, 81123 flow [2025-03-14 21:58:39,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:39,410 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:39,410 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] [2025-03-14 21:58:39,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 21:58:39,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:58:39,611 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:39,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash -593590635, now seen corresponding path program 18 times [2025-03-14 21:58:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:39,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262046863] [2025-03-14 21:58:39,612 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 21:58:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:39,620 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 21:58:39,620 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:39,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:39,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262046863] [2025-03-14 21:58:39,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262046863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:39,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:39,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:39,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923416258] [2025-03-14 21:58:39,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:39,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:39,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:39,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:39,980 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:39,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 946 places, 1408 transitions, 81123 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:39,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:39,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:39,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:41,394 INFO L124 PetriNetUnfolderBase]: 1264/3252 cut-off events. [2025-03-14 21:58:41,394 INFO L125 PetriNetUnfolderBase]: For 133086/135890 co-relation queries the response was YES. [2025-03-14 21:58:41,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85764 conditions, 3252 events. 1264/3252 cut-off events. For 133086/135890 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 22532 event pairs, 47 based on Foata normal form. 13/3013 useless extension candidates. Maximal degree in co-relation 79673. Up to 1368 conditions per place. [2025-03-14 21:58:41,448 INFO L140 encePairwiseOnDemand]: 133/166 looper letters, 935 selfloop transitions, 140 changer transitions 235/1412 dead transitions. [2025-03-14 21:58:41,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 1412 transitions, 83911 flow [2025-03-14 21:58:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 21:58:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 21:58:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3100 transitions. [2025-03-14 21:58:41,450 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6439551308683008 [2025-03-14 21:58:41,450 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 812 predicate places. [2025-03-14 21:58:41,450 INFO L471 AbstractCegarLoop]: Abstraction has has 974 places, 1412 transitions, 83911 flow [2025-03-14 21:58:41,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:41,451 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:41,451 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] [2025-03-14 21:58:41,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-14 21:58:41,451 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:41,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1237905081, now seen corresponding path program 19 times [2025-03-14 21:58:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:41,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741192952] [2025-03-14 21:58:41,452 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 21:58:41,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:58:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:41,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:41,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741192952] [2025-03-14 21:58:41,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741192952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:41,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:41,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248755303] [2025-03-14 21:58:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:41,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:41,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:41,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:41,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:41,765 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:41,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 974 places, 1412 transitions, 83911 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:41,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:41,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:41,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:43,194 INFO L124 PetriNetUnfolderBase]: 1240/3196 cut-off events. [2025-03-14 21:58:43,194 INFO L125 PetriNetUnfolderBase]: For 140366/143329 co-relation queries the response was YES. [2025-03-14 21:58:43,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86937 conditions, 3196 events. 1240/3196 cut-off events. For 140366/143329 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 22033 event pairs, 47 based on Foata normal form. 15/2965 useless extension candidates. Maximal degree in co-relation 80683. Up to 1339 conditions per place. [2025-03-14 21:58:43,252 INFO L140 encePairwiseOnDemand]: 133/166 looper letters, 915 selfloop transitions, 128 changer transitions 238/1383 dead transitions. [2025-03-14 21:58:43,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1383 transitions, 84559 flow [2025-03-14 21:58:43,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 21:58:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 21:58:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3204 transitions. [2025-03-14 21:58:43,254 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6433734939759036 [2025-03-14 21:58:43,254 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 841 predicate places. [2025-03-14 21:58:43,254 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 1383 transitions, 84559 flow [2025-03-14 21:58:43,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:43,255 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:43,255 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] [2025-03-14 21:58:43,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-14 21:58:43,255 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:43,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:43,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1956416145, now seen corresponding path program 20 times [2025-03-14 21:58:43,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:43,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186596773] [2025-03-14 21:58:43,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:58:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:43,265 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:58:43,265 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:43,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:43,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186596773] [2025-03-14 21:58:43,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186596773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:43,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:43,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:43,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39298135] [2025-03-14 21:58:43,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:43,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:43,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:43,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:43,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:43,553 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:43,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 1383 transitions, 84559 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:43,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:43,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:43,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:45,002 INFO L124 PetriNetUnfolderBase]: 1244/3216 cut-off events. [2025-03-14 21:58:45,002 INFO L125 PetriNetUnfolderBase]: For 143173/146412 co-relation queries the response was YES. [2025-03-14 21:58:45,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89801 conditions, 3216 events. 1244/3216 cut-off events. For 143173/146412 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 22206 event pairs, 71 based on Foata normal form. 8/2978 useless extension candidates. Maximal degree in co-relation 75912. Up to 1340 conditions per place. [2025-03-14 21:58:45,060 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 887 selfloop transitions, 162 changer transitions 238/1389 dead transitions. [2025-03-14 21:58:45,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 1389 transitions, 87457 flow [2025-03-14 21:58:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 21:58:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 21:58:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3305 transitions. [2025-03-14 21:58:45,062 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6422464049747376 [2025-03-14 21:58:45,062 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 871 predicate places. [2025-03-14 21:58:45,062 INFO L471 AbstractCegarLoop]: Abstraction has has 1033 places, 1389 transitions, 87457 flow [2025-03-14 21:58:45,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:45,062 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:45,063 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] [2025-03-14 21:58:45,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-14 21:58:45,063 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1067245269, now seen corresponding path program 21 times [2025-03-14 21:58:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:45,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081956868] [2025-03-14 21:58:45,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:58:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:45,070 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 21:58:45,070 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:45,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:45,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081956868] [2025-03-14 21:58:45,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081956868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:45,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:45,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:58:45,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846030888] [2025-03-14 21:58:45,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:45,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:58:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:45,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:58:45,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:58:45,379 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:45,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 1389 transitions, 87457 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:45,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:45,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:45,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:46,950 INFO L124 PetriNetUnfolderBase]: 1258/3241 cut-off events. [2025-03-14 21:58:46,951 INFO L125 PetriNetUnfolderBase]: For 154884/157831 co-relation queries the response was YES. [2025-03-14 21:58:46,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93364 conditions, 3241 events. 1258/3241 cut-off events. For 154884/157831 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 22455 event pairs, 47 based on Foata normal form. 18/3011 useless extension candidates. Maximal degree in co-relation 86784. Up to 1368 conditions per place. [2025-03-14 21:58:47,014 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 895 selfloop transitions, 184 changer transitions 238/1419 dead transitions. [2025-03-14 21:58:47,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1066 places, 1419 transitions, 92135 flow [2025-03-14 21:58:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 21:58:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 21:58:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3653 transitions. [2025-03-14 21:58:47,016 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6472360028348689 [2025-03-14 21:58:47,016 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 904 predicate places. [2025-03-14 21:58:47,016 INFO L471 AbstractCegarLoop]: Abstraction has has 1066 places, 1419 transitions, 92135 flow [2025-03-14 21:58:47,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:47,017 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:47,017 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] [2025-03-14 21:58:47,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-14 21:58:47,017 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:47,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash -548119085, now seen corresponding path program 22 times [2025-03-14 21:58:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:47,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610956110] [2025-03-14 21:58:47,018 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:58:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:47,026 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 21:58:47,027 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:47,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:47,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610956110] [2025-03-14 21:58:47,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610956110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:47,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:47,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 21:58:47,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409801853] [2025-03-14 21:58:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:47,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:58:47,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:47,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:58:47,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-14 21:58:47,191 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:58:47,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1066 places, 1419 transitions, 92135 flow. Second operand has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:47,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:47,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:58:47,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:48,476 INFO L124 PetriNetUnfolderBase]: 1246/3241 cut-off events. [2025-03-14 21:58:48,476 INFO L125 PetriNetUnfolderBase]: For 167498/170881 co-relation queries the response was YES. [2025-03-14 21:58:48,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95165 conditions, 3241 events. 1246/3241 cut-off events. For 167498/170881 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 22575 event pairs, 59 based on Foata normal form. 8/3004 useless extension candidates. Maximal degree in co-relation 80430. Up to 1365 conditions per place. [2025-03-14 21:58:48,531 INFO L140 encePairwiseOnDemand]: 150/166 looper letters, 908 selfloop transitions, 139 changer transitions 238/1406 dead transitions. [2025-03-14 21:58:48,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1077 places, 1406 transitions, 93739 flow [2025-03-14 21:58:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 21:58:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 21:58:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1600 transitions. [2025-03-14 21:58:48,532 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8032128514056225 [2025-03-14 21:58:48,533 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 915 predicate places. [2025-03-14 21:58:48,533 INFO L471 AbstractCegarLoop]: Abstraction has has 1077 places, 1406 transitions, 93739 flow [2025-03-14 21:58:48,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:48,533 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:48,533 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] [2025-03-14 21:58:48,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-14 21:58:48,533 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1241417967, now seen corresponding path program 23 times [2025-03-14 21:58:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038592465] [2025-03-14 21:58:48,534 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:48,542 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:48,542 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:58:48,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:48,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038592465] [2025-03-14 21:58:48,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038592465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:58:48,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467436188] [2025-03-14 21:58:48,927 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:58:48,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:58:48,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:58:48,929 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:58:48,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 21:58:48,986 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:58:48,986 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:48,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-14 21:58:48,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:58:49,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 21:58:49,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 21:58:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:49,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:58:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467436188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:49,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:58:49,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 24 [2025-03-14 21:58:49,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150644247] [2025-03-14 21:58:49,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:49,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:49,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:49,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-03-14 21:58:49,287 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:49,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1077 places, 1406 transitions, 93739 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:49,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:49,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:49,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:50,815 INFO L124 PetriNetUnfolderBase]: 1204/3111 cut-off events. [2025-03-14 21:58:50,815 INFO L125 PetriNetUnfolderBase]: For 167505/170700 co-relation queries the response was YES. [2025-03-14 21:58:50,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94464 conditions, 3111 events. 1204/3111 cut-off events. For 167505/170700 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 21236 event pairs, 47 based on Foata normal form. 36/2926 useless extension candidates. Maximal degree in co-relation 80026. Up to 1277 conditions per place. [2025-03-14 21:58:50,876 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 832 selfloop transitions, 224 changer transitions 238/1396 dead transitions. [2025-03-14 21:58:50,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1107 places, 1396 transitions, 95521 flow [2025-03-14 21:58:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 21:58:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 21:58:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3322 transitions. [2025-03-14 21:58:50,878 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6455499417022931 [2025-03-14 21:58:50,878 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 945 predicate places. [2025-03-14 21:58:50,878 INFO L471 AbstractCegarLoop]: Abstraction has has 1107 places, 1396 transitions, 95521 flow [2025-03-14 21:58:50,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:50,879 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:50,879 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] [2025-03-14 21:58:50,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-14 21:58:51,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-03-14 21:58:51,079 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:51,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash -717854967, now seen corresponding path program 12 times [2025-03-14 21:58:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:51,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65995961] [2025-03-14 21:58:51,080 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 21:58:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:51,088 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 21:58:51,088 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:51,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65995961] [2025-03-14 21:58:51,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65995961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:51,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:51,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:58:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490184851] [2025-03-14 21:58:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:51,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:58:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:51,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:58:51,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:58:51,384 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:51,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1107 places, 1396 transitions, 95521 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:51,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:51,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:51,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:52,873 INFO L124 PetriNetUnfolderBase]: 1220/3128 cut-off events. [2025-03-14 21:58:52,873 INFO L125 PetriNetUnfolderBase]: For 169220/172605 co-relation queries the response was YES. [2025-03-14 21:58:52,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98152 conditions, 3128 events. 1220/3128 cut-off events. For 169220/172605 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 21332 event pairs, 47 based on Foata normal form. 13/2918 useless extension candidates. Maximal degree in co-relation 91323. Up to 1277 conditions per place. [2025-03-14 21:58:52,935 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 874 selfloop transitions, 203 changer transitions 238/1417 dead transitions. [2025-03-14 21:58:52,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1136 places, 1417 transitions, 99633 flow [2025-03-14 21:58:52,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 21:58:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 21:58:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3207 transitions. [2025-03-14 21:58:52,937 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6439759036144578 [2025-03-14 21:58:52,937 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 974 predicate places. [2025-03-14 21:58:52,937 INFO L471 AbstractCegarLoop]: Abstraction has has 1136 places, 1417 transitions, 99633 flow [2025-03-14 21:58:52,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:52,938 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:52,938 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] [2025-03-14 21:58:52,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-14 21:58:52,938 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:52,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash -190652609, now seen corresponding path program 13 times [2025-03-14 21:58:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206927038] [2025-03-14 21:58:52,939 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 21:58:52,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:58:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:53,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206927038] [2025-03-14 21:58:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206927038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:53,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:58:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453000114] [2025-03-14 21:58:53,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:53,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:58:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:53,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:58:53,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:58:53,249 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:53,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1136 places, 1417 transitions, 99633 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:53,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:53,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:53,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:54,719 INFO L124 PetriNetUnfolderBase]: 1222/3149 cut-off events. [2025-03-14 21:58:54,719 INFO L125 PetriNetUnfolderBase]: For 183602/186665 co-relation queries the response was YES. [2025-03-14 21:58:54,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100906 conditions, 3149 events. 1222/3149 cut-off events. For 183602/186665 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 21644 event pairs, 47 based on Foata normal form. 8/2934 useless extension candidates. Maximal degree in co-relation 93918. Up to 1277 conditions per place. [2025-03-14 21:58:54,784 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 953 selfloop transitions, 122 changer transitions 243/1420 dead transitions. [2025-03-14 21:58:54,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1163 places, 1420 transitions, 102438 flow [2025-03-14 21:58:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 21:58:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 21:58:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2989 transitions. [2025-03-14 21:58:54,786 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6430722891566265 [2025-03-14 21:58:54,786 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1001 predicate places. [2025-03-14 21:58:54,786 INFO L471 AbstractCegarLoop]: Abstraction has has 1163 places, 1420 transitions, 102438 flow [2025-03-14 21:58:54,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:58:54,787 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:54,787 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] [2025-03-14 21:58:54,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-14 21:58:54,787 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:54,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash 762302215, now seen corresponding path program 14 times [2025-03-14 21:58:54,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:54,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963665306] [2025-03-14 21:58:54,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:58:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:54,798 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:58:54,798 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:55,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:55,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963665306] [2025-03-14 21:58:55,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963665306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:55,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:55,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:58:55,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459012421] [2025-03-14 21:58:55,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:55,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:58:55,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:55,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:58:55,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:58:55,099 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:55,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1163 places, 1420 transitions, 102438 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:55,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:55,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:55,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:56,729 INFO L124 PetriNetUnfolderBase]: 1243/3182 cut-off events. [2025-03-14 21:58:56,729 INFO L125 PetriNetUnfolderBase]: For 193973/197749 co-relation queries the response was YES. [2025-03-14 21:58:56,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105109 conditions, 3182 events. 1243/3182 cut-off events. For 193973/197749 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 21823 event pairs, 84 based on Foata normal form. 13/2968 useless extension candidates. Maximal degree in co-relation 96121. Up to 1277 conditions per place. [2025-03-14 21:58:56,798 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 891 selfloop transitions, 211 changer transitions 243/1447 dead transitions. [2025-03-14 21:58:56,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1195 places, 1447 transitions, 107178 flow [2025-03-14 21:58:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-14 21:58:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-14 21:58:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3520 transitions. [2025-03-14 21:58:56,799 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.642570281124498 [2025-03-14 21:58:56,800 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1033 predicate places. [2025-03-14 21:58:56,800 INFO L471 AbstractCegarLoop]: Abstraction has has 1195 places, 1447 transitions, 107178 flow [2025-03-14 21:58:56,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:56,800 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:56,800 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] [2025-03-14 21:58:56,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-14 21:58:56,800 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:56,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:56,801 INFO L85 PathProgramCache]: Analyzing trace with hash -532198099, now seen corresponding path program 15 times [2025-03-14 21:58:56,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:56,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878072503] [2025-03-14 21:58:56,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:58:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:56,811 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 21:58:56,811 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:57,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878072503] [2025-03-14 21:58:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878072503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:57,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:57,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:58:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572768487] [2025-03-14 21:58:57,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:57,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:58:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:57,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:58:57,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:58:57,106 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:58:57,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1195 places, 1447 transitions, 107178 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:57,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:57,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:58:57,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:58:58,850 INFO L124 PetriNetUnfolderBase]: 1279/3266 cut-off events. [2025-03-14 21:58:58,850 INFO L125 PetriNetUnfolderBase]: For 199700/203130 co-relation queries the response was YES. [2025-03-14 21:58:58,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110659 conditions, 3266 events. 1279/3266 cut-off events. For 199700/203130 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 22611 event pairs, 47 based on Foata normal form. 11/3046 useless extension candidates. Maximal degree in co-relation 103353. Up to 1277 conditions per place. [2025-03-14 21:58:58,921 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 930 selfloop transitions, 217 changer transitions 243/1492 dead transitions. [2025-03-14 21:58:58,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1229 places, 1492 transitions, 113518 flow [2025-03-14 21:58:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 21:58:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 21:58:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3748 transitions. [2025-03-14 21:58:58,923 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6450946643717728 [2025-03-14 21:58:58,923 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1067 predicate places. [2025-03-14 21:58:58,923 INFO L471 AbstractCegarLoop]: Abstraction has has 1229 places, 1492 transitions, 113518 flow [2025-03-14 21:58:58,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:58:58,923 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:58:58,923 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] [2025-03-14 21:58:58,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-14 21:58:58,923 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:58:58,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:58:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1565916621, now seen corresponding path program 16 times [2025-03-14 21:58:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:58:58,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892530874] [2025-03-14 21:58:58,924 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:58:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:58:58,932 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 21:58:58,932 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:58:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:58:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:58:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892530874] [2025-03-14 21:58:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892530874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:58:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:58:59,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 21:58:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578479007] [2025-03-14 21:58:59,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:58:59,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:58:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:58:59,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:58:59,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-14 21:58:59,094 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:58:59,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1229 places, 1492 transitions, 113518 flow. Second operand has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:58:59,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:58:59,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:58:59,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:00,538 INFO L124 PetriNetUnfolderBase]: 1282/3284 cut-off events. [2025-03-14 21:59:00,538 INFO L125 PetriNetUnfolderBase]: For 214871/218453 co-relation queries the response was YES. [2025-03-14 21:59:00,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113582 conditions, 3284 events. 1282/3284 cut-off events. For 214871/218453 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 22828 event pairs, 47 based on Foata normal form. 8/3061 useless extension candidates. Maximal degree in co-relation 97233. Up to 1277 conditions per place. [2025-03-14 21:59:00,610 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 1017 selfloop transitions, 110 changer transitions 249/1497 dead transitions. [2025-03-14 21:59:00,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1240 places, 1497 transitions, 116601 flow [2025-03-14 21:59:00,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 21:59:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 21:59:00,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1595 transitions. [2025-03-14 21:59:00,611 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8007028112449799 [2025-03-14 21:59:00,612 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1078 predicate places. [2025-03-14 21:59:00,612 INFO L471 AbstractCegarLoop]: Abstraction has has 1240 places, 1497 transitions, 116601 flow [2025-03-14 21:59:00,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 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 21:59:00,612 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:00,612 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] [2025-03-14 21:59:00,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-14 21:59:00,612 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:00,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash -298381331, now seen corresponding path program 17 times [2025-03-14 21:59:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527556511] [2025-03-14 21:59:00,613 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:59:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:00,621 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:59:00,621 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:59:01,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:01,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527556511] [2025-03-14 21:59:01,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527556511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:59:01,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589663929] [2025-03-14 21:59:01,028 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:59:01,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:59:01,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:59:01,030 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:59:01,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 21:59:01,088 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:59:01,088 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:01,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-14 21:59:01,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:59:01,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 21:59:01,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 21:59:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:01,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:59:01,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589663929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:01,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:59:01,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 24 [2025-03-14 21:59:01,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446454155] [2025-03-14 21:59:01,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:01,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:59:01,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:01,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:59:01,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-03-14 21:59:01,412 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:59:01,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1240 places, 1497 transitions, 116601 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:59:01,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:01,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:59:01,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:03,175 INFO L124 PetriNetUnfolderBase]: 1298/3324 cut-off events. [2025-03-14 21:59:03,175 INFO L125 PetriNetUnfolderBase]: For 223324/227014 co-relation queries the response was YES. [2025-03-14 21:59:03,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117611 conditions, 3324 events. 1298/3324 cut-off events. For 223324/227014 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23171 event pairs, 47 based on Foata normal form. 11/3102 useless extension candidates. Maximal degree in co-relation 110027. Up to 1277 conditions per place. [2025-03-14 21:59:03,251 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 891 selfloop transitions, 276 changer transitions 249/1518 dead transitions. [2025-03-14 21:59:03,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1271 places, 1518 transitions, 121125 flow [2025-03-14 21:59:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 21:59:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 21:59:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3429 transitions. [2025-03-14 21:59:03,253 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.645519578313253 [2025-03-14 21:59:03,253 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1109 predicate places. [2025-03-14 21:59:03,253 INFO L471 AbstractCegarLoop]: Abstraction has has 1271 places, 1518 transitions, 121125 flow [2025-03-14 21:59:03,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:59:03,254 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:03,254 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] [2025-03-14 21:59:03,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-14 21:59:03,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-14 21:59:03,454 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:03,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash 222137933, now seen corresponding path program 18 times [2025-03-14 21:59:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:03,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269127020] [2025-03-14 21:59:03,456 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 21:59:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:03,464 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 21:59:03,464 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:03,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:03,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269127020] [2025-03-14 21:59:03,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269127020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:59:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:59:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196079489] [2025-03-14 21:59:03,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:03,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:59:03,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:03,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:59:03,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:59:03,796 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:59:03,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1271 places, 1518 transitions, 121125 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:59:03,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:03,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:59:03,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:05,475 INFO L124 PetriNetUnfolderBase]: 1313/3354 cut-off events. [2025-03-14 21:59:05,475 INFO L125 PetriNetUnfolderBase]: For 230534/234331 co-relation queries the response was YES. [2025-03-14 21:59:05,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121612 conditions, 3354 events. 1313/3354 cut-off events. For 230534/234331 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 23411 event pairs, 47 based on Foata normal form. 9/3128 useless extension candidates. Maximal degree in co-relation 104545. Up to 1277 conditions per place. [2025-03-14 21:59:05,554 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 962 selfloop transitions, 224 changer transitions 249/1537 dead transitions. [2025-03-14 21:59:05,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1300 places, 1537 transitions, 125565 flow [2025-03-14 21:59:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 21:59:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 21:59:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3207 transitions. [2025-03-14 21:59:05,555 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6439759036144578 [2025-03-14 21:59:05,556 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1138 predicate places. [2025-03-14 21:59:05,556 INFO L471 AbstractCegarLoop]: Abstraction has has 1300 places, 1537 transitions, 125565 flow [2025-03-14 21:59:05,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:59:05,556 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:05,556 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] [2025-03-14 21:59:05,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-14 21:59:05,556 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:05,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash -838695171, now seen corresponding path program 19 times [2025-03-14 21:59:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780629858] [2025-03-14 21:59:05,557 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 21:59:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:59:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:05,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:05,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780629858] [2025-03-14 21:59:05,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780629858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:05,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:59:05,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:59:05,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53467768] [2025-03-14 21:59:05,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:05,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:59:05,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:05,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:59:05,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:59:05,906 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:59:05,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1300 places, 1537 transitions, 125565 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:59:05,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:05,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:59:05,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:07,823 INFO L124 PetriNetUnfolderBase]: 1315/3355 cut-off events. [2025-03-14 21:59:07,823 INFO L125 PetriNetUnfolderBase]: For 241716/245881 co-relation queries the response was YES. [2025-03-14 21:59:07,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124564 conditions, 3355 events. 1315/3355 cut-off events. For 241716/245881 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 23396 event pairs, 47 based on Foata normal form. 6/3126 useless extension candidates. Maximal degree in co-relation 107044. Up to 1277 conditions per place. [2025-03-14 21:59:07,891 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 1053 selfloop transitions, 126 changer transitions 259/1540 dead transitions. [2025-03-14 21:59:07,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1330 places, 1540 transitions, 128646 flow [2025-03-14 21:59:07,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 21:59:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 21:59:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3295 transitions. [2025-03-14 21:59:07,893 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6403031480761757 [2025-03-14 21:59:07,893 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1168 predicate places. [2025-03-14 21:59:07,893 INFO L471 AbstractCegarLoop]: Abstraction has has 1330 places, 1540 transitions, 128646 flow [2025-03-14 21:59:07,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:59:07,893 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:07,893 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] [2025-03-14 21:59:07,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-14 21:59:07,894 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:07,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:07,894 INFO L85 PathProgramCache]: Analyzing trace with hash 228821027, now seen corresponding path program 20 times [2025-03-14 21:59:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:07,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010360089] [2025-03-14 21:59:07,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:59:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:07,901 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:59:07,901 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:08,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:08,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010360089] [2025-03-14 21:59:08,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010360089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:08,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:59:08,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 21:59:08,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92623665] [2025-03-14 21:59:08,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:08,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 21:59:08,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:08,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 21:59:08,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 21:59:08,182 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:59:08,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1330 places, 1540 transitions, 128646 flow. Second operand has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:59:08,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:08,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:59:08,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:10,058 INFO L124 PetriNetUnfolderBase]: 1310/3351 cut-off events. [2025-03-14 21:59:10,058 INFO L125 PetriNetUnfolderBase]: For 256331/260632 co-relation queries the response was YES. [2025-03-14 21:59:10,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126946 conditions, 3351 events. 1310/3351 cut-off events. For 256331/260632 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 23410 event pairs, 47 based on Foata normal form. 7/3126 useless extension candidates. Maximal degree in co-relation 109205. Up to 1277 conditions per place. [2025-03-14 21:59:10,133 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 1049 selfloop transitions, 122 changer transitions 263/1536 dead transitions. [2025-03-14 21:59:10,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1358 places, 1536 transitions, 131089 flow [2025-03-14 21:59:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 21:59:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 21:59:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3097 transitions. [2025-03-14 21:59:10,134 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6433319484835895 [2025-03-14 21:59:10,134 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1196 predicate places. [2025-03-14 21:59:10,135 INFO L471 AbstractCegarLoop]: Abstraction has has 1358 places, 1536 transitions, 131089 flow [2025-03-14 21:59:10,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 103.57894736842105) internal successors, (1968), 19 states have internal predecessors, (1968), 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 21:59:10,135 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:10,135 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] [2025-03-14 21:59:10,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-14 21:59:10,135 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:10,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash -588066709, now seen corresponding path program 21 times [2025-03-14 21:59:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:10,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598100819] [2025-03-14 21:59:10,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:59:10,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:10,143 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 21:59:10,143 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:10,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598100819] [2025-03-14 21:59:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598100819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:10,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:59:10,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 21:59:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420586013] [2025-03-14 21:59:10,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:10,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 21:59:10,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:10,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 21:59:10,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-14 21:59:10,442 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 21:59:10,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1358 places, 1536 transitions, 131089 flow. Second operand has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:59:10,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:10,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 21:59:10,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:12,319 INFO L124 PetriNetUnfolderBase]: 1310/3353 cut-off events. [2025-03-14 21:59:12,319 INFO L125 PetriNetUnfolderBase]: For 269787/274918 co-relation queries the response was YES. [2025-03-14 21:59:12,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129652 conditions, 3353 events. 1310/3353 cut-off events. For 269787/274918 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23435 event pairs, 84 based on Foata normal form. 7/3127 useless extension candidates. Maximal degree in co-relation 111858. Up to 1277 conditions per place. [2025-03-14 21:59:12,400 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 956 selfloop transitions, 220 changer transitions 263/1541 dead transitions. [2025-03-14 21:59:12,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1390 places, 1541 transitions, 134354 flow [2025-03-14 21:59:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-14 21:59:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-14 21:59:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3519 transitions. [2025-03-14 21:59:12,402 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6423877327491785 [2025-03-14 21:59:12,402 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1228 predicate places. [2025-03-14 21:59:12,402 INFO L471 AbstractCegarLoop]: Abstraction has has 1390 places, 1541 transitions, 134354 flow [2025-03-14 21:59:12,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 103.45) internal successors, (2069), 20 states have internal predecessors, (2069), 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 21:59:12,402 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:12,402 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] [2025-03-14 21:59:12,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-14 21:59:12,402 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:12,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 119041425, now seen corresponding path program 22 times [2025-03-14 21:59:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:12,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367979994] [2025-03-14 21:59:12,403 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:59:12,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:12,411 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 21:59:12,411 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:12,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367979994] [2025-03-14 21:59:12,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367979994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:12,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:59:12,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 21:59:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435648592] [2025-03-14 21:59:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:12,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:59:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:12,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:59:12,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:59:12,592 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-14 21:59:12,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1390 places, 1541 transitions, 134354 flow. Second operand has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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 21:59:12,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:12,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-14 21:59:12,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:14,202 INFO L124 PetriNetUnfolderBase]: 1262/3220 cut-off events. [2025-03-14 21:59:14,202 INFO L125 PetriNetUnfolderBase]: For 264269/268703 co-relation queries the response was YES. [2025-03-14 21:59:14,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127451 conditions, 3220 events. 1262/3220 cut-off events. For 264269/268703 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 22118 event pairs, 47 based on Foata normal form. 7/3018 useless extension candidates. Maximal degree in co-relation 110817. Up to 1277 conditions per place. [2025-03-14 21:59:14,283 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 961 selfloop transitions, 203 changer transitions 262/1542 dead transitions. [2025-03-14 21:59:14,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1406 places, 1542 transitions, 137728 flow [2025-03-14 21:59:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 21:59:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 21:59:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2365 transitions. [2025-03-14 21:59:14,284 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7914993306559571 [2025-03-14 21:59:14,284 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1244 predicate places. [2025-03-14 21:59:14,284 INFO L471 AbstractCegarLoop]: Abstraction has has 1406 places, 1542 transitions, 137728 flow [2025-03-14 21:59:14,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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 21:59:14,284 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:14,284 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] [2025-03-14 21:59:14,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-14 21:59:14,285 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:14,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1916407973, now seen corresponding path program 1 times [2025-03-14 21:59:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452790730] [2025-03-14 21:59:14,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:59:14,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:59:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:14,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:14,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452790730] [2025-03-14 21:59:14,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452790730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:14,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:59:14,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 21:59:14,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604062062] [2025-03-14 21:59:14,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:14,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:59:14,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:14,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:59:14,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:59:14,404 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 166 [2025-03-14 21:59:14,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1406 places, 1542 transitions, 137728 flow. Second operand has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:14,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:14,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 166 [2025-03-14 21:59:14,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:16,722 INFO L124 PetriNetUnfolderBase]: 1956/4781 cut-off events. [2025-03-14 21:59:16,722 INFO L125 PetriNetUnfolderBase]: For 490779/497785 co-relation queries the response was YES. [2025-03-14 21:59:16,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194527 conditions, 4781 events. 1956/4781 cut-off events. For 490779/497785 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 35627 event pairs, 58 based on Foata normal form. 14/4457 useless extension candidates. Maximal degree in co-relation 167858. Up to 2603 conditions per place. [2025-03-14 21:59:17,028 INFO L140 encePairwiseOnDemand]: 150/166 looper letters, 810 selfloop transitions, 112 changer transitions 276/1874 dead transitions. [2025-03-14 21:59:17,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1422 places, 1874 transitions, 173243 flow [2025-03-14 21:59:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 21:59:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 21:59:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1936 transitions. [2025-03-14 21:59:17,030 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6860382707299787 [2025-03-14 21:59:17,030 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1260 predicate places. [2025-03-14 21:59:17,030 INFO L471 AbstractCegarLoop]: Abstraction has has 1422 places, 1874 transitions, 173243 flow [2025-03-14 21:59:17,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:17,031 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:17,031 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] [2025-03-14 21:59:17,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-14 21:59:17,031 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:17,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:17,032 INFO L85 PathProgramCache]: Analyzing trace with hash 44542939, now seen corresponding path program 2 times [2025-03-14 21:59:17,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:17,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121331445] [2025-03-14 21:59:17,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:59:17,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:17,042 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:59:17,042 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:17,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121331445] [2025-03-14 21:59:17,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121331445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:17,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:59:17,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 21:59:17,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202018757] [2025-03-14 21:59:17,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:17,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:59:17,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:17,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:59:17,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:59:17,128 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 166 [2025-03-14 21:59:17,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1422 places, 1874 transitions, 173243 flow. Second operand has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:17,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:17,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 166 [2025-03-14 21:59:17,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:20,676 INFO L124 PetriNetUnfolderBase]: 2167/5293 cut-off events. [2025-03-14 21:59:20,676 INFO L125 PetriNetUnfolderBase]: For 579744/587114 co-relation queries the response was YES. [2025-03-14 21:59:20,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217388 conditions, 5293 events. 2167/5293 cut-off events. For 579744/587114 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 40534 event pairs, 93 based on Foata normal form. 18/4913 useless extension candidates. Maximal degree in co-relation 186826. Up to 3014 conditions per place. [2025-03-14 21:59:20,814 INFO L140 encePairwiseOnDemand]: 150/166 looper letters, 905 selfloop transitions, 96 changer transitions 290/1967 dead transitions. [2025-03-14 21:59:20,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1443 places, 1967 transitions, 183983 flow [2025-03-14 21:59:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 21:59:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 21:59:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2460 transitions. [2025-03-14 21:59:20,815 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6736035049288062 [2025-03-14 21:59:20,816 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1281 predicate places. [2025-03-14 21:59:20,816 INFO L471 AbstractCegarLoop]: Abstraction has has 1443 places, 1967 transitions, 183983 flow [2025-03-14 21:59:20,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:20,816 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:20,816 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] [2025-03-14 21:59:20,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-14 21:59:20,816 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:20,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1067722393, now seen corresponding path program 3 times [2025-03-14 21:59:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125079240] [2025-03-14 21:59:20,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:59:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:20,828 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 21:59:20,828 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:20,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125079240] [2025-03-14 21:59:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125079240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:20,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:59:20,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 21:59:20,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784014654] [2025-03-14 21:59:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:20,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:59:20,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:20,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:59:20,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:59:20,919 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 166 [2025-03-14 21:59:20,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1443 places, 1967 transitions, 183983 flow. Second operand has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:20,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:20,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 166 [2025-03-14 21:59:20,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:25,008 INFO L124 PetriNetUnfolderBase]: 2351/5757 cut-off events. [2025-03-14 21:59:25,008 INFO L125 PetriNetUnfolderBase]: For 641378/648622 co-relation queries the response was YES. [2025-03-14 21:59:25,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238695 conditions, 5757 events. 2351/5757 cut-off events. For 641378/648622 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 45384 event pairs, 58 based on Foata normal form. 16/5321 useless extension candidates. Maximal degree in co-relation 204556. Up to 3374 conditions per place. [2025-03-14 21:59:25,201 INFO L140 encePairwiseOnDemand]: 150/166 looper letters, 968 selfloop transitions, 100 changer transitions 304/2048 dead transitions. [2025-03-14 21:59:25,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1463 places, 2048 transitions, 194663 flow [2025-03-14 21:59:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 21:59:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 21:59:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2355 transitions. [2025-03-14 21:59:25,204 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6755593803786575 [2025-03-14 21:59:25,204 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1301 predicate places. [2025-03-14 21:59:25,204 INFO L471 AbstractCegarLoop]: Abstraction has has 1463 places, 2048 transitions, 194663 flow [2025-03-14 21:59:25,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:25,204 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:25,204 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] [2025-03-14 21:59:25,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-14 21:59:25,205 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:25,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash 939309615, now seen corresponding path program 4 times [2025-03-14 21:59:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:25,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064736447] [2025-03-14 21:59:25,206 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 21:59:25,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:25,214 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 21:59:25,214 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:25,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064736447] [2025-03-14 21:59:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064736447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:25,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:59:25,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 21:59:25,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899717897] [2025-03-14 21:59:25,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:25,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:59:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:25,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:59:25,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:59:25,332 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 166 [2025-03-14 21:59:25,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1463 places, 2048 transitions, 194663 flow. Second operand has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:25,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:25,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 166 [2025-03-14 21:59:25,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:30,121 INFO L124 PetriNetUnfolderBase]: 2569/6270 cut-off events. [2025-03-14 21:59:30,121 INFO L125 PetriNetUnfolderBase]: For 733543/741020 co-relation queries the response was YES. [2025-03-14 21:59:30,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261983 conditions, 6270 events. 2569/6270 cut-off events. For 733543/741020 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 50440 event pairs, 125 based on Foata normal form. 5/5765 useless extension candidates. Maximal degree in co-relation 223911. Up to 3751 conditions per place. [2025-03-14 21:59:30,293 INFO L140 encePairwiseOnDemand]: 150/166 looper letters, 1059 selfloop transitions, 98 changer transitions 318/2151 dead transitions. [2025-03-14 21:59:30,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1481 places, 2151 transitions, 207215 flow [2025-03-14 21:59:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 21:59:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 21:59:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2138 transitions. [2025-03-14 21:59:30,295 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6778693722257451 [2025-03-14 21:59:30,295 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1319 predicate places. [2025-03-14 21:59:30,295 INFO L471 AbstractCegarLoop]: Abstraction has has 1481 places, 2151 transitions, 207215 flow [2025-03-14 21:59:30,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:30,295 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:30,295 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] [2025-03-14 21:59:30,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-14 21:59:30,295 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:30,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:30,296 INFO L85 PathProgramCache]: Analyzing trace with hash 439401989, now seen corresponding path program 5 times [2025-03-14 21:59:30,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:30,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89562587] [2025-03-14 21:59:30,296 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:59:30,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:30,304 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:59:30,304 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:59:30,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:30,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89562587] [2025-03-14 21:59:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89562587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:59:30,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175421266] [2025-03-14 21:59:30,476 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 21:59:30,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:59:30,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:59:30,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:59:30,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-14 21:59:30,543 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:59:30,543 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:30,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-14 21:59:30,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:59:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:30,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:59:30,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175421266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:30,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:59:30,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 14 [2025-03-14 21:59:30,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149954293] [2025-03-14 21:59:30,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:30,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:59:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:30,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:59:30,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-14 21:59:30,733 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 166 [2025-03-14 21:59:30,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1481 places, 2151 transitions, 207215 flow. Second operand has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:30,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:30,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 166 [2025-03-14 21:59:30,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:36,471 INFO L124 PetriNetUnfolderBase]: 3045/7428 cut-off events. [2025-03-14 21:59:36,472 INFO L125 PetriNetUnfolderBase]: For 877784/885500 co-relation queries the response was YES. [2025-03-14 21:59:36,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314617 conditions, 7428 events. 3045/7428 cut-off events. For 877784/885500 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 62499 event pairs, 61 based on Foata normal form. 2/6814 useless extension candidates. Maximal degree in co-relation 272618. Up to 4142 conditions per place. [2025-03-14 21:59:36,762 INFO L140 encePairwiseOnDemand]: 150/166 looper letters, 1254 selfloop transitions, 122 changer transitions 332/2384 dead transitions. [2025-03-14 21:59:36,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1497 places, 2384 transitions, 235197 flow [2025-03-14 21:59:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 21:59:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 21:59:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1930 transitions. [2025-03-14 21:59:36,764 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6839121190644932 [2025-03-14 21:59:36,764 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1335 predicate places. [2025-03-14 21:59:36,764 INFO L471 AbstractCegarLoop]: Abstraction has has 1497 places, 2384 transitions, 235197 flow [2025-03-14 21:59:36,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:36,764 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:36,764 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] [2025-03-14 21:59:36,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-14 21:59:36,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-03-14 21:59:36,965 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:36,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:36,966 INFO L85 PathProgramCache]: Analyzing trace with hash 235543467, now seen corresponding path program 6 times [2025-03-14 21:59:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421145774] [2025-03-14 21:59:36,966 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 21:59:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:36,976 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 21:59:36,976 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:59:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 21:59:37,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:37,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421145774] [2025-03-14 21:59:37,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421145774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:59:37,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:59:37,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 21:59:37,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443308921] [2025-03-14 21:59:37,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:59:37,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:59:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:37,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:59:37,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:59:37,216 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 166 [2025-03-14 21:59:37,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1497 places, 2384 transitions, 235197 flow. Second operand has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:37,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:37,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 166 [2025-03-14 21:59:37,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:43,701 INFO L124 PetriNetUnfolderBase]: 3215/7860 cut-off events. [2025-03-14 21:59:43,701 INFO L125 PetriNetUnfolderBase]: For 942669/950279 co-relation queries the response was YES. [2025-03-14 21:59:43,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336231 conditions, 7860 events. 3215/7860 cut-off events. For 942669/950279 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 66100 event pairs, 93 based on Foata normal form. 3/7194 useless extension candidates. Maximal degree in co-relation 290307. Up to 4488 conditions per place. [2025-03-14 21:59:43,916 INFO L140 encePairwiseOnDemand]: 150/166 looper letters, 1327 selfloop transitions, 107 changer transitions 346/2456 dead transitions. [2025-03-14 21:59:43,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1518 places, 2456 transitions, 246177 flow [2025-03-14 21:59:43,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 21:59:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 21:59:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2461 transitions. [2025-03-14 21:59:43,917 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6738773274917853 [2025-03-14 21:59:43,918 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1356 predicate places. [2025-03-14 21:59:43,918 INFO L471 AbstractCegarLoop]: Abstraction has has 1518 places, 2456 transitions, 246177 flow [2025-03-14 21:59:43,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:59:43,918 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:43,918 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:59:43,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-14 21:59:43,918 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 21:59:43,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:59:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1065130598, now seen corresponding path program 7 times [2025-03-14 21:59:43,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:59:43,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163138670] [2025-03-14 21:59:43,919 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 21:59:43,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:59:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:59:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:59:44,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:59:44,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163138670] [2025-03-14 21:59:44,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163138670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:59:44,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322783936] [2025-03-14 21:59:44,012 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 21:59:44,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:59:44,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:59:44,014 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:59:44,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-14 21:59:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:59:44,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 21:59:44,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:59:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:59:44,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:59:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 21:59:44,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322783936] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:59:44,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:59:44,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-03-14 21:59:44,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280719718] [2025-03-14 21:59:44,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:59:44,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-14 21:59:44,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:59:44,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-14 21:59:44,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-03-14 21:59:44,485 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 166 [2025-03-14 21:59:44,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1518 places, 2456 transitions, 246177 flow. Second operand has 28 states, 28 states have (on average 114.21428571428571) internal successors, (3198), 28 states have internal predecessors, (3198), 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 21:59:44,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:59:44,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 166 [2025-03-14 21:59:44,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:59:59,363 INFO L124 PetriNetUnfolderBase]: 7095/18058 cut-off events. [2025-03-14 21:59:59,363 INFO L125 PetriNetUnfolderBase]: For 2726228/2750529 co-relation queries the response was YES. [2025-03-14 21:59:59,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763074 conditions, 18058 events. 7095/18058 cut-off events. For 2726228/2750529 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 174151 event pairs, 215 based on Foata normal form. 42/16882 useless extension candidates. Maximal degree in co-relation 324587. Up to 6806 conditions per place. [2025-03-14 21:59:59,848 INFO L140 encePairwiseOnDemand]: 135/166 looper letters, 1888 selfloop transitions, 322 changer transitions 734/3992 dead transitions. [2025-03-14 21:59:59,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1593 places, 3992 transitions, 420927 flow [2025-03-14 21:59:59,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-14 21:59:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2025-03-14 21:59:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 8562 transitions. [2025-03-14 21:59:59,851 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6786620164870006 [2025-03-14 21:59:59,851 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1431 predicate places. [2025-03-14 21:59:59,851 INFO L471 AbstractCegarLoop]: Abstraction has has 1593 places, 3992 transitions, 420927 flow [2025-03-14 21:59:59,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 114.21428571428571) internal successors, (3198), 28 states have internal predecessors, (3198), 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 21:59:59,852 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:59:59,852 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:59:59,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-14 22:00:00,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-03-14 22:00:00,052 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:00:00,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:00:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1917982886, now seen corresponding path program 8 times [2025-03-14 22:00:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:00:00,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827683304] [2025-03-14 22:00:00,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:00:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:00:00,061 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:00:00,061 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:00:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:00:00,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:00:00,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827683304] [2025-03-14 22:00:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827683304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:00:00,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741841318] [2025-03-14 22:00:00,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:00:00,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:00:00,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:00:00,151 INFO L229 MonitoredProcess]: Starting monitored process 13 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:00:00,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-14 22:00:00,218 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:00:00,219 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:00:00,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 22:00:00,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:00:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:00:00,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:00:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:00:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741841318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:00:00,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:00:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-14 22:00:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958830611] [2025-03-14 22:00:00,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:00:00,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-14 22:00:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:00:00,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-14 22:00:00,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2025-03-14 22:00:00,745 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 166 [2025-03-14 22:00:00,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1593 places, 3992 transitions, 420927 flow. Second operand has 27 states, 27 states have (on average 115.74074074074075) internal successors, (3125), 27 states have internal predecessors, (3125), 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:00:00,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:00:00,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 166 [2025-03-14 22:00:00,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:00:17,996 INFO L124 PetriNetUnfolderBase]: 5479/14146 cut-off events. [2025-03-14 22:00:17,996 INFO L125 PetriNetUnfolderBase]: For 2260430/2281682 co-relation queries the response was YES. [2025-03-14 22:00:18,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597242 conditions, 14146 events. 5479/14146 cut-off events. For 2260430/2281682 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 129646 event pairs, 96 based on Foata normal form. 18/13257 useless extension candidates. Maximal degree in co-relation 326400. Up to 5836 conditions per place. [2025-03-14 22:00:18,364 INFO L140 encePairwiseOnDemand]: 146/166 looper letters, 1179 selfloop transitions, 64 changer transitions 1205/3721 dead transitions. [2025-03-14 22:00:18,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1614 places, 3721 transitions, 390481 flow [2025-03-14 22:00:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 22:00:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 22:00:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2553 transitions. [2025-03-14 22:00:18,366 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6990690032858707 [2025-03-14 22:00:18,366 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1452 predicate places. [2025-03-14 22:00:18,366 INFO L471 AbstractCegarLoop]: Abstraction has has 1614 places, 3721 transitions, 390481 flow [2025-03-14 22:00:18,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 115.74074074074075) internal successors, (3125), 27 states have internal predecessors, (3125), 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:00:18,366 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:00:18,367 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:18,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-14 22:00:18,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-03-14 22:00:18,567 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:00:18,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:00:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1242356818, now seen corresponding path program 9 times [2025-03-14 22:00:18,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:00:18,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859331863] [2025-03-14 22:00:18,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:00:18,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:00:18,578 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:00:18,578 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:00:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:00:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:00:18,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859331863] [2025-03-14 22:00:18,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859331863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:00:18,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267022066] [2025-03-14 22:00:18,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:00:18,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:00:18,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:00:18,818 INFO L229 MonitoredProcess]: Starting monitored process 14 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:00:18,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-14 22:00:18,891 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:00:18,891 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:00:18,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 22:00:18,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:00:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:00:19,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:00:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:00:19,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267022066] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:00:19,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:00:19,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-14 22:00:19,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328024468] [2025-03-14 22:00:19,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:00:19,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-14 22:00:19,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:00:19,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-14 22:00:19,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2025-03-14 22:00:19,311 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 166 [2025-03-14 22:00:19,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1614 places, 3721 transitions, 390481 flow. Second operand has 27 states, 27 states have (on average 116.33333333333333) internal successors, (3141), 27 states have internal predecessors, (3141), 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:00:19,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:00:19,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 166 [2025-03-14 22:00:19,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:00:32,658 INFO L124 PetriNetUnfolderBase]: 4670/12177 cut-off events. [2025-03-14 22:00:32,658 INFO L125 PetriNetUnfolderBase]: For 2074532/2096151 co-relation queries the response was YES. [2025-03-14 22:00:32,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514720 conditions, 12177 events. 4670/12177 cut-off events. For 2074532/2096151 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 108812 event pairs, 106 based on Foata normal form. 19/11445 useless extension candidates. Maximal degree in co-relation 295376. Up to 5339 conditions per place. [2025-03-14 22:00:32,957 INFO L140 encePairwiseOnDemand]: 146/166 looper letters, 926 selfloop transitions, 53 changer transitions 1632/3752 dead transitions. [2025-03-14 22:00:32,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1637 places, 3752 transitions, 393855 flow [2025-03-14 22:00:32,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 22:00:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-14 22:00:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2807 transitions. [2025-03-14 22:00:32,959 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7045682730923695 [2025-03-14 22:00:32,959 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1475 predicate places. [2025-03-14 22:00:32,959 INFO L471 AbstractCegarLoop]: Abstraction has has 1637 places, 3752 transitions, 393855 flow [2025-03-14 22:00:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 116.33333333333333) internal successors, (3141), 27 states have internal predecessors, (3141), 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:00:32,959 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:00:32,960 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:32,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-14 22:00:33,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2025-03-14 22:00:33,160 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:00:33,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:00:33,161 INFO L85 PathProgramCache]: Analyzing trace with hash -348367151, now seen corresponding path program 10 times [2025-03-14 22:00:33,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:00:33,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342997300] [2025-03-14 22:00:33,161 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:00:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:00:33,168 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:00:33,169 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:00:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 22:00:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:00:33,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342997300] [2025-03-14 22:00:33,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342997300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:00:33,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431611397] [2025-03-14 22:00:33,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:00:33,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:00:33,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:00:33,541 INFO L229 MonitoredProcess]: Starting monitored process 15 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:00:33,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-14 22:00:33,607 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:00:33,607 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:00:33,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 22:00:33,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:00:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:00:34,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:00:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 22:00:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431611397] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:00:34,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:00:34,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [19, 22] total 53 [2025-03-14 22:00:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50208282] [2025-03-14 22:00:34,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:00:34,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 22:00:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:00:34,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 22:00:34,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=2315, Unknown=0, NotChecked=0, Total=2756 [2025-03-14 22:00:34,812 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 166 [2025-03-14 22:00:34,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1637 places, 3752 transitions, 393855 flow. Second operand has 17 states, 17 states have (on average 112.58823529411765) internal successors, (1914), 17 states have internal predecessors, (1914), 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:00:34,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:00:34,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 166 [2025-03-14 22:00:34,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:00:48,623 INFO L124 PetriNetUnfolderBase]: 4575/11815 cut-off events. [2025-03-14 22:00:48,623 INFO L125 PetriNetUnfolderBase]: For 2084152/2102718 co-relation queries the response was YES. [2025-03-14 22:00:48,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505733 conditions, 11815 events. 4575/11815 cut-off events. For 2084152/2102718 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 103712 event pairs, 66 based on Foata normal form. 30/11225 useless extension candidates. Maximal degree in co-relation 287346. Up to 5179 conditions per place. [2025-03-14 22:00:48,892 INFO L140 encePairwiseOnDemand]: 138/166 looper letters, 767 selfloop transitions, 182 changer transitions 1620/3708 dead transitions. [2025-03-14 22:00:48,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1661 places, 3708 transitions, 392385 flow [2025-03-14 22:00:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 22:00:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 22:00:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2874 transitions. [2025-03-14 22:00:48,893 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6925301204819277 [2025-03-14 22:00:48,894 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1499 predicate places. [2025-03-14 22:00:48,894 INFO L471 AbstractCegarLoop]: Abstraction has has 1661 places, 3708 transitions, 392385 flow [2025-03-14 22:00:48,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 112.58823529411765) internal successors, (1914), 17 states have internal predecessors, (1914), 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:00:48,894 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:00:48,894 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:48,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-14 22:00:49,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:00:49,095 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:00:49,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:00:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1671229211, now seen corresponding path program 11 times [2025-03-14 22:00:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:00:49,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300297833] [2025-03-14 22:00:49,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:00:49,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:00:49,104 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 22:00:49,104 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:00:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:00:49,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:00:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300297833] [2025-03-14 22:00:49,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300297833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:00:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603773457] [2025-03-14 22:00:49,277 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:00:49,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:00:49,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:00:49,279 INFO L229 MonitoredProcess]: Starting monitored process 16 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:00:49,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-14 22:00:49,350 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 22:00:49,351 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:00:49,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-14 22:00:49,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:00:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:00:49,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:00:49,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603773457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:00:49,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:00:49,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2025-03-14 22:00:49,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754898085] [2025-03-14 22:00:49,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:00:49,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 22:00:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:00:49,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 22:00:49,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-03-14 22:00:49,623 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 166 [2025-03-14 22:00:49,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1661 places, 3708 transitions, 392385 flow. Second operand has 9 states, 9 states have (on average 136.66666666666666) internal successors, (1230), 9 states have internal predecessors, (1230), 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:00:49,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:00:49,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 166 [2025-03-14 22:00:49,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:01:03,555 INFO L124 PetriNetUnfolderBase]: 4582/11880 cut-off events. [2025-03-14 22:01:03,556 INFO L125 PetriNetUnfolderBase]: For 2180321/2200209 co-relation queries the response was YES. [2025-03-14 22:01:03,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513085 conditions, 11880 events. 4582/11880 cut-off events. For 2180321/2200209 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 104812 event pairs, 54 based on Foata normal form. 50/11314 useless extension candidates. Maximal degree in co-relation 290028. Up to 5214 conditions per place. [2025-03-14 22:01:03,857 INFO L140 encePairwiseOnDemand]: 154/166 looper letters, 1195 selfloop transitions, 133 changer transitions 1754/3791 dead transitions. [2025-03-14 22:01:03,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1672 places, 3791 transitions, 407815 flow [2025-03-14 22:01:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 22:01:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 22:01:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1698 transitions. [2025-03-14 22:01:03,858 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8524096385542169 [2025-03-14 22:01:03,859 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1510 predicate places. [2025-03-14 22:01:03,859 INFO L471 AbstractCegarLoop]: Abstraction has has 1672 places, 3791 transitions, 407815 flow [2025-03-14 22:01:03,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.66666666666666) internal successors, (1230), 9 states have internal predecessors, (1230), 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:01:03,859 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:01:03,859 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:04,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-14 22:01:04,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:01:04,060 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:01:04,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:01:04,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1389891845, now seen corresponding path program 12 times [2025-03-14 22:01:04,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:01:04,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43037223] [2025-03-14 22:01:04,061 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:01:04,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:01:04,071 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 22:01:04,071 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:01:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:01:04,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:01:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43037223] [2025-03-14 22:01:04,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43037223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:01:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680956712] [2025-03-14 22:01:04,249 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:01:04,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:01:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:01:04,251 INFO L229 MonitoredProcess]: Starting monitored process 17 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:01:04,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-14 22:01:04,320 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 22:01:04,320 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:01:04,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 22:01:04,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:01:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:01:04,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:01:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:01:05,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680956712] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:01:05,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:01:05,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [17, 17] total 45 [2025-03-14 22:01:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447443512] [2025-03-14 22:01:05,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:01:05,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 22:01:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:01:05,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 22:01:05,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1660, Unknown=0, NotChecked=0, Total=1980 [2025-03-14 22:01:05,132 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 166 [2025-03-14 22:01:05,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1672 places, 3791 transitions, 407815 flow. Second operand has 17 states, 17 states have (on average 112.6470588235294) internal successors, (1915), 17 states have internal predecessors, (1915), 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:01:05,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:01:05,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 166 [2025-03-14 22:01:05,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:01:18,597 INFO L124 PetriNetUnfolderBase]: 4396/11366 cut-off events. [2025-03-14 22:01:18,597 INFO L125 PetriNetUnfolderBase]: For 2106337/2126494 co-relation queries the response was YES. [2025-03-14 22:01:18,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493134 conditions, 11366 events. 4396/11366 cut-off events. For 2106337/2126494 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 98333 event pairs, 52 based on Foata normal form. 20/10886 useless extension candidates. Maximal degree in co-relation 281580. Up to 4824 conditions per place. [2025-03-14 22:01:18,888 INFO L140 encePairwiseOnDemand]: 138/166 looper letters, 725 selfloop transitions, 217 changer transitions 1672/3663 dead transitions. [2025-03-14 22:01:18,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1696 places, 3663 transitions, 395422 flow [2025-03-14 22:01:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 22:01:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 22:01:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2878 transitions. [2025-03-14 22:01:18,890 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6934939759036145 [2025-03-14 22:01:18,897 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1534 predicate places. [2025-03-14 22:01:18,897 INFO L471 AbstractCegarLoop]: Abstraction has has 1696 places, 3663 transitions, 395422 flow [2025-03-14 22:01:18,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 112.6470588235294) internal successors, (1915), 17 states have internal predecessors, (1915), 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:01:18,897 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:01:18,897 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:18,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-14 22:01:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:01:19,098 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:01:19,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:01:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1783343842, now seen corresponding path program 1 times [2025-03-14 22:01:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:01:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125460542] [2025-03-14 22:01:19,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:01:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:01:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:01:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:01:19,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:01:19,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125460542] [2025-03-14 22:01:19,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125460542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:01:19,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54078141] [2025-03-14 22:01:19,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:01:19,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:01:19,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:01:19,936 INFO L229 MonitoredProcess]: Starting monitored process 18 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:01:19,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-14 22:01:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:01:20,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 22:01:20,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:01:20,453 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-14 22:01:20,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2025-03-14 22:01:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:01:20,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:01:20,637 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-14 22:01:20,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-14 22:01:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:01:20,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54078141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:01:20,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:01:20,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13, 13] total 44 [2025-03-14 22:01:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868201661] [2025-03-14 22:01:20,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:01:20,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-14 22:01:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:01:20,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-14 22:01:20,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1712, Unknown=0, NotChecked=0, Total=1892 [2025-03-14 22:01:20,781 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 166 [2025-03-14 22:01:20,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1696 places, 3663 transitions, 395422 flow. Second operand has 44 states, 44 states have (on average 90.1590909090909) internal successors, (3967), 44 states have internal predecessors, (3967), 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:01:20,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:01:20,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 166 [2025-03-14 22:01:20,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:01:41,498 INFO L124 PetriNetUnfolderBase]: 5391/13262 cut-off events. [2025-03-14 22:01:41,499 INFO L125 PetriNetUnfolderBase]: For 2564510/2583555 co-relation queries the response was YES. [2025-03-14 22:01:41,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590344 conditions, 13262 events. 5391/13262 cut-off events. For 2564510/2583555 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 110994 event pairs, 36 based on Foata normal form. 84/12735 useless extension candidates. Maximal degree in co-relation 359000. Up to 6298 conditions per place. [2025-03-14 22:01:41,859 INFO L140 encePairwiseOnDemand]: 120/166 looper letters, 2094 selfloop transitions, 789 changer transitions 1675/4633 dead transitions. [2025-03-14 22:01:41,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1804 places, 4633 transitions, 502161 flow [2025-03-14 22:01:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2025-03-14 22:01:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2025-03-14 22:01:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 10021 transitions. [2025-03-14 22:01:41,863 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5538299988946612 [2025-03-14 22:01:41,863 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1642 predicate places. [2025-03-14 22:01:41,863 INFO L471 AbstractCegarLoop]: Abstraction has has 1804 places, 4633 transitions, 502161 flow [2025-03-14 22:01:41,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 90.1590909090909) internal successors, (3967), 44 states have internal predecessors, (3967), 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:01:41,864 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:01:41,864 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:41,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-14 22:01:42,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:01:42,064 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:01:42,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:01:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1721310866, now seen corresponding path program 2 times [2025-03-14 22:01:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:01:42,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841511175] [2025-03-14 22:01:42,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:01:42,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:01:42,074 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:01:42,074 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:01:42,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:01:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:01:42,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841511175] [2025-03-14 22:01:42,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841511175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:01:42,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:01:42,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-14 22:01:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057348736] [2025-03-14 22:01:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:01:42,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 22:01:42,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:01:42,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 22:01:42,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-03-14 22:01:42,559 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 166 [2025-03-14 22:01:42,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1804 places, 4633 transitions, 502161 flow. Second operand has 24 states, 24 states have (on average 101.83333333333333) internal successors, (2444), 24 states have internal predecessors, (2444), 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:01:42,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:01:42,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 166 [2025-03-14 22:01:42,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:11,581 INFO L124 PetriNetUnfolderBase]: 5616/13722 cut-off events. [2025-03-14 22:02:11,581 INFO L125 PetriNetUnfolderBase]: For 2681017/2698223 co-relation queries the response was YES. [2025-03-14 22:02:11,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624902 conditions, 13722 events. 5616/13722 cut-off events. For 2681017/2698223 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 115228 event pairs, 107 based on Foata normal form. 58/13145 useless extension candidates. Maximal degree in co-relation 420454. Up to 6693 conditions per place. [2025-03-14 22:02:11,966 INFO L140 encePairwiseOnDemand]: 131/166 looper letters, 2398 selfloop transitions, 653 changer transitions 1675/4829 dead transitions. [2025-03-14 22:02:11,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1850 places, 4829 transitions, 531583 flow [2025-03-14 22:02:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-14 22:02:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-14 22:02:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4975 transitions. [2025-03-14 22:02:11,968 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6376570110228147 [2025-03-14 22:02:11,969 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1688 predicate places. [2025-03-14 22:02:11,969 INFO L471 AbstractCegarLoop]: Abstraction has has 1850 places, 4829 transitions, 531583 flow [2025-03-14 22:02:11,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 101.83333333333333) internal successors, (2444), 24 states have internal predecessors, (2444), 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:02:11,969 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:11,969 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:11,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-14 22:02:11,969 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:02:11,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:11,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1475898758, now seen corresponding path program 1 times [2025-03-14 22:02:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:11,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611287255] [2025-03-14 22:02:11,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 22:02:12,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:12,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611287255] [2025-03-14 22:02:12,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611287255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:12,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450457834] [2025-03-14 22:02:12,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:12,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:12,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:12,789 INFO L229 MonitoredProcess]: Starting monitored process 19 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:02:12,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-14 22:02:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:12,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 22:02:12,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:02:13,238 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-14 22:02:13,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 20 [2025-03-14 22:02:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:02:13,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:02:13,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450457834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:13,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:02:13,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [26] total 34 [2025-03-14 22:02:13,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669157736] [2025-03-14 22:02:13,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:13,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 22:02:13,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:13,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 22:02:13,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 22:02:13,242 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 166 [2025-03-14 22:02:13,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1850 places, 4829 transitions, 531583 flow. Second operand has 13 states, 13 states have (on average 122.76923076923077) internal successors, (1596), 13 states have internal predecessors, (1596), 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:02:13,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:13,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 166 [2025-03-14 22:02:13,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:42,596 INFO L124 PetriNetUnfolderBase]: 5639/13798 cut-off events. [2025-03-14 22:02:42,596 INFO L125 PetriNetUnfolderBase]: For 2711651/2729583 co-relation queries the response was YES. [2025-03-14 22:02:42,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640027 conditions, 13798 events. 5639/13798 cut-off events. For 2711651/2729583 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 116098 event pairs, 91 based on Foata normal form. 26/13190 useless extension candidates. Maximal degree in co-relation 396203. Up to 6750 conditions per place. [2025-03-14 22:02:42,987 INFO L140 encePairwiseOnDemand]: 148/166 looper letters, 2652 selfloop transitions, 290 changer transitions 1873/4937 dead transitions. [2025-03-14 22:02:42,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1869 places, 4937 transitions, 551867 flow [2025-03-14 22:02:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 22:02:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 22:02:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2604 transitions. [2025-03-14 22:02:42,988 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7843373493975904 [2025-03-14 22:02:42,988 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1707 predicate places. [2025-03-14 22:02:42,988 INFO L471 AbstractCegarLoop]: Abstraction has has 1869 places, 4937 transitions, 551867 flow [2025-03-14 22:02:42,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 122.76923076923077) internal successors, (1596), 13 states have internal predecessors, (1596), 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:02:42,989 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:42,989 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:42,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-14 22:02:43,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:43,189 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:02:43,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1284410754, now seen corresponding path program 2 times [2025-03-14 22:02:43,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:43,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357017] [2025-03-14 22:02:43,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:02:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:43,205 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:02:43,205 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:02:43,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:43,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357017] [2025-03-14 22:02:43,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:43,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:43,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-14 22:02:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534538624] [2025-03-14 22:02:43,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:43,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 22:02:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:43,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 22:02:43,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-03-14 22:02:43,585 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 166 [2025-03-14 22:02:43,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1869 places, 4937 transitions, 551867 flow. Second operand has 23 states, 23 states have (on average 101.95652173913044) internal successors, (2345), 23 states have internal predecessors, (2345), 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:02:43,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:43,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 166 [2025-03-14 22:02:43,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:03:16,771 INFO L124 PetriNetUnfolderBase]: 5662/13892 cut-off events. [2025-03-14 22:03:16,771 INFO L125 PetriNetUnfolderBase]: For 2785682/2804364 co-relation queries the response was YES. [2025-03-14 22:03:16,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655346 conditions, 13892 events. 5662/13892 cut-off events. For 2785682/2804364 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 117359 event pairs, 69 based on Foata normal form. 18/13276 useless extension candidates. Maximal degree in co-relation 405770. Up to 6806 conditions per place. [2025-03-14 22:03:17,165 INFO L140 encePairwiseOnDemand]: 131/166 looper letters, 2692 selfloop transitions, 268 changer transitions 1905/4968 dead transitions. [2025-03-14 22:03:17,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1906 places, 4968 transitions, 564778 flow [2025-03-14 22:03:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-14 22:03:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-14 22:03:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3980 transitions. [2025-03-14 22:03:17,170 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6309448319594166 [2025-03-14 22:03:17,170 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1744 predicate places. [2025-03-14 22:03:17,170 INFO L471 AbstractCegarLoop]: Abstraction has has 1906 places, 4968 transitions, 564778 flow [2025-03-14 22:03:17,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 101.95652173913044) internal successors, (2345), 23 states have internal predecessors, (2345), 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:03:17,171 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:03:17,171 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:17,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-14 22:03:17,171 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:03:17,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:03:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1965753204, now seen corresponding path program 3 times [2025-03-14 22:03:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:03:17,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381400098] [2025-03-14 22:03:17,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:03:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:03:17,182 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:03:17,182 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:03:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:03:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:03:17,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381400098] [2025-03-14 22:03:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381400098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:03:17,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:03:17,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-14 22:03:17,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641843130] [2025-03-14 22:03:17,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:03:17,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 22:03:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:03:17,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 22:03:17,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-03-14 22:03:17,741 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 166 [2025-03-14 22:03:17,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1906 places, 4968 transitions, 564778 flow. Second operand has 23 states, 23 states have (on average 101.95652173913044) internal successors, (2345), 23 states have internal predecessors, (2345), 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:03:17,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:03:17,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 166 [2025-03-14 22:03:17,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:03:52,435 INFO L124 PetriNetUnfolderBase]: 5744/14105 cut-off events. [2025-03-14 22:03:52,435 INFO L125 PetriNetUnfolderBase]: For 2881877/2902589 co-relation queries the response was YES. [2025-03-14 22:03:52,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676990 conditions, 14105 events. 5744/14105 cut-off events. For 2881877/2902589 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 119668 event pairs, 97 based on Foata normal form. 24/13477 useless extension candidates. Maximal degree in co-relation 420748. Up to 6977 conditions per place. [2025-03-14 22:03:52,831 INFO L140 encePairwiseOnDemand]: 131/166 looper letters, 2722 selfloop transitions, 291 changer transitions 1961/5077 dead transitions. [2025-03-14 22:03:52,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1946 places, 5077 transitions, 586794 flow [2025-03-14 22:03:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-14 22:03:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-14 22:03:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4316 transitions. [2025-03-14 22:03:52,833 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-03-14 22:03:52,833 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1784 predicate places. [2025-03-14 22:03:52,833 INFO L471 AbstractCegarLoop]: Abstraction has has 1946 places, 5077 transitions, 586794 flow [2025-03-14 22:03:52,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 101.95652173913044) internal successors, (2345), 23 states have internal predecessors, (2345), 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:03:52,834 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:03:52,834 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:52,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-14 22:03:52,834 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:03:52,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:03:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1200666480, now seen corresponding path program 3 times [2025-03-14 22:03:52,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:03:52,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432165991] [2025-03-14 22:03:52,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:03:52,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:03:52,863 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:03:52,864 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:03:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:03:53,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:03:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432165991] [2025-03-14 22:03:53,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432165991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:03:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488997573] [2025-03-14 22:03:53,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:03:53,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:03:53,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:03:53,426 INFO L229 MonitoredProcess]: Starting monitored process 20 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:03:53,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-14 22:03:53,503 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:03:53,503 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:03:53,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-14 22:03:53,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:03:54,059 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 22:03:54,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-14 22:03:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:03:54,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:03:54,241 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-14 22:03:54,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-14 22:03:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:03:54,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488997573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:03:54,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:03:54,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 13] total 42 [2025-03-14 22:03:54,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548080567] [2025-03-14 22:03:54,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:03:54,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-14 22:03:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:03:54,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-14 22:03:54,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1578, Unknown=0, NotChecked=0, Total=1722 [2025-03-14 22:03:54,391 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 166 [2025-03-14 22:03:54,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1946 places, 5077 transitions, 586794 flow. Second operand has 42 states, 42 states have (on average 96.54761904761905) internal successors, (4055), 42 states have internal predecessors, (4055), 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:03:54,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:03:54,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 166 [2025-03-14 22:03:54,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:04:46,170 INFO L124 PetriNetUnfolderBase]: 7086/17147 cut-off events. [2025-03-14 22:04:46,170 INFO L125 PetriNetUnfolderBase]: For 3457915/3480194 co-relation queries the response was YES. [2025-03-14 22:04:46,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845480 conditions, 17147 events. 7086/17147 cut-off events. For 3457915/3480194 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 147479 event pairs, 63 based on Foata normal form. 118/16384 useless extension candidates. Maximal degree in co-relation 562443. Up to 9501 conditions per place. [2025-03-14 22:04:46,728 INFO L140 encePairwiseOnDemand]: 126/166 looper letters, 2780 selfloop transitions, 1693 changer transitions 2042/6612 dead transitions. [2025-03-14 22:04:46,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2097 places, 6612 transitions, 774513 flow [2025-03-14 22:04:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2025-03-14 22:04:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2025-03-14 22:04:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 15148 transitions. [2025-03-14 22:04:46,733 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6003487634749525 [2025-03-14 22:04:46,734 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1935 predicate places. [2025-03-14 22:04:46,734 INFO L471 AbstractCegarLoop]: Abstraction has has 2097 places, 6612 transitions, 774513 flow [2025-03-14 22:04:46,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 96.54761904761905) internal successors, (4055), 42 states have internal predecessors, (4055), 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:04:46,734 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:46,734 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:46,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-14 22:04:46,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:04:46,935 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:04:46,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2008991306, now seen corresponding path program 4 times [2025-03-14 22:04:46,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:46,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242063214] [2025-03-14 22:04:46,936 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:04:46,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:46,946 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:04:46,946 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:04:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:47,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:47,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242063214] [2025-03-14 22:04:47,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242063214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:04:47,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374530544] [2025-03-14 22:04:47,357 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:04:47,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:04:47,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:04:47,359 INFO L229 MonitoredProcess]: Starting monitored process 21 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:04:47,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-14 22:04:47,431 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:04:47,431 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:04:47,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 22:04:47,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:04:47,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:04:47,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2025-03-14 22:04:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:04:47,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:04:47,837 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-14 22:04:47,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-14 22:04:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:04:47,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374530544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:04:47,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:04:47,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 29 [2025-03-14 22:04:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490696634] [2025-03-14 22:04:47,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:04:47,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 22:04:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:47,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 22:04:47,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-03-14 22:04:47,968 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 166 [2025-03-14 22:04:47,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2097 places, 6612 transitions, 774513 flow. Second operand has 29 states, 29 states have (on average 105.89655172413794) internal successors, (3071), 29 states have internal predecessors, (3071), 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:04:47,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:47,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 166 [2025-03-14 22:04:47,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:06:00,712 INFO L124 PetriNetUnfolderBase]: 7337/17775 cut-off events. [2025-03-14 22:06:00,712 INFO L125 PetriNetUnfolderBase]: For 3669658/3691495 co-relation queries the response was YES. [2025-03-14 22:06:00,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 890341 conditions, 17775 events. 7337/17775 cut-off events. For 3669658/3691495 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 154132 event pairs, 43 based on Foata normal form. 68/16943 useless extension candidates. Maximal degree in co-relation 595037. Up to 9889 conditions per place. [2025-03-14 22:06:01,298 INFO L140 encePairwiseOnDemand]: 134/166 looper letters, 3706 selfloop transitions, 1010 changer transitions 2097/6903 dead transitions. [2025-03-14 22:06:01,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2144 places, 6903 transitions, 820043 flow [2025-03-14 22:06:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-14 22:06:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-14 22:06:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 5323 transitions. [2025-03-14 22:06:01,301 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6680471887550201 [2025-03-14 22:06:01,301 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 1982 predicate places. [2025-03-14 22:06:01,301 INFO L471 AbstractCegarLoop]: Abstraction has has 2144 places, 6903 transitions, 820043 flow [2025-03-14 22:06:01,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 105.89655172413794) internal successors, (3071), 29 states have internal predecessors, (3071), 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:06:01,302 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:06:01,302 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:01,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-14 22:06:01,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:06:01,503 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:06:01,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:06:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1640441446, now seen corresponding path program 4 times [2025-03-14 22:06:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:06:01,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434343809] [2025-03-14 22:06:01,504 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:06:01,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:06:01,515 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:06:01,515 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:06:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:06:02,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:06:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434343809] [2025-03-14 22:06:02,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434343809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:06:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554474986] [2025-03-14 22:06:02,066 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:06:02,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:06:02,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:06:02,068 INFO L229 MonitoredProcess]: Starting monitored process 22 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:06:02,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-14 22:06:02,140 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:06:02,141 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:06:02,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 22:06:02,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:06:02,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:06:02,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2025-03-14 22:06:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:06:02,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:06:02,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554474986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:06:02,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:06:02,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 20 [2025-03-14 22:06:02,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974096886] [2025-03-14 22:06:02,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:06:02,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 22:06:02,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:06:02,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 22:06:02,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-14 22:06:02,404 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 166 [2025-03-14 22:06:02,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2144 places, 6903 transitions, 820043 flow. Second operand has 13 states, 13 states have (on average 122.76923076923077) internal successors, (1596), 13 states have internal predecessors, (1596), 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:06:02,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:06:02,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 166 [2025-03-14 22:06:02,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:07:17,929 INFO L124 PetriNetUnfolderBase]: 7322/17727 cut-off events. [2025-03-14 22:07:17,930 INFO L125 PetriNetUnfolderBase]: For 3712316/3733585 co-relation queries the response was YES. [2025-03-14 22:07:18,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904055 conditions, 17727 events. 7322/17727 cut-off events. For 3712316/3733585 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 153595 event pairs, 48 based on Foata normal form. 56/16890 useless extension candidates. Maximal degree in co-relation 604000. Up to 9861 conditions per place. [2025-03-14 22:07:18,511 INFO L140 encePairwiseOnDemand]: 146/166 looper letters, 4122 selfloop transitions, 580 changer transitions 2101/6925 dead transitions. [2025-03-14 22:07:18,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2164 places, 6925 transitions, 835912 flow [2025-03-14 22:07:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 22:07:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 22:07:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2841 transitions. [2025-03-14 22:07:18,513 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7779299014238773 [2025-03-14 22:07:18,513 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 2002 predicate places. [2025-03-14 22:07:18,513 INFO L471 AbstractCegarLoop]: Abstraction has has 2164 places, 6925 transitions, 835912 flow [2025-03-14 22:07:18,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 122.76923076923077) internal successors, (1596), 13 states have internal predecessors, (1596), 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:07:18,513 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:07:18,514 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:18,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-14 22:07:18,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:07:18,714 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:07:18,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:07:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1371316110, now seen corresponding path program 5 times [2025-03-14 22:07:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:07:18,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52659790] [2025-03-14 22:07:18,716 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:07:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:07:18,728 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 22:07:18,728 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:07:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:07:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:07:19,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52659790] [2025-03-14 22:07:19,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52659790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:07:19,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744433864] [2025-03-14 22:07:19,246 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:07:19,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:07:19,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:07:19,248 INFO L229 MonitoredProcess]: Starting monitored process 23 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:07:19,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-14 22:07:19,328 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 22:07:19,329 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:07:19,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-14 22:07:19,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:07:19,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 22:07:19,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-14 22:07:19,638 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 22:07:19,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-14 22:07:19,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-14 22:07:19,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-14 22:07:20,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-03-14 22:07:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:07:20,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:07:25,055 INFO L349 Elim1Store]: treesize reduction 38, result has 53.7 percent of original size [2025-03-14 22:07:25,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 125 [2025-03-14 22:07:27,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~i_AB~0 4)) (.cse2 (* c_~i_BA~0 4))) (let ((.cse7 (not (= c_~i_BA~0 0))) (.cse6 (+ c_~A~0.offset 4)) (.cse8 (= c_~i_AB~0 0)) (.cse1 (+ c_~A~0.offset .cse2 4)) (.cse3 (+ c_~A~0.offset 4 .cse4))) (and (or (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (or (not (= (select .cse0 .cse1) (select v_arrayElimArr_1 (+ .cse2 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (= (select .cse0 .cse3) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse4)))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (or (= (select .cse5 .cse3) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse4))) (not (= (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse5 .cse6)))))) .cse7)) .cse8) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (let ((.cse9 (select .cse11 .cse3)) (.cse10 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse9 .cse10) (= .cse9 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse4))) (not (= .cse10 (select .cse11 .cse6))))))) .cse7) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (or (not (= (select .cse12 .cse1) (select v_arrayElimArr_1 (+ .cse2 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (= (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse12 .cse6))))) (not .cse8)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (let ((.cse14 (select .cse13 .cse3))) (or (not (= (select .cse13 .cse1) (select v_arrayElimArr_1 (+ .cse2 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (= .cse14 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= .cse14 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse4)))))))))) is different from false [2025-03-14 22:07:34,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:07:34,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2025-03-14 22:07:34,815 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 22:07:34,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 70 [2025-03-14 22:07:34,856 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-03-14 22:07:34,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 74 [2025-03-14 22:07:34,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:07:34,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 71 [2025-03-14 22:07:34,926 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 22:07:34,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 100 [2025-03-14 22:07:34,966 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-03-14 22:07:34,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 89 [2025-03-14 22:07:35,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:07:35,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 77 [2025-03-14 22:07:35,022 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 22:07:35,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 109 [2025-03-14 22:07:35,090 INFO L349 Elim1Store]: treesize reduction 16, result has 84.8 percent of original size [2025-03-14 22:07:35,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 137 [2025-03-14 22:07:35,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:07:35,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2025-03-14 22:07:35,218 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 22:07:35,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 67 [2025-03-14 22:07:35,255 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-03-14 22:07:35,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 74 [2025-03-14 22:07:35,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:07:35,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2025-03-14 22:07:35,313 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 22:07:35,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 79 [2025-03-14 22:07:35,345 INFO L349 Elim1Store]: treesize reduction 16, result has 75.4 percent of original size [2025-03-14 22:07:35,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 82 [2025-03-14 22:07:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 6 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 22:07:35,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744433864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:07:35,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:07:35,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29, 28] total 72 [2025-03-14 22:07:35,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053306377] [2025-03-14 22:07:35,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:07:35,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-14 22:07:35,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:07:35,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-14 22:07:35,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=4177, Unknown=71, NotChecked=138, Total=5112 [2025-03-14 22:07:35,796 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 166 [2025-03-14 22:07:35,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2164 places, 6925 transitions, 835912 flow. Second operand has 72 states, 72 states have (on average 85.22222222222223) internal successors, (6136), 72 states have internal predecessors, (6136), 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:07:35,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:07:35,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 166 [2025-03-14 22:07:35,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:09:11,760 INFO L124 PetriNetUnfolderBase]: 8025/19419 cut-off events. [2025-03-14 22:09:11,761 INFO L125 PetriNetUnfolderBase]: For 3944306/3967227 co-relation queries the response was YES. [2025-03-14 22:09:11,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006373 conditions, 19419 events. 8025/19419 cut-off events. For 3944306/3967227 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 171388 event pairs, 85 based on Foata normal form. 92/18568 useless extension candidates. Maximal degree in co-relation 683804. Up to 10542 conditions per place. [2025-03-14 22:09:12,389 INFO L140 encePairwiseOnDemand]: 115/166 looper letters, 3717 selfloop transitions, 1740 changer transitions 2219/7748 dead transitions. [2025-03-14 22:09:12,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2295 places, 7748 transitions, 952326 flow [2025-03-14 22:09:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-03-14 22:09:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2025-03-14 22:09:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 11543 transitions. [2025-03-14 22:09:12,394 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5267889740781307 [2025-03-14 22:09:12,394 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 2133 predicate places. [2025-03-14 22:09:12,394 INFO L471 AbstractCegarLoop]: Abstraction has has 2295 places, 7748 transitions, 952326 flow [2025-03-14 22:09:12,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 85.22222222222223) internal successors, (6136), 72 states have internal predecessors, (6136), 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:09:12,395 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:09:12,395 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:12,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-14 22:09:12,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:09:12,596 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:09:12,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:09:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash -965219970, now seen corresponding path program 6 times [2025-03-14 22:09:12,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:09:12,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49678375] [2025-03-14 22:09:12,597 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:09:12,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:09:12,612 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 22:09:12,612 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:09:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:09:13,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:09:13,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49678375] [2025-03-14 22:09:13,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49678375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:09:13,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352618175] [2025-03-14 22:09:13,049 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:09:13,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:09:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:09:13,050 INFO L229 MonitoredProcess]: Starting monitored process 24 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:09:13,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-14 22:09:13,131 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 22:09:13,131 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:09:13,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-14 22:09:13,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:09:13,687 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 22:09:13,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-03-14 22:09:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:09:13,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:09:13,888 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-14 22:09:13,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-14 22:09:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:09:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352618175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:09:14,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:09:14,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 13] total 38 [2025-03-14 22:09:14,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122661886] [2025-03-14 22:09:14,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:09:14,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-14 22:09:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:09:14,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-14 22:09:14,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1264, Unknown=0, NotChecked=0, Total=1406 [2025-03-14 22:09:14,052 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 166 [2025-03-14 22:09:14,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2295 places, 7748 transitions, 952326 flow. Second operand has 38 states, 38 states have (on average 102.42105263157895) internal successors, (3892), 38 states have internal predecessors, (3892), 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:09:14,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:09:14,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 166 [2025-03-14 22:09:14,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:10:50,290 INFO L124 PetriNetUnfolderBase]: 8252/19899 cut-off events. [2025-03-14 22:10:50,290 INFO L125 PetriNetUnfolderBase]: For 4035624/4058511 co-relation queries the response was YES. [2025-03-14 22:10:50,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050105 conditions, 19899 events. 8252/19899 cut-off events. For 4035624/4058511 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 176033 event pairs, 68 based on Foata normal form. 92/19044 useless extension candidates. Maximal degree in co-relation 721291. Up to 10760 conditions per place. [2025-03-14 22:10:50,977 INFO L140 encePairwiseOnDemand]: 127/166 looper letters, 4075 selfloop transitions, 1625 changer transitions 2240/8043 dead transitions. [2025-03-14 22:10:50,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2394 places, 8043 transitions, 1003305 flow [2025-03-14 22:10:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-03-14 22:10:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2025-03-14 22:10:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 10499 transitions. [2025-03-14 22:10:50,981 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6324698795180723 [2025-03-14 22:10:50,981 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 2232 predicate places. [2025-03-14 22:10:50,982 INFO L471 AbstractCegarLoop]: Abstraction has has 2394 places, 8043 transitions, 1003305 flow [2025-03-14 22:10:50,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 102.42105263157895) internal successors, (3892), 38 states have internal predecessors, (3892), 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:10:50,982 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:10:50,982 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:50,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-14 22:10:51,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:10:51,183 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:10:51,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:10:51,185 INFO L85 PathProgramCache]: Analyzing trace with hash -797532906, now seen corresponding path program 5 times [2025-03-14 22:10:51,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:10:51,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284552636] [2025-03-14 22:10:51,185 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:10:51,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:10:51,196 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 22:10:51,196 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:10:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:10:51,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:10:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284552636] [2025-03-14 22:10:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284552636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:10:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928949014] [2025-03-14 22:10:51,826 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:10:51,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:10:51,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:10:51,827 INFO L229 MonitoredProcess]: Starting monitored process 25 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:10:51,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-14 22:10:51,909 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 22:10:51,909 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:10:51,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-14 22:10:51,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:10:52,339 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-14 22:10:52,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2025-03-14 22:10:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:10:52,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:10:52,566 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-14 22:10:52,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-14 22:10:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 22:10:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928949014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:10:52,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:10:52,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 41 [2025-03-14 22:10:52,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50626487] [2025-03-14 22:10:52,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:10:52,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-14 22:10:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:10:52,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-14 22:10:52,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1488, Unknown=0, NotChecked=0, Total=1640 [2025-03-14 22:10:52,740 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 166 [2025-03-14 22:10:52,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2394 places, 8043 transitions, 1003305 flow. Second operand has 41 states, 41 states have (on average 103.1219512195122) internal successors, (4228), 41 states have internal predecessors, (4228), 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:10:52,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:10:52,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 166 [2025-03-14 22:10:52,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-14 22:11:25,148 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 22:11:25,148 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 22:11:25,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-14 22:11:25,200 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 22:11:25,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-14 22:11:25,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:11:25,401 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (41states, 99/166 universal loopers) in iteration 75,while PetriNetUnfolder was constructing finite prefix that currently has 465979 conditions, 9061 events (3402/9060 cut-off events. For 2345510/2364233 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 81611 event pairs, 18 based on Foata normal form. 84/9182 useless extension candidates. Maximal degree in co-relation 201664. Up to 2562 conditions per place.). [2025-03-14 22:11:25,403 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 22:11:25,403 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 22:11:25,404 INFO L422 BasicCegarLoop]: Path program histogram: [23, 22, 12, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:11:25,409 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 22:11:25,409 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 22:11:25,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 10:11:25 BasicIcfg [2025-03-14 22:11:25,420 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 22:11:25,421 INFO L158 Benchmark]: Toolchain (without parser) took 816046.36ms. Allocated memory was 71.3MB in the beginning and 3.2GB in the end (delta: 3.2GB). Free memory was 44.0MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2025-03-14 22:11:25,421 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:11:25,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.57ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 32.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 22:11:25,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.33ms. Allocated memory is still 71.3MB. Free memory was 32.1MB in the beginning and 30.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:11:25,421 INFO L158 Benchmark]: Boogie Preprocessor took 20.38ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 29.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:11:25,421 INFO L158 Benchmark]: RCFGBuilder took 327.65ms. Allocated memory is still 71.3MB. Free memory was 29.4MB in the beginning and 40.3MB in the end (delta: -10.8MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2025-03-14 22:11:25,421 INFO L158 Benchmark]: TraceAbstraction took 815471.59ms. Allocated memory was 71.3MB in the beginning and 3.2GB in the end (delta: 3.2GB). Free memory was 39.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2025-03-14 22:11:25,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.57ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 32.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.33ms. Allocated memory is still 71.3MB. Free memory was 32.1MB in the beginning and 30.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.38ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 29.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 327.65ms. Allocated memory is still 71.3MB. Free memory was 29.4MB in the beginning and 40.3MB in the end (delta: -10.8MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * TraceAbstraction took 815471.59ms. Allocated memory was 71.3MB in the beginning and 3.2GB in the end (delta: 3.2GB). Free memory was 39.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (41states, 99/166 universal loopers) in iteration 75,while PetriNetUnfolder was constructing finite prefix that currently has 465979 conditions, 9061 events (3402/9060 cut-off events. For 2345510/2364233 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 81611 event pairs, 18 based on Foata normal form. 84/9182 useless extension candidates. Maximal degree in co-relation 201664. Up to 2562 conditions per place.). - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (41states, 99/166 universal loopers) in iteration 75,while PetriNetUnfolder was constructing finite prefix that currently has 465979 conditions, 9061 events (3402/9060 cut-off events. For 2345510/2364233 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 81611 event pairs, 18 based on Foata normal form. 84/9182 useless extension candidates. Maximal degree in co-relation 201664. Up to 2562 conditions per place.). - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (41states, 99/166 universal loopers) in iteration 75,while PetriNetUnfolder was constructing finite prefix that currently has 465979 conditions, 9061 events (3402/9060 cut-off events. For 2345510/2364233 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 81611 event pairs, 18 based on Foata normal form. 84/9182 useless extension candidates. Maximal degree in co-relation 201664. Up to 2562 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 188 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 815.4s, OverallIterations: 75, TraceHistogramMax: 2, PathProgramHistogramMax: 23, EmptinessCheckTime: 0.0s, AutomataDifference: 752.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15902 SdHoareTripleChecker+Valid, 25.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15902 mSDsluCounter, 38856 SdHoareTripleChecker+Invalid, 21.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 697 IncrementalHoareTripleChecker+Unchecked, 34458 mSDsCounter, 429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64533 IncrementalHoareTripleChecker+Invalid, 65659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 429 mSolverCounterUnsat, 4398 mSDtfsCounter, 64533 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8901 GetRequests, 5790 SyntacticMatches, 8 SemanticMatches, 3103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60613 ImplicationChecksByTransitivity, 51.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1003305occurred in iteration=74, InterpolantAutomatonStates: 2315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 55.4s InterpolantComputationTime, 14585 NumberOfCodeBlocks, 13877 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 16579 ConstructedInterpolants, 94 QuantifiedInterpolants, 139101 SizeOfPredicates, 367 NumberOfNonLiveVariables, 7398 ConjunctsInSsa, 585 ConjunctsInUnsatCore, 112 InterpolantComputations, 66 PerfectInterpolantSequences, 706/959 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown