/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/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:39:01,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:39:01,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 22:39:01,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:39:01,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:39:01,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:39:01,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:39:01,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:39:01,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:39:01,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:39:01,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:39:01,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 22:39:01,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:39:01,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:39:01,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:39:01,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:39:01,628 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:39:01,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-03-14 22:39:02,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03073440d/bc0683e3816745d189b79b5ebdbed719/FLAG2914af497 [2025-03-14 22:39:02,934 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:39:02,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-03-14 22:39:02,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03073440d/bc0683e3816745d189b79b5ebdbed719/FLAG2914af497 [2025-03-14 22:39:02,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03073440d/bc0683e3816745d189b79b5ebdbed719 [2025-03-14 22:39:02,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:39:02,963 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:39:02,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:39:02,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:39:02,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:39:02,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:39:02" (1/1) ... [2025-03-14 22:39:02,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a79529b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:02, skipping insertion in model container [2025-03-14 22:39:02,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:39:02" (1/1) ... [2025-03-14 22:39:02,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:39:03,104 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/parallel-misc-2.wvr.c[2249,2262] [2025-03-14 22:39:03,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:39:03,112 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:39:03,124 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/parallel-misc-2.wvr.c[2249,2262] [2025-03-14 22:39:03,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:39:03,134 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:39:03,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03 WrapperNode [2025-03-14 22:39:03,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:39:03,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:39:03,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:39:03,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:39:03,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,160 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-14 22:39:03,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:39:03,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:39:03,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:39:03,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:39:03,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:39:03,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:39:03,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:39:03,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:39:03,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (1/1) ... [2025-03-14 22:39:03,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:39:03,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:03,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 22:39:03,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 22:39:03,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:39:03,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:39:03,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:39:03,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:39:03,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:39:03,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:39:03,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:39:03,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:39:03,232 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 22:39:03,301 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:39:03,302 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:39:03,451 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:39:03,451 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:39:03,478 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:39:03,478 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 22:39:03,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:39:03 BoogieIcfgContainer [2025-03-14 22:39:03,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:39:03,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:39:03,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:39:03,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:39:03,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:39:02" (1/3) ... [2025-03-14 22:39:03,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407b924c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:39:03, skipping insertion in model container [2025-03-14 22:39:03,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:03" (2/3) ... [2025-03-14 22:39:03,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407b924c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:39:03, skipping insertion in model container [2025-03-14 22:39:03,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:39:03" (3/3) ... [2025-03-14 22:39:03,488 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-03-14 22:39:03,499 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:39:03,500 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 97 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-14 22:39:03,500 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:39:03,561 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 22:39:03,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:39:03,607 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;@19b39daf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:39:03,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 22:39:03,658 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:39:03,658 INFO L124 PetriNetUnfolderBase]: 6/94 cut-off events. [2025-03-14 22:39:03,661 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 22:39:03,662 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:03,662 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] [2025-03-14 22:39:03,663 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 22:39:03,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1130998426, now seen corresponding path program 1 times [2025-03-14 22:39:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:03,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610303083] [2025-03-14 22:39:03,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:04,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:04,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610303083] [2025-03-14 22:39:04,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610303083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:04,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:04,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:39:04,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283588074] [2025-03-14 22:39:04,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:04,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:39:04,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:04,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:39:04,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:39:04,295 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 102 [2025-03-14 22:39:04,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 102 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 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:39:04,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:04,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 102 [2025-03-14 22:39:04,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:04,491 INFO L124 PetriNetUnfolderBase]: 26/174 cut-off events. [2025-03-14 22:39:04,491 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-03-14 22:39:04,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 174 events. 26/174 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 430 event pairs, 0 based on Foata normal form. 4/159 useless extension candidates. Maximal degree in co-relation 121. Up to 41 conditions per place. [2025-03-14 22:39:04,497 INFO L140 encePairwiseOnDemand]: 85/102 looper letters, 19 selfloop transitions, 9 changer transitions 7/104 dead transitions. [2025-03-14 22:39:04,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 104 transitions, 299 flow [2025-03-14 22:39:04,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 22:39:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 22:39:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 715 transitions. [2025-03-14 22:39:04,511 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7788671023965141 [2025-03-14 22:39:04,514 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 1 predicate places. [2025-03-14 22:39:04,514 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 299 flow [2025-03-14 22:39:04,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 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:39:04,514 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:04,514 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] [2025-03-14 22:39:04,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:39:04,515 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 22:39:04,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1839201204, now seen corresponding path program 1 times [2025-03-14 22:39:04,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:04,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65718163] [2025-03-14 22:39:04,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:04,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65718163] [2025-03-14 22:39:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65718163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:04,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:39:04,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999090253] [2025-03-14 22:39:04,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:04,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:39:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:04,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:39:04,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:39:04,823 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2025-03-14 22:39:04,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:39:04,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:04,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2025-03-14 22:39:04,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:05,036 INFO L124 PetriNetUnfolderBase]: 116/417 cut-off events. [2025-03-14 22:39:05,036 INFO L125 PetriNetUnfolderBase]: For 166/176 co-relation queries the response was YES. [2025-03-14 22:39:05,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 417 events. 116/417 cut-off events. For 166/176 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2035 event pairs, 10 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 542. Up to 96 conditions per place. [2025-03-14 22:39:05,041 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 55 selfloop transitions, 12 changer transitions 8/136 dead transitions. [2025-03-14 22:39:05,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 136 transitions, 566 flow [2025-03-14 22:39:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 22:39:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 22:39:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 593 transitions. [2025-03-14 22:39:05,043 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7267156862745098 [2025-03-14 22:39:05,044 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 8 predicate places. [2025-03-14 22:39:05,044 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 136 transitions, 566 flow [2025-03-14 22:39:05,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:39:05,044 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:05,044 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] [2025-03-14 22:39:05,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:39:05,044 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 22:39:05,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:05,045 INFO L85 PathProgramCache]: Analyzing trace with hash 270304646, now seen corresponding path program 2 times [2025-03-14 22:39:05,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:05,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606142912] [2025-03-14 22:39:05,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:05,085 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:05,085 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:05,306 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 22:39:05,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:05,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606142912] [2025-03-14 22:39:05,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606142912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:05,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:39:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412844434] [2025-03-14 22:39:05,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:05,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:39:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:05,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:39:05,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:39:05,308 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 102 [2025-03-14 22:39:05,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 136 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:39:05,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:05,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 102 [2025-03-14 22:39:05,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:05,444 INFO L124 PetriNetUnfolderBase]: 126/410 cut-off events. [2025-03-14 22:39:05,455 INFO L125 PetriNetUnfolderBase]: For 276/314 co-relation queries the response was YES. [2025-03-14 22:39:05,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 410 events. 126/410 cut-off events. For 276/314 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1889 event pairs, 16 based on Foata normal form. 2/356 useless extension candidates. Maximal degree in co-relation 754. Up to 99 conditions per place. [2025-03-14 22:39:05,461 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 49 selfloop transitions, 8 changer transitions 11/137 dead transitions. [2025-03-14 22:39:05,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 137 transitions, 685 flow [2025-03-14 22:39:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 22:39:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 22:39:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 531 transitions. [2025-03-14 22:39:05,462 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7436974789915967 [2025-03-14 22:39:05,463 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 14 predicate places. [2025-03-14 22:39:05,463 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 137 transitions, 685 flow [2025-03-14 22:39:05,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:39:05,463 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:05,463 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] [2025-03-14 22:39:05,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 22:39:05,463 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 22:39:05,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1670352510, now seen corresponding path program 1 times [2025-03-14 22:39:05,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:05,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831818274] [2025-03-14 22:39:05,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:05,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831818274] [2025-03-14 22:39:05,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831818274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:05,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:05,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:39:05,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234317764] [2025-03-14 22:39:05,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:05,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:39:05,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:05,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:39:05,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:39:05,685 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2025-03-14 22:39:05,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 137 transitions, 685 flow. Second operand has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 0 states have call successors, (0), 0 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:39:05,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:05,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2025-03-14 22:39:05,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:05,838 INFO L124 PetriNetUnfolderBase]: 120/456 cut-off events. [2025-03-14 22:39:05,838 INFO L125 PetriNetUnfolderBase]: For 573/675 co-relation queries the response was YES. [2025-03-14 22:39:05,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 456 events. 120/456 cut-off events. For 573/675 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2223 event pairs, 8 based on Foata normal form. 6/410 useless extension candidates. Maximal degree in co-relation 964. Up to 110 conditions per place. [2025-03-14 22:39:05,842 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 79 selfloop transitions, 16 changer transitions 12/168 dead transitions. [2025-03-14 22:39:05,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 168 transitions, 1127 flow [2025-03-14 22:39:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 22:39:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 22:39:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 593 transitions. [2025-03-14 22:39:05,843 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7267156862745098 [2025-03-14 22:39:05,843 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 21 predicate places. [2025-03-14 22:39:05,844 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 168 transitions, 1127 flow [2025-03-14 22:39:05,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 0 states have call successors, (0), 0 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:39:05,844 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:05,844 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] [2025-03-14 22:39:05,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:39:05,844 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 22:39:05,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash -344397654, now seen corresponding path program 2 times [2025-03-14 22:39:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:05,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458781766] [2025-03-14 22:39:05,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:05,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:05,867 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:39:05,868 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:06,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:06,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458781766] [2025-03-14 22:39:06,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458781766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:06,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:06,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:39:06,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415380435] [2025-03-14 22:39:06,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:06,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:39:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:06,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:39:06,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:39:06,003 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2025-03-14 22:39:06,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 168 transitions, 1127 flow. Second operand has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 0 states have call successors, (0), 0 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:39:06,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:06,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2025-03-14 22:39:06,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:06,163 INFO L124 PetriNetUnfolderBase]: 122/434 cut-off events. [2025-03-14 22:39:06,163 INFO L125 PetriNetUnfolderBase]: For 845/947 co-relation queries the response was YES. [2025-03-14 22:39:06,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 434 events. 122/434 cut-off events. For 845/947 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2034 event pairs, 8 based on Foata normal form. 4/392 useless extension candidates. Maximal degree in co-relation 1081. Up to 122 conditions per place. [2025-03-14 22:39:06,168 INFO L140 encePairwiseOnDemand]: 89/102 looper letters, 80 selfloop transitions, 14 changer transitions 13/168 dead transitions. [2025-03-14 22:39:06,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 168 transitions, 1319 flow [2025-03-14 22:39:06,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 22:39:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 22:39:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 582 transitions. [2025-03-14 22:39:06,170 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471 [2025-03-14 22:39:06,171 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 28 predicate places. [2025-03-14 22:39:06,171 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 168 transitions, 1319 flow [2025-03-14 22:39:06,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 0 states have call successors, (0), 0 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:39:06,171 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:06,171 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] [2025-03-14 22:39:06,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 22:39:06,171 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 22:39:06,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:06,172 INFO L85 PathProgramCache]: Analyzing trace with hash -663497056, now seen corresponding path program 1 times [2025-03-14 22:39:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:06,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862682529] [2025-03-14 22:39:06,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:06,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862682529] [2025-03-14 22:39:06,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862682529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:06,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:06,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:39:06,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595857095] [2025-03-14 22:39:06,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:06,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:39:06,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:06,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:39:06,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:39:06,428 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 102 [2025-03-14 22:39:06,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 168 transitions, 1319 flow. Second operand has 8 states, 8 states have (on average 71.5) internal successors, (572), 8 states have internal predecessors, (572), 0 states have call successors, (0), 0 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:39:06,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:06,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 102 [2025-03-14 22:39:06,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:06,602 INFO L124 PetriNetUnfolderBase]: 168/560 cut-off events. [2025-03-14 22:39:06,602 INFO L125 PetriNetUnfolderBase]: For 1673/1818 co-relation queries the response was YES. [2025-03-14 22:39:06,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 560 events. 168/560 cut-off events. For 1673/1818 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2749 event pairs, 10 based on Foata normal form. 5/500 useless extension candidates. Maximal degree in co-relation 1744. Up to 196 conditions per place. [2025-03-14 22:39:06,606 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 93 selfloop transitions, 19 changer transitions 13/199 dead transitions. [2025-03-14 22:39:06,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 199 transitions, 1903 flow [2025-03-14 22:39:06,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:39:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:39:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 746 transitions. [2025-03-14 22:39:06,608 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7313725490196078 [2025-03-14 22:39:06,609 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 37 predicate places. [2025-03-14 22:39:06,609 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 199 transitions, 1903 flow [2025-03-14 22:39:06,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.5) internal successors, (572), 8 states have internal predecessors, (572), 0 states have call successors, (0), 0 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:39:06,609 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:06,609 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:06,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 22:39:06,610 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 22:39:06,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:06,610 INFO L85 PathProgramCache]: Analyzing trace with hash -265321210, now seen corresponding path program 2 times [2025-03-14 22:39:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313523133] [2025-03-14 22:39:06,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:06,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:06,628 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:39:06,628 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 22:39:06,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:06,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313523133] [2025-03-14 22:39:06,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313523133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:06,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:06,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:39:06,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948651993] [2025-03-14 22:39:06,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:06,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:39:06,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:06,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:39:06,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:39:06,870 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 102 [2025-03-14 22:39:06,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 199 transitions, 1903 flow. Second operand has 8 states, 8 states have (on average 71.75) internal successors, (574), 8 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:39:06,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:06,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 102 [2025-03-14 22:39:06,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:07,087 INFO L124 PetriNetUnfolderBase]: 309/914 cut-off events. [2025-03-14 22:39:07,087 INFO L125 PetriNetUnfolderBase]: For 3625/3792 co-relation queries the response was YES. [2025-03-14 22:39:07,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3932 conditions, 914 events. 309/914 cut-off events. For 3625/3792 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5145 event pairs, 24 based on Foata normal form. 5/817 useless extension candidates. Maximal degree in co-relation 3341. Up to 356 conditions per place. [2025-03-14 22:39:07,096 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 158 selfloop transitions, 22 changer transitions 13/276 dead transitions. [2025-03-14 22:39:07,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 276 transitions, 3238 flow [2025-03-14 22:39:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:39:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:39:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 750 transitions. [2025-03-14 22:39:07,098 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2025-03-14 22:39:07,099 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 46 predicate places. [2025-03-14 22:39:07,099 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 276 transitions, 3238 flow [2025-03-14 22:39:07,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.75) internal successors, (574), 8 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:39:07,099 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:07,099 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:07,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 22:39:07,099 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 22:39:07,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:07,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1963268074, now seen corresponding path program 1 times [2025-03-14 22:39:07,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:07,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433395019] [2025-03-14 22:39:07,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:07,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 22:39:07,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:07,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433395019] [2025-03-14 22:39:07,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433395019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:07,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:07,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 22:39:07,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250573513] [2025-03-14 22:39:07,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:07,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 22:39:07,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:07,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 22:39:07,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 22:39:07,220 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2025-03-14 22:39:07,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 276 transitions, 3238 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:39:07,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:07,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2025-03-14 22:39:07,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:07,490 INFO L124 PetriNetUnfolderBase]: 770/2067 cut-off events. [2025-03-14 22:39:07,490 INFO L125 PetriNetUnfolderBase]: For 13569/13866 co-relation queries the response was YES. [2025-03-14 22:39:07,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10360 conditions, 2067 events. 770/2067 cut-off events. For 13569/13866 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 15455 event pairs, 70 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 9133. Up to 948 conditions per place. [2025-03-14 22:39:07,510 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 177 selfloop transitions, 5 changer transitions 13/380 dead transitions. [2025-03-14 22:39:07,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 380 transitions, 5276 flow [2025-03-14 22:39:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 22:39:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 22:39:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 377 transitions. [2025-03-14 22:39:07,511 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9240196078431373 [2025-03-14 22:39:07,512 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 49 predicate places. [2025-03-14 22:39:07,512 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 380 transitions, 5276 flow [2025-03-14 22:39:07,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:39:07,512 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:07,512 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:07,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 22:39:07,512 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 22:39:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1243221930, now seen corresponding path program 1 times [2025-03-14 22:39:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286216285] [2025-03-14 22:39:07,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 22:39:07,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:07,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286216285] [2025-03-14 22:39:07,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286216285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:07,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:07,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 22:39:07,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204380537] [2025-03-14 22:39:07,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:07,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 22:39:07,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:07,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 22:39:07,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 22:39:07,656 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2025-03-14 22:39:07,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 380 transitions, 5276 flow. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:39:07,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:07,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2025-03-14 22:39:07,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:08,041 INFO L124 PetriNetUnfolderBase]: 1143/3198 cut-off events. [2025-03-14 22:39:08,041 INFO L125 PetriNetUnfolderBase]: For 30662/31587 co-relation queries the response was YES. [2025-03-14 22:39:08,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16405 conditions, 3198 events. 1143/3198 cut-off events. For 30662/31587 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 27206 event pairs, 117 based on Foata normal form. 209/3080 useless extension candidates. Maximal degree in co-relation 13122. Up to 1397 conditions per place. [2025-03-14 22:39:08,069 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 217 selfloop transitions, 6 changer transitions 13/425 dead transitions. [2025-03-14 22:39:08,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 425 transitions, 6616 flow [2025-03-14 22:39:08,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 22:39:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 22:39:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2025-03-14 22:39:08,070 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-03-14 22:39:08,071 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 52 predicate places. [2025-03-14 22:39:08,071 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 425 transitions, 6616 flow [2025-03-14 22:39:08,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:39:08,072 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:08,072 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:08,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 22:39:08,072 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 22:39:08,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1592140785, now seen corresponding path program 1 times [2025-03-14 22:39:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:08,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9537848] [2025-03-14 22:39:08,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 22:39:08,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:08,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9537848] [2025-03-14 22:39:08,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9537848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:08,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:08,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 22:39:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409654965] [2025-03-14 22:39:08,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:08,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 22:39:08,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:08,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 22:39:08,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 22:39:08,195 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2025-03-14 22:39:08,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 425 transitions, 6616 flow. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:39:08,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:08,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2025-03-14 22:39:08,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:08,490 INFO L124 PetriNetUnfolderBase]: 855/2379 cut-off events. [2025-03-14 22:39:08,490 INFO L125 PetriNetUnfolderBase]: For 24249/24978 co-relation queries the response was YES. [2025-03-14 22:39:08,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13236 conditions, 2379 events. 855/2379 cut-off events. For 24249/24978 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 19034 event pairs, 70 based on Foata normal form. 44/2231 useless extension candidates. Maximal degree in co-relation 11981. Up to 1053 conditions per place. [2025-03-14 22:39:08,508 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 224 selfloop transitions, 7 changer transitions 13/432 dead transitions. [2025-03-14 22:39:08,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 432 transitions, 7188 flow [2025-03-14 22:39:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 22:39:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 22:39:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2025-03-14 22:39:08,510 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2025-03-14 22:39:08,510 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 55 predicate places. [2025-03-14 22:39:08,510 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 432 transitions, 7188 flow [2025-03-14 22:39:08,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:39:08,510 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:08,511 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:08,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 22:39:08,511 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 22:39:08,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash -948977711, now seen corresponding path program 1 times [2025-03-14 22:39:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:08,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567657049] [2025-03-14 22:39:08,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567657049] [2025-03-14 22:39:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567657049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124861602] [2025-03-14 22:39:08,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:08,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:08,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:39:08,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 22:39:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:08,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-14 22:39:08,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:09,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:09,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124861602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:09,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:09,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2025-03-14 22:39:09,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338361624] [2025-03-14 22:39:09,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:09,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:39:09,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:09,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:39:09,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:39:09,250 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 102 [2025-03-14 22:39:09,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 432 transitions, 7188 flow. Second operand has 11 states, 11 states have (on average 77.36363636363636) internal successors, (851), 11 states have internal predecessors, (851), 0 states have call successors, (0), 0 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:39:09,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:09,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 102 [2025-03-14 22:39:09,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:09,961 INFO L124 PetriNetUnfolderBase]: 1521/4326 cut-off events. [2025-03-14 22:39:09,962 INFO L125 PetriNetUnfolderBase]: For 52525/53977 co-relation queries the response was YES. [2025-03-14 22:39:09,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24870 conditions, 4326 events. 1521/4326 cut-off events. For 52525/53977 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 38085 event pairs, 155 based on Foata normal form. 49/4013 useless extension candidates. Maximal degree in co-relation 19113. Up to 1864 conditions per place. [2025-03-14 22:39:09,990 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 318 selfloop transitions, 131 changer transitions 21/652 dead transitions. [2025-03-14 22:39:09,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 652 transitions, 13059 flow [2025-03-14 22:39:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:39:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:39:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1187 transitions. [2025-03-14 22:39:09,993 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7758169934640523 [2025-03-14 22:39:09,993 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 69 predicate places. [2025-03-14 22:39:09,993 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 652 transitions, 13059 flow [2025-03-14 22:39:09,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 77.36363636363636) internal successors, (851), 11 states have internal predecessors, (851), 0 states have call successors, (0), 0 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:39:09,994 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:09,994 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:10,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 22:39:10,194 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,SelfDestructingSolverStorable10 [2025-03-14 22:39:10,195 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 22:39:10,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:10,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1247259733, now seen corresponding path program 2 times [2025-03-14 22:39:10,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:10,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143422832] [2025-03-14 22:39:10,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:10,220 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:10,221 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:10,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:10,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143422832] [2025-03-14 22:39:10,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143422832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:10,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077353741] [2025-03-14 22:39:10,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:10,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:10,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:10,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:39:10,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 22:39:10,549 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:10,549 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:10,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-14 22:39:10,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:10,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077353741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:10,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:10,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2025-03-14 22:39:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508144279] [2025-03-14 22:39:10,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:10,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:39:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:10,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:39:10,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:39:10,834 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 102 [2025-03-14 22:39:10,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 652 transitions, 13059 flow. Second operand has 12 states, 12 states have (on average 77.16666666666667) internal successors, (926), 12 states have internal predecessors, (926), 0 states have call successors, (0), 0 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:39:10,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:10,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 102 [2025-03-14 22:39:10,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:11,783 INFO L124 PetriNetUnfolderBase]: 1838/5336 cut-off events. [2025-03-14 22:39:11,783 INFO L125 PetriNetUnfolderBase]: For 75487/77387 co-relation queries the response was YES. [2025-03-14 22:39:11,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31760 conditions, 5336 events. 1838/5336 cut-off events. For 75487/77387 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 49478 event pairs, 202 based on Foata normal form. 160/5045 useless extension candidates. Maximal degree in co-relation 23788. Up to 2251 conditions per place. [2025-03-14 22:39:11,831 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 382 selfloop transitions, 186 changer transitions 29/779 dead transitions. [2025-03-14 22:39:11,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 779 transitions, 17230 flow [2025-03-14 22:39:11,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:39:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:39:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1348 transitions. [2025-03-14 22:39:11,834 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7773933102652826 [2025-03-14 22:39:11,835 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 85 predicate places. [2025-03-14 22:39:11,835 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 779 transitions, 17230 flow [2025-03-14 22:39:11,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.16666666666667) internal successors, (926), 12 states have internal predecessors, (926), 0 states have call successors, (0), 0 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:39:11,835 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:11,835 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:11,843 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 22:39:12,040 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,SelfDestructingSolverStorable11 [2025-03-14 22:39:12,040 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 22:39:12,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash 890114257, now seen corresponding path program 3 times [2025-03-14 22:39:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:12,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195722786] [2025-03-14 22:39:12,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:39:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:12,082 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:39:12,083 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:12,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195722786] [2025-03-14 22:39:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195722786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:12,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613205117] [2025-03-14 22:39:12,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:39:12,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:12,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:12,271 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 22:39:12,273 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 22:39:12,317 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:39:12,317 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:12,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-14 22:39:12,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:12,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613205117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:12,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:12,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2025-03-14 22:39:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940203854] [2025-03-14 22:39:12,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:12,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:39:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:12,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:39:12,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:39:12,602 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 102 [2025-03-14 22:39:12,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 779 transitions, 17230 flow. Second operand has 11 states, 11 states have (on average 77.36363636363636) internal successors, (851), 11 states have internal predecessors, (851), 0 states have call successors, (0), 0 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:39:12,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:12,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 102 [2025-03-14 22:39:12,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:13,479 INFO L124 PetriNetUnfolderBase]: 2086/6014 cut-off events. [2025-03-14 22:39:13,479 INFO L125 PetriNetUnfolderBase]: For 99150/101420 co-relation queries the response was YES. [2025-03-14 22:39:13,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37303 conditions, 6014 events. 2086/6014 cut-off events. For 99150/101420 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 57169 event pairs, 248 based on Foata normal form. 128/5630 useless extension candidates. Maximal degree in co-relation 33769. Up to 2534 conditions per place. [2025-03-14 22:39:13,577 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 561 selfloop transitions, 94 changer transitions 36/873 dead transitions. [2025-03-14 22:39:13,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 873 transitions, 20937 flow [2025-03-14 22:39:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:39:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:39:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1186 transitions. [2025-03-14 22:39:13,580 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7751633986928105 [2025-03-14 22:39:13,580 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 99 predicate places. [2025-03-14 22:39:13,581 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 873 transitions, 20937 flow [2025-03-14 22:39:13,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 77.36363636363636) internal successors, (851), 11 states have internal predecessors, (851), 0 states have call successors, (0), 0 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:39:13,581 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:13,581 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:13,587 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 22:39:13,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:13,782 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 22:39:13,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1950100945, now seen corresponding path program 4 times [2025-03-14 22:39:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:13,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701120536] [2025-03-14 22:39:13,782 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:39:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:13,814 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:39:13,815 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:14,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:14,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701120536] [2025-03-14 22:39:14,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701120536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:14,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654953541] [2025-03-14 22:39:14,001 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:39:14,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:14,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:14,003 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 22:39:14,005 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 22:39:14,045 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:39:14,045 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:14,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-14 22:39:14,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:14,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:14,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654953541] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:14,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:14,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2025-03-14 22:39:14,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012993711] [2025-03-14 22:39:14,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:14,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:39:14,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:14,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:39:14,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:39:14,300 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 102 [2025-03-14 22:39:14,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 873 transitions, 20937 flow. Second operand has 12 states, 12 states have (on average 77.16666666666667) internal successors, (926), 12 states have internal predecessors, (926), 0 states have call successors, (0), 0 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:39:14,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:14,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 102 [2025-03-14 22:39:14,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:15,711 INFO L124 PetriNetUnfolderBase]: 2856/8469 cut-off events. [2025-03-14 22:39:15,711 INFO L125 PetriNetUnfolderBase]: For 157670/160858 co-relation queries the response was YES. [2025-03-14 22:39:15,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53928 conditions, 8469 events. 2856/8469 cut-off events. For 157670/160858 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 86782 event pairs, 357 based on Foata normal form. 233/7970 useless extension candidates. Maximal degree in co-relation 38563. Up to 3521 conditions per place. [2025-03-14 22:39:15,778 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 671 selfloop transitions, 217 changer transitions 46/1116 dead transitions. [2025-03-14 22:39:15,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 1116 transitions, 29697 flow [2025-03-14 22:39:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:39:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:39:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1350 transitions. [2025-03-14 22:39:15,780 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7785467128027682 [2025-03-14 22:39:15,780 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 115 predicate places. [2025-03-14 22:39:15,780 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 1116 transitions, 29697 flow [2025-03-14 22:39:15,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.16666666666667) internal successors, (926), 12 states have internal predecessors, (926), 0 states have call successors, (0), 0 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:39:15,780 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:15,780 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:15,786 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 22:39:15,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:15,981 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 22:39:15,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1527712561, now seen corresponding path program 5 times [2025-03-14 22:39:15,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175283601] [2025-03-14 22:39:15,982 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:39:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:16,002 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:16,002 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175283601] [2025-03-14 22:39:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175283601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435434509] [2025-03-14 22:39:16,443 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:39:16,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:16,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:16,444 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 22:39:16,446 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 22:39:16,490 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:16,490 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:16,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-14 22:39:16,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:16,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:16,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435434509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:16,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:16,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2025-03-14 22:39:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102084808] [2025-03-14 22:39:16,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:16,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 22:39:16,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:16,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 22:39:16,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-14 22:39:16,785 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 102 [2025-03-14 22:39:16,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 1116 transitions, 29697 flow. Second operand has 17 states, 17 states have (on average 72.6470588235294) internal successors, (1235), 17 states have internal predecessors, (1235), 0 states have call successors, (0), 0 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:39:16,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:16,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 102 [2025-03-14 22:39:16,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:19,164 INFO L124 PetriNetUnfolderBase]: 3728/11168 cut-off events. [2025-03-14 22:39:19,164 INFO L125 PetriNetUnfolderBase]: For 221973/227438 co-relation queries the response was YES. [2025-03-14 22:39:19,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73257 conditions, 11168 events. 3728/11168 cut-off events. For 221973/227438 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 120038 event pairs, 480 based on Foata normal form. 382/10593 useless extension candidates. Maximal degree in co-relation 52215. Up to 4750 conditions per place. [2025-03-14 22:39:19,257 INFO L140 encePairwiseOnDemand]: 81/102 looper letters, 1107 selfloop transitions, 130 changer transitions 64/1471 dead transitions. [2025-03-14 22:39:19,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 1471 transitions, 42299 flow [2025-03-14 22:39:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 22:39:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 22:39:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1868 transitions. [2025-03-14 22:39:19,261 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7325490196078431 [2025-03-14 22:39:19,261 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 139 predicate places. [2025-03-14 22:39:19,261 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 1471 transitions, 42299 flow [2025-03-14 22:39:19,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 72.6470588235294) internal successors, (1235), 17 states have internal predecessors, (1235), 0 states have call successors, (0), 0 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:39:19,262 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:19,262 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:19,268 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 22:39:19,462 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,SelfDestructingSolverStorable14 [2025-03-14 22:39:19,462 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 22:39:19,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash -119433737, now seen corresponding path program 6 times [2025-03-14 22:39:19,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:19,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028527810] [2025-03-14 22:39:19,463 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:39:19,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:19,491 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 22:39:19,491 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:19,736 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 22:39:19,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028527810] [2025-03-14 22:39:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028527810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474093255] [2025-03-14 22:39:19,737 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:39:19,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:19,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:19,739 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 22:39:19,740 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 22:39:19,793 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 22:39:19,793 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:19,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-14 22:39:19,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:19,936 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 22:39:19,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:20,054 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 22:39:20,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474093255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:20,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:20,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2025-03-14 22:39:20,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749848972] [2025-03-14 22:39:20,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:20,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:39:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:20,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:39:20,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:39:20,056 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 102 [2025-03-14 22:39:20,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 1471 transitions, 42299 flow. Second operand has 12 states, 12 states have (on average 77.16666666666667) internal successors, (926), 12 states have internal predecessors, (926), 0 states have call successors, (0), 0 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:39:20,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:20,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 102 [2025-03-14 22:39:20,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:22,806 INFO L124 PetriNetUnfolderBase]: 4250/12867 cut-off events. [2025-03-14 22:39:22,806 INFO L125 PetriNetUnfolderBase]: For 286472/292432 co-relation queries the response was YES. [2025-03-14 22:39:22,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86951 conditions, 12867 events. 4250/12867 cut-off events. For 286472/292432 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 142020 event pairs, 556 based on Foata normal form. 222/11984 useless extension candidates. Maximal degree in co-relation 61367. Up to 5470 conditions per place. [2025-03-14 22:39:22,895 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 1208 selfloop transitions, 202 changer transitions 79/1690 dead transitions. [2025-03-14 22:39:22,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 1690 transitions, 52112 flow [2025-03-14 22:39:22,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:39:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:39:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1348 transitions. [2025-03-14 22:39:22,898 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7773933102652826 [2025-03-14 22:39:22,898 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 155 predicate places. [2025-03-14 22:39:22,898 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 1690 transitions, 52112 flow [2025-03-14 22:39:22,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.16666666666667) internal successors, (926), 12 states have internal predecessors, (926), 0 states have call successors, (0), 0 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:39:22,898 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:22,899 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 22:39:22,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 22:39:23,100 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,SelfDestructingSolverStorable15 [2025-03-14 22:39:23,100 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 22:39:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash -667130257, now seen corresponding path program 7 times [2025-03-14 22:39:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241468445] [2025-03-14 22:39:23,101 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:39:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:23,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:23,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241468445] [2025-03-14 22:39:23,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241468445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:23,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206655530] [2025-03-14 22:39:23,293 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:39:23,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:23,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:23,295 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 22:39:23,297 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 22:39:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:23,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-14 22:39:23,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:23,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206655530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:23,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2025-03-14 22:39:23,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075576883] [2025-03-14 22:39:23,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:23,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:39:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:23,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:39:23,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:39:23,577 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 102 [2025-03-14 22:39:23,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 1690 transitions, 52112 flow. Second operand has 12 states, 12 states have (on average 77.16666666666667) internal successors, (926), 12 states have internal predecessors, (926), 0 states have call successors, (0), 0 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:39:23,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:23,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 102 [2025-03-14 22:39:23,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:27,005 INFO L124 PetriNetUnfolderBase]: 4490/13506 cut-off events. [2025-03-14 22:39:27,005 INFO L125 PetriNetUnfolderBase]: For 342635/349266 co-relation queries the response was YES. [2025-03-14 22:39:27,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94526 conditions, 13506 events. 4490/13506 cut-off events. For 342635/349266 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 150481 event pairs, 580 based on Foata normal form. 382/12731 useless extension candidates. Maximal degree in co-relation 65991. Up to 5801 conditions per place. [2025-03-14 22:39:27,114 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 1158 selfloop transitions, 377 changer transitions 94/1830 dead transitions. [2025-03-14 22:39:27,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 1830 transitions, 59918 flow [2025-03-14 22:39:27,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:39:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:39:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1350 transitions. [2025-03-14 22:39:27,119 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7785467128027682 [2025-03-14 22:39:27,120 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 171 predicate places. [2025-03-14 22:39:27,120 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 1830 transitions, 59918 flow [2025-03-14 22:39:27,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.16666666666667) internal successors, (926), 12 states have internal predecessors, (926), 0 states have call successors, (0), 0 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:39:27,120 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:27,120 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-14 22:39:27,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-14 22:39:27,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:27,321 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 22:39:27,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1636032423, now seen corresponding path program 8 times [2025-03-14 22:39:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699277661] [2025-03-14 22:39:27,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:27,336 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:27,336 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:39:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:27,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699277661] [2025-03-14 22:39:27,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699277661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:27,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041284964] [2025-03-14 22:39:27,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:27,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:27,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:27,834 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 22:39:27,835 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 22:39:27,906 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:27,906 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:27,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 22:39:27,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:28,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:29,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041284964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:29,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:29,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 38 [2025-03-14 22:39:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232708646] [2025-03-14 22:39:29,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:29,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-14 22:39:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:29,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-14 22:39:29,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2025-03-14 22:39:29,322 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2025-03-14 22:39:29,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 1830 transitions, 59918 flow. Second operand has 38 states, 38 states have (on average 65.8157894736842) internal successors, (2501), 38 states have internal predecessors, (2501), 0 states have call successors, (0), 0 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:39:29,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:29,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2025-03-14 22:39:29,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:41:02,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:41:06,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:41:28,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:41:33,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:41:43,915 WARN L286 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 45 DAG size of output: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 22:42:11,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:42:13,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:42:16,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:42:19,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:42:37,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:42:41,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:42:53,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:42:57,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:43:13,656 INFO L124 PetriNetUnfolderBase]: 23818/69839 cut-off events. [2025-03-14 22:43:13,656 INFO L125 PetriNetUnfolderBase]: For 1713215/1747044 co-relation queries the response was YES. [2025-03-14 22:43:14,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517338 conditions, 69839 events. 23818/69839 cut-off events. For 1713215/1747044 co-relation queries the response was YES. Maximal size of possible extension queue 2389. Compared 949538 event pairs, 454 based on Foata normal form. 1066/65723 useless extension candidates. Maximal degree in co-relation 363688. Up to 30641 conditions per place. [2025-03-14 22:43:14,469 INFO L140 encePairwiseOnDemand]: 81/102 looper letters, 8413 selfloop transitions, 783 changer transitions 740/10070 dead transitions. [2025-03-14 22:43:14,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 10070 transitions, 348285 flow [2025-03-14 22:43:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2025-03-14 22:43:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2025-03-14 22:43:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 15294 transitions. [2025-03-14 22:43:14,478 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6634565330557002 [2025-03-14 22:43:14,478 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 396 predicate places. [2025-03-14 22:43:14,478 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 10070 transitions, 348285 flow [2025-03-14 22:43:14,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 65.8157894736842) internal successors, (2501), 38 states have internal predecessors, (2501), 0 states have call successors, (0), 0 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:43:14,479 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:43:14,479 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-14 22:43:14,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-14 22:43:14,680 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,SelfDestructingSolverStorable17 [2025-03-14 22:43:14,680 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 22:43:14,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:43:14,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1113422211, now seen corresponding path program 9 times [2025-03-14 22:43:14,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:43:14,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90232407] [2025-03-14 22:43:14,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:43:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:43:14,699 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 22:43:14,699 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:43:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:43:15,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:43:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90232407] [2025-03-14 22:43:15,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90232407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:43:15,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390294869] [2025-03-14 22:43:15,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:43:15,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:43:15,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:43:15,250 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 22:43:15,251 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 22:43:15,363 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 22:43:15,364 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:43:15,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 22:43:15,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:43:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:43:16,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:43:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:43:17,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390294869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:43:17,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:43:17,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 34 [2025-03-14 22:43:17,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634031793] [2025-03-14 22:43:17,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:43:17,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 22:43:17,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:43:17,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 22:43:17,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 22:43:17,034 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2025-03-14 22:43:17,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 10070 transitions, 348285 flow. Second operand has 34 states, 34 states have (on average 65.61764705882354) internal successors, (2231), 34 states have internal predecessors, (2231), 0 states have call successors, (0), 0 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:43:17,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:43:17,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2025-03-14 22:43:17,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:46:09,224 INFO L124 PetriNetUnfolderBase]: 23965/70849 cut-off events. [2025-03-14 22:46:09,224 INFO L125 PetriNetUnfolderBase]: For 1927980/1964179 co-relation queries the response was YES. [2025-03-14 22:46:09,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572434 conditions, 70849 events. 23965/70849 cut-off events. For 1927980/1964179 co-relation queries the response was YES. Maximal size of possible extension queue 2399. Compared 969418 event pairs, 438 based on Foata normal form. 996/66669 useless extension candidates. Maximal degree in co-relation 524542. Up to 37906 conditions per place. [2025-03-14 22:46:10,401 INFO L140 encePairwiseOnDemand]: 80/102 looper letters, 9574 selfloop transitions, 184 changer transitions 1055/10947 dead transitions. [2025-03-14 22:46:10,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 10947 transitions, 401175 flow [2025-03-14 22:46:10,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-14 22:46:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-14 22:46:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2237 transitions. [2025-03-14 22:46:10,411 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6645870469399882 [2025-03-14 22:46:10,411 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 428 predicate places. [2025-03-14 22:46:10,412 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 10947 transitions, 401175 flow [2025-03-14 22:46:10,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 65.61764705882354) internal successors, (2231), 34 states have internal predecessors, (2231), 0 states have call successors, (0), 0 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:46:10,413 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:46:10,413 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-14 22:46:10,420 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 22:46:10,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:46:10,619 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 22:46:10,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:46:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash -246777025, now seen corresponding path program 10 times [2025-03-14 22:46:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:46:10,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535482348] [2025-03-14 22:46:10,620 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:46:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:46:10,802 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:46:10,802 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:46:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:46:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:46:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535482348] [2025-03-14 22:46:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535482348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:46:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490383821] [2025-03-14 22:46:11,683 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:46:11,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:46:11,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:46:11,688 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 22:46:11,689 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 22:46:11,815 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:46:11,815 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:46:11,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 22:46:11,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:46:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:46:12,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:46:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:46:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490383821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:46:13,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:46:13,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2025-03-14 22:46:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560577446] [2025-03-14 22:46:13,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:46:13,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-14 22:46:13,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:46:13,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-14 22:46:13,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1284, Unknown=0, NotChecked=0, Total=1406 [2025-03-14 22:46:13,232 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 102 [2025-03-14 22:46:13,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 10947 transitions, 401175 flow. Second operand has 38 states, 38 states have (on average 62.026315789473685) internal successors, (2357), 38 states have internal predecessors, (2357), 0 states have call successors, (0), 0 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:46:13,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:46:13,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 102 [2025-03-14 22:46:13,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:46:21,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:46:23,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:46:25,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:46:27,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:46:33,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:46:38,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:46:40,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:46:43,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:46:45,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:46:48,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:48:08,042 WARN L286 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 74 DAG size of output: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 22:48:30,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:48:43,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:49:01,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:49:15,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:49:17,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:49:19,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:49:21,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:49:48,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:49:50,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:49:52,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:49:54,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:49:56,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:50:09,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:50:18,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:50:29,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:50:44,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 22:50:53,907 WARN L286 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 80 DAG size of output: 80 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2025-03-14 22:52:49,610 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:52:49,610 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 22:52:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2025-03-14 22:52:50,139 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 22:52:50,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-14 22:52:50,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:52:50,348 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (38states, 59/102 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 613388 conditions, 71249 events (25694/71248 cut-off events. For 2330229/2346839 co-relation queries the response was YES. Maximal size of possible extension queue 3596. Compared 1023755 event pairs, 631 based on Foata normal form. 1426/71946 useless extension candidates. Maximal degree in co-relation 493336. Up to 42458 conditions per place.). [2025-03-14 22:52:50,358 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 22:52:50,358 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 22:52:50,358 INFO L422 BasicCegarLoop]: Path program histogram: [10, 2, 2, 2, 1, 1, 1, 1] [2025-03-14 22:52:50,376 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 22:52:50,376 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 22:52:50,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 10:52:50 BasicIcfg [2025-03-14 22:52:50,389 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 22:52:50,390 INFO L158 Benchmark]: Toolchain (without parser) took 827426.95ms. Allocated memory was 71.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 44.3MB in the beginning and 1.0GB in the end (delta: -962.3MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-03-14 22:52:50,390 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:52:50,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.20ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 32.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 22:52:50,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.55ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 31.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:52:50,399 INFO L158 Benchmark]: Boogie Preprocessor took 13.77ms. Allocated memory is still 71.3MB. Free memory was 31.3MB in the beginning and 30.4MB in the end (delta: 928.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 22:52:50,399 INFO L158 Benchmark]: RCFGBuilder took 303.18ms. Allocated memory is still 71.3MB. Free memory was 30.4MB in the beginning and 44.5MB in the end (delta: -14.2MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2025-03-14 22:52:50,400 INFO L158 Benchmark]: TraceAbstraction took 826906.93ms. Allocated memory was 71.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 43.6MB in the beginning and 1.0GB in the end (delta: -963.1MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-03-14 22:52:50,404 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.16ms. Allocated memory is still 71.3MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.20ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 32.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.55ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 31.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 13.77ms. Allocated memory is still 71.3MB. Free memory was 31.3MB in the beginning and 30.4MB in the end (delta: 928.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 303.18ms. Allocated memory is still 71.3MB. Free memory was 30.4MB in the beginning and 44.5MB in the end (delta: -14.2MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. * TraceAbstraction took 826906.93ms. Allocated memory was 71.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 43.6MB in the beginning and 1.0GB in the end (delta: -963.1MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (38states, 59/102 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 613388 conditions, 71249 events (25694/71248 cut-off events. For 2330229/2346839 co-relation queries the response was YES. Maximal size of possible extension queue 3596. Compared 1023755 event pairs, 631 based on Foata normal form. 1426/71946 useless extension candidates. Maximal degree in co-relation 493336. Up to 42458 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (38states, 59/102 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 613388 conditions, 71249 events (25694/71248 cut-off events. For 2330229/2346839 co-relation queries the response was YES. Maximal size of possible extension queue 3596. Compared 1023755 event pairs, 631 based on Foata normal form. 1426/71946 useless extension candidates. Maximal degree in co-relation 493336. Up to 42458 conditions per place.). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (38states, 59/102 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 613388 conditions, 71249 events (25694/71248 cut-off events. For 2330229/2346839 co-relation queries the response was YES. Maximal size of possible extension queue 3596. Compared 1023755 event pairs, 631 based on Foata normal form. 1426/71946 useless extension candidates. Maximal degree in co-relation 493336. Up to 42458 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 125 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: 826.8s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 810.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 mSolverCounterUnknown, 3439 SdHoareTripleChecker+Valid, 100.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3439 mSDsluCounter, 4873 SdHoareTripleChecker+Invalid, 98.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4332 mSDsCounter, 440 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14169 IncrementalHoareTripleChecker+Invalid, 14642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 440 mSolverCounterUnsat, 541 mSDtfsCounter, 14169 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2724 GetRequests, 1970 SyntacticMatches, 61 SemanticMatches, 693 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38603 ImplicationChecksByTransitivity, 315.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=401175occurred in iteration=19, InterpolantAutomatonStates: 454, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 2930 NumberOfCodeBlocks, 2922 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3921 ConstructedInterpolants, 0 QuantifiedInterpolants, 18935 SizeOfPredicates, 114 NumberOfNonLiveVariables, 1956 ConjunctsInSsa, 231 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 90/324 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