/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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/pthread/triangular-longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:26:39,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:26:39,671 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-15 01:26:39,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:26:39,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:26:39,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:26:39,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:26:39,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:26:39,696 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:26:39,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:26:39,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:26:39,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:26:39,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:26:39,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:26:39,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:26:39,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:26:39,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:26:39,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:26:39,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:26:39,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:26:39,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:26:39,698 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 01:26:39,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:26:39,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:26:39,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:26:39,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:26:39,960 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:26:39,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-1.i [2025-03-15 01:26:41,110 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1892ac258/5181a7d2891b44b79bbbad3f355f8461/FLAG2f86ab144 [2025-03-15 01:26:41,351 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:26:41,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-1.i [2025-03-15 01:26:41,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1892ac258/5181a7d2891b44b79bbbad3f355f8461/FLAG2f86ab144 [2025-03-15 01:26:41,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1892ac258/5181a7d2891b44b79bbbad3f355f8461 [2025-03-15 01:26:41,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:26:41,386 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:26:41,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:26:41,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:26:41,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:26:41,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a05fd6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41, skipping insertion in model container [2025-03-15 01:26:41,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:26:41,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:26:41,629 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:26:41,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:26:41,693 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:26:41,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41 WrapperNode [2025-03-15 01:26:41,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:26:41,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:26:41,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:26:41,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:26:41,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,724 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-15 01:26:41,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:26:41,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:26:41,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:26:41,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:26:41,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:26:41,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:26:41,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:26:41,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:26:41,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (1/1) ... [2025-03-15 01:26:41,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:26:41,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:41,775 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-15 01:26:41,778 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-15 01:26:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 01:26:41,807 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 01:26:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 01:26:41,807 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 01:26:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:26:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:26:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:26:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:26:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:26:41,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:26:41,808 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:26:41,911 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:26:41,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:26:42,028 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:26:42,028 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:26:42,050 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:26:42,051 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:26:42,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:26:42 BoogieIcfgContainer [2025-03-15 01:26:42,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:26:42,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:26:42,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:26:42,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:26:42,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:26:41" (1/3) ... [2025-03-15 01:26:42,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7b3fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:26:42, skipping insertion in model container [2025-03-15 01:26:42,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:26:41" (2/3) ... [2025-03-15 01:26:42,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7b3fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:26:42, skipping insertion in model container [2025-03-15 01:26:42,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:26:42" (3/3) ... [2025-03-15 01:26:42,059 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2025-03-15 01:26:42,072 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:26:42,074 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-1.i that has 3 procedures, 74 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 01:26:42,074 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:26:42,114 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:26:42,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:26:42,158 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;@61975a57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:26:42,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-15 01:26:42,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:26:42,181 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-15 01:26:42,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:26:42,185 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:42,186 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] [2025-03-15 01:26:42,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:42,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1860772315, now seen corresponding path program 1 times [2025-03-15 01:26:42,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:42,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66802382] [2025-03-15 01:26:42,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:42,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:42,406 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-15 01:26:42,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:42,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66802382] [2025-03-15 01:26:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66802382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:42,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:42,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:26:42,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137419601] [2025-03-15 01:26:42,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:42,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:26:42,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:42,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:26:42,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:26:42,436 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:26:42,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-15 01:26:42,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:42,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:26:42,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:42,570 INFO L124 PetriNetUnfolderBase]: 90/374 cut-off events. [2025-03-15 01:26:42,570 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 01:26:42,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 374 events. 90/374 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2147 event pairs, 23 based on Foata normal form. 44/301 useless extension candidates. Maximal degree in co-relation 497. Up to 69 conditions per place. [2025-03-15 01:26:42,582 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 13 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-15 01:26:42,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 192 flow [2025-03-15 01:26:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-03-15 01:26:42,591 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2025-03-15 01:26:42,593 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, -2 predicate places. [2025-03-15 01:26:42,593 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 192 flow [2025-03-15 01:26:42,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-15 01:26:42,593 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:42,593 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] [2025-03-15 01:26:42,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:26:42,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:42,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:42,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1860772316, now seen corresponding path program 1 times [2025-03-15 01:26:42,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:42,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418134932] [2025-03-15 01:26:42,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:42,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:42,672 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-15 01:26:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:42,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418134932] [2025-03-15 01:26:42,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418134932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:42,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:42,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:26:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167556903] [2025-03-15 01:26:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:42,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:26:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:42,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:26:42,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:26:42,676 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:26:42,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-15 01:26:42,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:42,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:26:42,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:42,757 INFO L124 PetriNetUnfolderBase]: 75/359 cut-off events. [2025-03-15 01:26:42,757 INFO L125 PetriNetUnfolderBase]: For 33/55 co-relation queries the response was YES. [2025-03-15 01:26:42,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 359 events. 75/359 cut-off events. For 33/55 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1874 event pairs, 10 based on Foata normal form. 6/261 useless extension candidates. Maximal degree in co-relation 591. Up to 76 conditions per place. [2025-03-15 01:26:42,765 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 19 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2025-03-15 01:26:42,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 266 flow [2025-03-15 01:26:42,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2025-03-15 01:26:42,769 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9004329004329005 [2025-03-15 01:26:42,770 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places. [2025-03-15 01:26:42,770 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 266 flow [2025-03-15 01:26:42,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-15 01:26:42,770 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:42,770 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] [2025-03-15 01:26:42,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:26:42,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:42,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1495807743, now seen corresponding path program 1 times [2025-03-15 01:26:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:42,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477080585] [2025-03-15 01:26:42,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:42,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:42,831 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-15 01:26:42,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:42,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477080585] [2025-03-15 01:26:42,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477080585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:42,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:42,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:42,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682857498] [2025-03-15 01:26:42,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:42,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:42,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:42,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:42,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:42,833 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:42,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 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-15 01:26:42,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:42,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:42,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:43,053 INFO L124 PetriNetUnfolderBase]: 322/937 cut-off events. [2025-03-15 01:26:43,053 INFO L125 PetriNetUnfolderBase]: For 426/565 co-relation queries the response was YES. [2025-03-15 01:26:43,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 937 events. 322/937 cut-off events. For 426/565 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6795 event pairs, 122 based on Foata normal form. 4/604 useless extension candidates. Maximal degree in co-relation 2315. Up to 350 conditions per place. [2025-03-15 01:26:43,067 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 62 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-03-15 01:26:43,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 605 flow [2025-03-15 01:26:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2025-03-15 01:26:43,069 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.825974025974026 [2025-03-15 01:26:43,070 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 4 predicate places. [2025-03-15 01:26:43,070 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 121 transitions, 605 flow [2025-03-15 01:26:43,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 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-15 01:26:43,070 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:43,070 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:43,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:26:43,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:43,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1676875667, now seen corresponding path program 1 times [2025-03-15 01:26:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437406079] [2025-03-15 01:26:43,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:43,134 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-15 01:26:43,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:43,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437406079] [2025-03-15 01:26:43,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437406079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:43,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:43,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:26:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971752655] [2025-03-15 01:26:43,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:43,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:26:43,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:43,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:26:43,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:26:43,136 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:26:43,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 121 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-15 01:26:43,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:43,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:26:43,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:43,277 INFO L124 PetriNetUnfolderBase]: 481/1386 cut-off events. [2025-03-15 01:26:43,277 INFO L125 PetriNetUnfolderBase]: For 1262/1491 co-relation queries the response was YES. [2025-03-15 01:26:43,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 1386 events. 481/1386 cut-off events. For 1262/1491 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11433 event pairs, 89 based on Foata normal form. 15/939 useless extension candidates. Maximal degree in co-relation 3913. Up to 546 conditions per place. [2025-03-15 01:26:43,288 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 49 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2025-03-15 01:26:43,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 837 flow [2025-03-15 01:26:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-15 01:26:43,290 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-15 01:26:43,290 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2025-03-15 01:26:43,290 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 134 transitions, 837 flow [2025-03-15 01:26:43,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-15 01:26:43,291 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:43,291 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] [2025-03-15 01:26:43,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:26:43,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:43,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1676875666, now seen corresponding path program 1 times [2025-03-15 01:26:43,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:43,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874668945] [2025-03-15 01:26:43,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:43,354 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-15 01:26:43,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:43,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874668945] [2025-03-15 01:26:43,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874668945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:43,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:43,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:26:43,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181431699] [2025-03-15 01:26:43,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:43,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:26:43,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:43,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:26:43,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:26:43,355 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:26:43,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 134 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-15 01:26:43,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:43,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:26:43,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:43,481 INFO L124 PetriNetUnfolderBase]: 482/1292 cut-off events. [2025-03-15 01:26:43,481 INFO L125 PetriNetUnfolderBase]: For 1928/2239 co-relation queries the response was YES. [2025-03-15 01:26:43,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 1292 events. 482/1292 cut-off events. For 1928/2239 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9783 event pairs, 110 based on Foata normal form. 12/870 useless extension candidates. Maximal degree in co-relation 4229. Up to 633 conditions per place. [2025-03-15 01:26:43,492 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 49 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2025-03-15 01:26:43,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 134 transitions, 953 flow [2025-03-15 01:26:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:26:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:26:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-15 01:26:43,493 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-15 01:26:43,494 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2025-03-15 01:26:43,495 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 134 transitions, 953 flow [2025-03-15 01:26:43,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-15 01:26:43,495 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:43,496 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] [2025-03-15 01:26:43,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:26:43,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:43,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash 864787734, now seen corresponding path program 1 times [2025-03-15 01:26:43,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:43,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050350137] [2025-03-15 01:26:43,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:43,562 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-15 01:26:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:43,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050350137] [2025-03-15 01:26:43,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050350137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:43,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:43,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:43,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430816753] [2025-03-15 01:26:43,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:43,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:43,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:43,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:43,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:43,563 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:43,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 134 transitions, 953 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-15 01:26:43,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:43,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:43,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:43,796 INFO L124 PetriNetUnfolderBase]: 951/2226 cut-off events. [2025-03-15 01:26:43,797 INFO L125 PetriNetUnfolderBase]: For 7090/7459 co-relation queries the response was YES. [2025-03-15 01:26:43,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9088 conditions, 2226 events. 951/2226 cut-off events. For 7090/7459 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 18426 event pairs, 244 based on Foata normal form. 30/1345 useless extension candidates. Maximal degree in co-relation 9049. Up to 998 conditions per place. [2025-03-15 01:26:43,816 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 92 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2025-03-15 01:26:43,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 160 transitions, 1397 flow [2025-03-15 01:26:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2025-03-15 01:26:43,817 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2025-03-15 01:26:43,818 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2025-03-15 01:26:43,818 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 160 transitions, 1397 flow [2025-03-15 01:26:43,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-15 01:26:43,818 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:43,818 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:43,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:26:43,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:43,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1597002897, now seen corresponding path program 1 times [2025-03-15 01:26:43,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:43,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501149965] [2025-03-15 01:26:43,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:43,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:43,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501149965] [2025-03-15 01:26:43,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501149965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:43,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729580560] [2025-03-15 01:26:43,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:43,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:43,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:43,902 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-15 01:26:43,903 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-15 01:26:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:43,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:26:43,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:44,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:26:44,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729580560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:44,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:26:44,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-15 01:26:44,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459623409] [2025-03-15 01:26:44,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:44,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:26:44,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:44,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:26:44,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:26:44,023 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:44,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 160 transitions, 1397 flow. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 0 states have call successors, (0), 0 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-15 01:26:44,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:44,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:44,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:44,279 INFO L124 PetriNetUnfolderBase]: 920/2295 cut-off events. [2025-03-15 01:26:44,279 INFO L125 PetriNetUnfolderBase]: For 8736/9999 co-relation queries the response was YES. [2025-03-15 01:26:44,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10261 conditions, 2295 events. 920/2295 cut-off events. For 8736/9999 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19036 event pairs, 186 based on Foata normal form. 49/1502 useless extension candidates. Maximal degree in co-relation 10220. Up to 1045 conditions per place. [2025-03-15 01:26:44,308 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 103 selfloop transitions, 6 changer transitions 0/173 dead transitions. [2025-03-15 01:26:44,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 173 transitions, 1813 flow [2025-03-15 01:26:44,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:26:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:26:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2025-03-15 01:26:44,310 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.801948051948052 [2025-03-15 01:26:44,310 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 14 predicate places. [2025-03-15 01:26:44,310 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 173 transitions, 1813 flow [2025-03-15 01:26:44,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 0 states have call successors, (0), 0 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-15 01:26:44,311 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:44,311 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] [2025-03-15 01:26:44,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 01:26:44,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:44,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:44,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 88120632, now seen corresponding path program 1 times [2025-03-15 01:26:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:44,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808008742] [2025-03-15 01:26:44,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:44,561 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-15 01:26:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808008742] [2025-03-15 01:26:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808008742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:44,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:44,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570009732] [2025-03-15 01:26:44,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:44,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:44,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:44,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:44,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:44,562 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:44,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 173 transitions, 1813 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-15 01:26:44,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:44,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:44,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:44,865 INFO L124 PetriNetUnfolderBase]: 1196/2954 cut-off events. [2025-03-15 01:26:44,866 INFO L125 PetriNetUnfolderBase]: For 15692/17010 co-relation queries the response was YES. [2025-03-15 01:26:44,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14369 conditions, 2954 events. 1196/2954 cut-off events. For 15692/17010 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25474 event pairs, 221 based on Foata normal form. 8/1914 useless extension candidates. Maximal degree in co-relation 14324. Up to 1567 conditions per place. [2025-03-15 01:26:44,895 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 89 selfloop transitions, 44 changer transitions 0/203 dead transitions. [2025-03-15 01:26:44,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 203 transitions, 2469 flow [2025-03-15 01:26:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2025-03-15 01:26:44,897 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2025-03-15 01:26:44,897 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2025-03-15 01:26:44,897 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 203 transitions, 2469 flow [2025-03-15 01:26:44,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-15 01:26:44,898 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:44,898 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] [2025-03-15 01:26:44,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:26:44,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:44,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1521756979, now seen corresponding path program 1 times [2025-03-15 01:26:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:44,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776956435] [2025-03-15 01:26:44,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:44,965 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-15 01:26:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:44,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776956435] [2025-03-15 01:26:44,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776956435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:44,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:44,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111216609] [2025-03-15 01:26:44,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:44,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:44,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:44,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:44,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:44,967 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:44,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 203 transitions, 2469 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-15 01:26:44,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:44,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:44,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:45,230 INFO L124 PetriNetUnfolderBase]: 1125/2943 cut-off events. [2025-03-15 01:26:45,230 INFO L125 PetriNetUnfolderBase]: For 26303/27999 co-relation queries the response was YES. [2025-03-15 01:26:45,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15324 conditions, 2943 events. 1125/2943 cut-off events. For 26303/27999 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26108 event pairs, 262 based on Foata normal form. 17/1981 useless extension candidates. Maximal degree in co-relation 15275. Up to 1522 conditions per place. [2025-03-15 01:26:45,249 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 118 selfloop transitions, 26 changer transitions 0/214 dead transitions. [2025-03-15 01:26:45,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 214 transitions, 2825 flow [2025-03-15 01:26:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2025-03-15 01:26:45,252 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8883116883116883 [2025-03-15 01:26:45,252 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 22 predicate places. [2025-03-15 01:26:45,253 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 214 transitions, 2825 flow [2025-03-15 01:26:45,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-15 01:26:45,253 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:45,253 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] [2025-03-15 01:26:45,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:26:45,253 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:45,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash 499182071, now seen corresponding path program 1 times [2025-03-15 01:26:45,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:45,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065052567] [2025-03-15 01:26:45,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:45,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:45,297 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-15 01:26:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065052567] [2025-03-15 01:26:45,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065052567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:45,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:45,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:45,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898506943] [2025-03-15 01:26:45,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:45,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:45,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:45,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:45,299 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:45,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 214 transitions, 2825 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-15 01:26:45,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:45,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:45,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:45,509 INFO L124 PetriNetUnfolderBase]: 949/2572 cut-off events. [2025-03-15 01:26:45,510 INFO L125 PetriNetUnfolderBase]: For 35134/37087 co-relation queries the response was YES. [2025-03-15 01:26:45,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13991 conditions, 2572 events. 949/2572 cut-off events. For 35134/37087 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 22199 event pairs, 211 based on Foata normal form. 8/1824 useless extension candidates. Maximal degree in co-relation 13938. Up to 1240 conditions per place. [2025-03-15 01:26:45,531 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 110 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-03-15 01:26:45,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 182 transitions, 2499 flow [2025-03-15 01:26:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:26:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:26:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-03-15 01:26:45,532 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2025-03-15 01:26:45,533 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 22 predicate places. [2025-03-15 01:26:45,533 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 182 transitions, 2499 flow [2025-03-15 01:26:45,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-15 01:26:45,533 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:45,533 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:45,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:26:45,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:45,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:45,533 INFO L85 PathProgramCache]: Analyzing trace with hash 499182072, now seen corresponding path program 1 times [2025-03-15 01:26:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:45,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879757652] [2025-03-15 01:26:45,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:45,568 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-15 01:26:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879757652] [2025-03-15 01:26:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879757652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:45,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:45,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:45,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750316139] [2025-03-15 01:26:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:45,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:45,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:45,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:45,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:45,569 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:45,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 182 transitions, 2499 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-15 01:26:45,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:45,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:45,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:45,819 INFO L124 PetriNetUnfolderBase]: 981/2688 cut-off events. [2025-03-15 01:26:45,819 INFO L125 PetriNetUnfolderBase]: For 45020/46968 co-relation queries the response was YES. [2025-03-15 01:26:45,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15665 conditions, 2688 events. 981/2688 cut-off events. For 45020/46968 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 23214 event pairs, 196 based on Foata normal form. 18/1898 useless extension candidates. Maximal degree in co-relation 15608. Up to 1360 conditions per place. [2025-03-15 01:26:45,847 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 105 selfloop transitions, 15 changer transitions 0/190 dead transitions. [2025-03-15 01:26:45,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 190 transitions, 2895 flow [2025-03-15 01:26:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2025-03-15 01:26:45,848 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8727272727272727 [2025-03-15 01:26:45,849 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 26 predicate places. [2025-03-15 01:26:45,849 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 190 transitions, 2895 flow [2025-03-15 01:26:45,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-15 01:26:45,849 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:45,849 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:45,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:26:45,849 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:45,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2032517975, now seen corresponding path program 1 times [2025-03-15 01:26:45,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:45,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123560319] [2025-03-15 01:26:45,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:26:45,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:45,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123560319] [2025-03-15 01:26:45,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123560319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:45,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:45,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502360279] [2025-03-15 01:26:45,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:45,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:45,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:45,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:45,879 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:45,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 190 transitions, 2895 flow. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 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-15 01:26:45,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:45,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:45,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:46,130 INFO L124 PetriNetUnfolderBase]: 974/2466 cut-off events. [2025-03-15 01:26:46,131 INFO L125 PetriNetUnfolderBase]: For 57344/64031 co-relation queries the response was YES. [2025-03-15 01:26:46,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16686 conditions, 2466 events. 974/2466 cut-off events. For 57344/64031 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 20963 event pairs, 135 based on Foata normal form. 496/2238 useless extension candidates. Maximal degree in co-relation 16627. Up to 1326 conditions per place. [2025-03-15 01:26:46,149 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 120 selfloop transitions, 8 changer transitions 0/207 dead transitions. [2025-03-15 01:26:46,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 207 transitions, 3583 flow [2025-03-15 01:26:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 301 transitions. [2025-03-15 01:26:46,151 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7818181818181819 [2025-03-15 01:26:46,153 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 29 predicate places. [2025-03-15 01:26:46,153 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 207 transitions, 3583 flow [2025-03-15 01:26:46,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 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-15 01:26:46,153 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:46,153 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:46,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:26:46,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:46,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1888720087, now seen corresponding path program 1 times [2025-03-15 01:26:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:46,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168947488] [2025-03-15 01:26:46,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:46,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:46,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:46,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168947488] [2025-03-15 01:26:46,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168947488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:46,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064079065] [2025-03-15 01:26:46,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:46,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:46,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:46,217 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-15 01:26:46,220 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-15 01:26:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:46,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:26:46,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:46,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:26:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064079065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:46,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:26:46,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:26:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17323832] [2025-03-15 01:26:46,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:46,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:26:46,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:46,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:26:46,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:26:46,300 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:46,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 207 transitions, 3583 flow. Second operand has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-15 01:26:46,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:46,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:46,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:46,579 INFO L124 PetriNetUnfolderBase]: 889/2559 cut-off events. [2025-03-15 01:26:46,579 INFO L125 PetriNetUnfolderBase]: For 41390/44817 co-relation queries the response was YES. [2025-03-15 01:26:46,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17326 conditions, 2559 events. 889/2559 cut-off events. For 41390/44817 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 22255 event pairs, 88 based on Foata normal form. 146/2109 useless extension candidates. Maximal degree in co-relation 17265. Up to 1263 conditions per place. [2025-03-15 01:26:46,635 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 138 selfloop transitions, 7 changer transitions 0/222 dead transitions. [2025-03-15 01:26:46,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 222 transitions, 4285 flow [2025-03-15 01:26:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:26:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:26:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 419 transitions. [2025-03-15 01:26:46,637 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7773654916512059 [2025-03-15 01:26:46,637 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 34 predicate places. [2025-03-15 01:26:46,637 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 222 transitions, 4285 flow [2025-03-15 01:26:46,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-15 01:26:46,638 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:46,638 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:46,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-15 01:26:46,838 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,SelfDestructingSolverStorable12 [2025-03-15 01:26:46,838 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:46,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1579219694, now seen corresponding path program 1 times [2025-03-15 01:26:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:46,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14732533] [2025-03-15 01:26:46,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:46,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:26:46,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:46,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14732533] [2025-03-15 01:26:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14732533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:46,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:46,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:46,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189635684] [2025-03-15 01:26:46,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:46,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:46,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:46,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:46,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:46,874 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:26:46,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 222 transitions, 4285 flow. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-15 01:26:46,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:46,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:26:46,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:47,086 INFO L124 PetriNetUnfolderBase]: 921/2363 cut-off events. [2025-03-15 01:26:47,086 INFO L125 PetriNetUnfolderBase]: For 46690/51418 co-relation queries the response was YES. [2025-03-15 01:26:47,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18686 conditions, 2363 events. 921/2363 cut-off events. For 46690/51418 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19637 event pairs, 76 based on Foata normal form. 257/2075 useless extension candidates. Maximal degree in co-relation 18623. Up to 1128 conditions per place. [2025-03-15 01:26:47,112 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 152 selfloop transitions, 8 changer transitions 0/237 dead transitions. [2025-03-15 01:26:47,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 237 transitions, 5047 flow [2025-03-15 01:26:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 298 transitions. [2025-03-15 01:26:47,114 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7740259740259741 [2025-03-15 01:26:47,115 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 37 predicate places. [2025-03-15 01:26:47,115 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 237 transitions, 5047 flow [2025-03-15 01:26:47,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-15 01:26:47,115 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:47,115 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:47,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:26:47,115 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:47,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -3217232, now seen corresponding path program 1 times [2025-03-15 01:26:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902453331] [2025-03-15 01:26:47,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:47,167 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-15 01:26:47,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:47,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902453331] [2025-03-15 01:26:47,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902453331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:47,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:47,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:26:47,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313739584] [2025-03-15 01:26:47,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:47,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:26:47,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:47,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:26:47,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:26:47,170 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:47,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 237 transitions, 5047 flow. Second operand has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-15 01:26:47,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:47,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:47,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:47,377 INFO L124 PetriNetUnfolderBase]: 881/2356 cut-off events. [2025-03-15 01:26:47,377 INFO L125 PetriNetUnfolderBase]: For 57035/61210 co-relation queries the response was YES. [2025-03-15 01:26:47,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19303 conditions, 2356 events. 881/2356 cut-off events. For 57035/61210 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 19212 event pairs, 37 based on Foata normal form. 30/1901 useless extension candidates. Maximal degree in co-relation 19236. Up to 1179 conditions per place. [2025-03-15 01:26:47,402 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 135 selfloop transitions, 41 changer transitions 0/243 dead transitions. [2025-03-15 01:26:47,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 243 transitions, 5547 flow [2025-03-15 01:26:47,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:26:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:26:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-03-15 01:26:47,403 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8593073593073594 [2025-03-15 01:26:47,404 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 42 predicate places. [2025-03-15 01:26:47,404 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 243 transitions, 5547 flow [2025-03-15 01:26:47,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-15 01:26:47,404 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:47,404 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:47,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:26:47,404 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:47,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash 805236833, now seen corresponding path program 1 times [2025-03-15 01:26:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654982211] [2025-03-15 01:26:47,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:47,461 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-15 01:26:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654982211] [2025-03-15 01:26:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654982211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:47,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:47,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:26:47,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559221385] [2025-03-15 01:26:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:47,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:26:47,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:47,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:26:47,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:26:47,462 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:47,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 243 transitions, 5547 flow. Second operand has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-15 01:26:47,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:47,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:47,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:47,696 INFO L124 PetriNetUnfolderBase]: 860/2304 cut-off events. [2025-03-15 01:26:47,696 INFO L125 PetriNetUnfolderBase]: For 68274/71982 co-relation queries the response was YES. [2025-03-15 01:26:47,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19868 conditions, 2304 events. 860/2304 cut-off events. For 68274/71982 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 18299 event pairs, 51 based on Foata normal form. 30/1879 useless extension candidates. Maximal degree in co-relation 19797. Up to 1176 conditions per place. [2025-03-15 01:26:47,717 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 156 selfloop transitions, 26 changer transitions 0/249 dead transitions. [2025-03-15 01:26:47,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 249 transitions, 6071 flow [2025-03-15 01:26:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:26:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:26:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 402 transitions. [2025-03-15 01:26:47,718 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8701298701298701 [2025-03-15 01:26:47,718 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 47 predicate places. [2025-03-15 01:26:47,719 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 249 transitions, 6071 flow [2025-03-15 01:26:47,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-15 01:26:47,719 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:47,719 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:26:47,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:26:47,719 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:47,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash 218778133, now seen corresponding path program 1 times [2025-03-15 01:26:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:47,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212155399] [2025-03-15 01:26:47,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212155399] [2025-03-15 01:26:47,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212155399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432162113] [2025-03-15 01:26:47,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:47,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:47,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:47,768 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-15 01:26:47,770 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-15 01:26:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:47,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:26:47,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:47,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432162113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:47,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:47,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-15 01:26:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433046139] [2025-03-15 01:26:47,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:47,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:26:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:47,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:26:47,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:26:47,939 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:47,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 249 transitions, 6071 flow. Second operand has 10 states, 10 states have (on average 63.5) internal successors, (635), 10 states have internal predecessors, (635), 0 states have call successors, (0), 0 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-15 01:26:47,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:47,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:47,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:48,429 INFO L124 PetriNetUnfolderBase]: 1377/3784 cut-off events. [2025-03-15 01:26:48,429 INFO L125 PetriNetUnfolderBase]: For 141407/149185 co-relation queries the response was YES. [2025-03-15 01:26:48,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33157 conditions, 3784 events. 1377/3784 cut-off events. For 141407/149185 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 29243 event pairs, 105 based on Foata normal form. 27/3135 useless extension candidates. Maximal degree in co-relation 33082. Up to 2022 conditions per place. [2025-03-15 01:26:48,474 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 186 selfloop transitions, 103 changer transitions 1/357 dead transitions. [2025-03-15 01:26:48,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 357 transitions, 10035 flow [2025-03-15 01:26:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:26:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:26:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 735 transitions. [2025-03-15 01:26:48,478 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8677685950413223 [2025-03-15 01:26:48,478 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 57 predicate places. [2025-03-15 01:26:48,478 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 357 transitions, 10035 flow [2025-03-15 01:26:48,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.5) internal successors, (635), 10 states have internal predecessors, (635), 0 states have call successors, (0), 0 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-15 01:26:48,478 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:48,479 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:48,484 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-15 01:26:48,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:48,679 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:48,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:48,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1876450317, now seen corresponding path program 1 times [2025-03-15 01:26:48,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:48,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121399541] [2025-03-15 01:26:48,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:48,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:48,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:48,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121399541] [2025-03-15 01:26:48,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121399541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:48,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390981824] [2025-03-15 01:26:48,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:48,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:48,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:48,802 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-15 01:26:48,803 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-15 01:26:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:48,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-15 01:26:48,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:48,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:49,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390981824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:49,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:49,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-15 01:26:49,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850533799] [2025-03-15 01:26:49,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:49,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 01:26:49,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:49,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 01:26:49,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-15 01:26:49,078 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:49,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 357 transitions, 10035 flow. Second operand has 18 states, 18 states have (on average 63.333333333333336) internal successors, (1140), 18 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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-15 01:26:49,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:49,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:49,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:49,857 INFO L124 PetriNetUnfolderBase]: 2024/5304 cut-off events. [2025-03-15 01:26:49,857 INFO L125 PetriNetUnfolderBase]: For 281866/295627 co-relation queries the response was YES. [2025-03-15 01:26:49,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50248 conditions, 5304 events. 2024/5304 cut-off events. For 281866/295627 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 38314 event pairs, 108 based on Foata normal form. 27/4462 useless extension candidates. Maximal degree in co-relation 50169. Up to 3031 conditions per place. [2025-03-15 01:26:49,974 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 264 selfloop transitions, 171 changer transitions 4/506 dead transitions. [2025-03-15 01:26:49,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 506 transitions, 15877 flow [2025-03-15 01:26:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 01:26:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 01:26:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1333 transitions. [2025-03-15 01:26:49,977 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8655844155844156 [2025-03-15 01:26:49,977 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 76 predicate places. [2025-03-15 01:26:49,977 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 506 transitions, 15877 flow [2025-03-15 01:26:49,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 63.333333333333336) internal successors, (1140), 18 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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-15 01:26:49,978 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:49,978 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:49,983 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-15 01:26:50,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-15 01:26:50,178 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:50,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:50,179 INFO L85 PathProgramCache]: Analyzing trace with hash 548101196, now seen corresponding path program 2 times [2025-03-15 01:26:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:50,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505667733] [2025-03-15 01:26:50,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:50,194 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:50,194 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505667733] [2025-03-15 01:26:50,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505667733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524730915] [2025-03-15 01:26:50,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:50,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:50,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:50,402 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-15 01:26:50,404 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-15 01:26:50,461 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:50,462 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:50,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-15 01:26:50,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:50,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524730915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:50,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:50,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-03-15 01:26:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111772739] [2025-03-15 01:26:50,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:50,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-15 01:26:50,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:50,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-15 01:26:50,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-03-15 01:26:50,869 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:50,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 506 transitions, 15877 flow. Second operand has 30 states, 30 states have (on average 63.166666666666664) internal successors, (1895), 30 states have internal predecessors, (1895), 0 states have call successors, (0), 0 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-15 01:26:50,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:50,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:50,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:53,002 INFO L124 PetriNetUnfolderBase]: 3528/9400 cut-off events. [2025-03-15 01:26:53,002 INFO L125 PetriNetUnfolderBase]: For 585211/611603 co-relation queries the response was YES. [2025-03-15 01:26:53,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91691 conditions, 9400 events. 3528/9400 cut-off events. For 585211/611603 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 67845 event pairs, 276 based on Foata normal form. 27/7914 useless extension candidates. Maximal degree in co-relation 91608. Up to 5580 conditions per place. [2025-03-15 01:26:53,188 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 450 selfloop transitions, 301 changer transitions 0/818 dead transitions. [2025-03-15 01:26:53,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 818 transitions, 28403 flow [2025-03-15 01:26:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-15 01:26:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-15 01:26:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2059 transitions. [2025-03-15 01:26:53,192 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8625890238793464 [2025-03-15 01:26:53,193 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 106 predicate places. [2025-03-15 01:26:53,193 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 818 transitions, 28403 flow [2025-03-15 01:26:53,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 63.166666666666664) internal successors, (1895), 30 states have internal predecessors, (1895), 0 states have call successors, (0), 0 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-15 01:26:53,194 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:53,194 INFO L221 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 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-15 01:26:53,201 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-15 01:26:53,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:53,395 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:53,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1601333667, now seen corresponding path program 2 times [2025-03-15 01:26:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:53,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288403151] [2025-03-15 01:26:53,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:53,425 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:53,425 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:53,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:53,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288403151] [2025-03-15 01:26:53,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288403151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210172043] [2025-03-15 01:26:53,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:53,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:53,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:53,993 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-15 01:26:53,994 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-15 01:26:54,069 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:54,069 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:54,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-15 01:26:54,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:54,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210172043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:55,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:55,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2025-03-15 01:26:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612049556] [2025-03-15 01:26:55,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:55,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-15 01:26:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:55,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-15 01:26:55,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2025-03-15 01:26:55,073 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:26:55,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 818 transitions, 28403 flow. Second operand has 58 states, 58 states have (on average 63.10344827586207) internal successors, (3660), 58 states have internal predecessors, (3660), 0 states have call successors, (0), 0 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-15 01:26:55,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:55,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:26:55,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:00,484 INFO L124 PetriNetUnfolderBase]: 6397/16505 cut-off events. [2025-03-15 01:27:00,484 INFO L125 PetriNetUnfolderBase]: For 1254706/1307146 co-relation queries the response was YES. [2025-03-15 01:27:00,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171614 conditions, 16505 events. 6397/16505 cut-off events. For 1254706/1307146 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 118589 event pairs, 474 based on Foata normal form. 33/13812 useless extension candidates. Maximal degree in co-relation 171527. Up to 10213 conditions per place. [2025-03-15 01:27:00,685 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 825 selfloop transitions, 572 changer transitions 2/1466 dead transitions. [2025-03-15 01:27:00,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1466 transitions, 55393 flow [2025-03-15 01:27:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-15 01:27:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-15 01:27:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 3988 transitions. [2025-03-15 01:27:00,688 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8632034632034632 [2025-03-15 01:27:00,689 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 165 predicate places. [2025-03-15 01:27:00,689 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 1466 transitions, 55393 flow [2025-03-15 01:27:00,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 63.10344827586207) internal successors, (3660), 58 states have internal predecessors, (3660), 0 states have call successors, (0), 0 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-15 01:27:00,690 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:00,690 INFO L221 CegarLoopForPetriNet]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 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-15 01:27:00,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-15 01:27:00,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:00,891 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:00,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1501136954, now seen corresponding path program 3 times [2025-03-15 01:27:00,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:00,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777784480] [2025-03-15 01:27:00,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:27:00,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:00,978 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-15 01:27:00,978 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2792 backedges. 0 proven. 2792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:03,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777784480] [2025-03-15 01:27:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777784480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279345321] [2025-03-15 01:27:03,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:27:03,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:03,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:03,019 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-15 01:27:03,019 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-15 01:27:03,132 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-15 01:27:03,132 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:03,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-15 01:27:03,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2792 backedges. 2786 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-15 01:27:04,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:27:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279345321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:04,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:27:04,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [55] total 107 [2025-03-15 01:27:04,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074705259] [2025-03-15 01:27:04,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:04,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-15 01:27:04,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:04,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-15 01:27:04,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1538, Invalid=9804, Unknown=0, NotChecked=0, Total=11342 [2025-03-15 01:27:04,705 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:27:04,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1466 transitions, 55393 flow. Second operand has 53 states, 53 states have (on average 59.0) internal successors, (3127), 53 states have internal predecessors, (3127), 0 states have call successors, (0), 0 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-15 01:27:04,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:04,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:27:04,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:58,452 INFO L124 PetriNetUnfolderBase]: 46823/116445 cut-off events. [2025-03-15 01:27:58,453 INFO L125 PetriNetUnfolderBase]: For 7619578/7929286 co-relation queries the response was YES. [2025-03-15 01:27:59,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238162 conditions, 116445 events. 46823/116445 cut-off events. For 7619578/7929286 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 1284116 event pairs, 2745 based on Foata normal form. 20692/117965 useless extension candidates. Maximal degree in co-relation 1238073. Up to 83508 conditions per place. [2025-03-15 01:28:00,165 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 0 selfloop transitions, 0 changer transitions 7736/7736 dead transitions. [2025-03-15 01:28:00,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 7736 transitions, 330507 flow [2025-03-15 01:28:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-15 01:28:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-15 01:28:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 3692 transitions. [2025-03-15 01:28:00,168 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7610801896516183 [2025-03-15 01:28:00,169 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 212 predicate places. [2025-03-15 01:28:00,169 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 7736 transitions, 330507 flow [2025-03-15 01:28:00,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 59.0) internal successors, (3127), 53 states have internal predecessors, (3127), 0 states have call successors, (0), 0 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-15 01:28:00,174 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/triangular-longest-1.i_petrified1_AllErrorsAtOnce [2025-03-15 01:28:00,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-15 01:28:00,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-15 01:28:00,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-15 01:28:00,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-15 01:28:00,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 01:28:00,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:28:00,405 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:28:00,409 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:28:00,409 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:28:00,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:28:00 BasicIcfg [2025-03-15 01:28:00,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:28:00,412 INFO L158 Benchmark]: Toolchain (without parser) took 79026.51ms. Allocated memory was 71.3MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 44.1MB in the beginning and 1.0GB in the end (delta: -959.1MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-03-15 01:28:00,413 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 71.3MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:28:00,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.58ms. Allocated memory is still 71.3MB. Free memory was 44.0MB in the beginning and 24.8MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:28:00,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.80ms. Allocated memory is still 71.3MB. Free memory was 24.8MB in the beginning and 23.2MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:28:00,413 INFO L158 Benchmark]: Boogie Preprocessor took 20.41ms. Allocated memory is still 71.3MB. Free memory was 23.2MB in the beginning and 22.2MB in the end (delta: 965.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:28:00,413 INFO L158 Benchmark]: RCFGBuilder took 305.72ms. Allocated memory is still 71.3MB. Free memory was 22.2MB in the beginning and 34.8MB in the end (delta: -12.6MB). Peak memory consumption was 3.2MB. Max. memory is 8.0GB. [2025-03-15 01:28:00,413 INFO L158 Benchmark]: TraceAbstraction took 78359.06ms. Allocated memory was 71.3MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 33.9MB in the beginning and 1.0GB in the end (delta: -969.3MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-03-15 01:28:00,414 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 71.3MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.58ms. Allocated memory is still 71.3MB. Free memory was 44.0MB in the beginning and 24.8MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.80ms. Allocated memory is still 71.3MB. Free memory was 24.8MB in the beginning and 23.2MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.41ms. Allocated memory is still 71.3MB. Free memory was 23.2MB in the beginning and 22.2MB in the end (delta: 965.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 305.72ms. Allocated memory is still 71.3MB. Free memory was 22.2MB in the beginning and 34.8MB in the end (delta: -12.6MB). Peak memory consumption was 3.2MB. Max. memory is 8.0GB. * TraceAbstraction took 78359.06ms. Allocated memory was 71.3MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 33.9MB in the beginning and 1.0GB in the end (delta: -969.3MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 110 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 78.3s, OverallIterations: 21, TraceHistogramMax: 27, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 68.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1969 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1969 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2518 IncrementalHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 76 mSDtfsCounter, 2518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1721 GetRequests, 1307 SyntacticMatches, 0 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8777 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330507occurred in iteration=21, InterpolantAutomatonStates: 259, 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.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2258 NumberOfCodeBlocks, 2258 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 2676 ConstructedInterpolants, 0 QuantifiedInterpolants, 7262 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1765 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 32 InterpolantComputations, 17 PerfectInterpolantSequences, 2810/7758 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:28:00,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...