/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/goblint-regression/05-lval_ls_02-idx_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:54:41,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:54:41,707 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:54:41,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:54:41,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:54:41,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:54:41,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:54:41,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:54:41,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:54:41,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:54:41,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:54:41,749 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:54:41,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:54:41,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:54:41,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:54:41,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:54:41,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:54:41,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:54:41,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:54:41,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:54:41,749 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:54:42,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:54:42,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:54:42,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:54:42,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:54:42,024 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:54:42,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_02-idx_nr.i [2025-03-15 01:54:43,215 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c712c6e47/70a81acb6613404299a2f7be59ee4d00/FLAG9af470834 [2025-03-15 01:54:43,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:54:43,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/05-lval_ls_02-idx_nr.i [2025-03-15 01:54:43,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c712c6e47/70a81acb6613404299a2f7be59ee4d00/FLAG9af470834 [2025-03-15 01:54:43,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c712c6e47/70a81acb6613404299a2f7be59ee4d00 [2025-03-15 01:54:43,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:54:43,797 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:54:43,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:54:43,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:54:43,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:54:43,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:54:43" (1/1) ... [2025-03-15 01:54:43,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263d40ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:43, skipping insertion in model container [2025-03-15 01:54:43,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:54:43" (1/1) ... [2025-03-15 01:54:43,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:54:44,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:54:44,070 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:54:44,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:54:44,132 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:54:44,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44 WrapperNode [2025-03-15 01:54:44,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:54:44,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:54:44,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:54:44,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:54:44,138 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:54:44" (1/1) ... [2025-03-15 01:54:44,152 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:54:44" (1/1) ... [2025-03-15 01:54:44,172 INFO L138 Inliner]: procedures = 162, calls = 58, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2025-03-15 01:54:44,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:54:44,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:54:44,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:54:44,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:54:44,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (1/1) ... [2025-03-15 01:54:44,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (1/1) ... [2025-03-15 01:54:44,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (1/1) ... [2025-03-15 01:54:44,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (1/1) ... [2025-03-15 01:54:44,193 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (1/1) ... [2025-03-15 01:54:44,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (1/1) ... [2025-03-15 01:54:44,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (1/1) ... [2025-03-15 01:54:44,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (1/1) ... [2025-03-15 01:54:44,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (1/1) ... [2025-03-15 01:54:44,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:54:44,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:54:44,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:54:44,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:54:44,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (1/1) ... [2025-03-15 01:54:44,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:54:44,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:44,242 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:54:44,247 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:54:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:54:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:54:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 01:54:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 01:54:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:54:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:54:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:54:44,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:54:44,263 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:54:44,359 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:54:44,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:54:44,530 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:54:44,531 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:54:44,544 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:54:44,544 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:54:44,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:54:44 BoogieIcfgContainer [2025-03-15 01:54:44,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:54:44,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:54:44,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:54:44,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:54:44,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:54:43" (1/3) ... [2025-03-15 01:54:44,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fade7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:54:44, skipping insertion in model container [2025-03-15 01:54:44,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:44" (2/3) ... [2025-03-15 01:54:44,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fade7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:54:44, skipping insertion in model container [2025-03-15 01:54:44,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:54:44" (3/3) ... [2025-03-15 01:54:44,552 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_02-idx_nr.i [2025-03-15 01:54:44,562 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:54:44,563 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_02-idx_nr.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-15 01:54:44,564 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:54:44,603 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:54:44,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:54:44,646 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;@1408f91d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:54:44,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-15 01:54:44,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:54:44,676 INFO L124 PetriNetUnfolderBase]: 0/65 cut-off events. [2025-03-15 01:54:44,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:54:44,678 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:44,678 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:44,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:44,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1866439435, now seen corresponding path program 1 times [2025-03-15 01:54:44,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155819477] [2025-03-15 01:54:44,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:44,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155819477] [2025-03-15 01:54:44,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155819477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:44,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:44,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:44,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385585380] [2025-03-15 01:54:44,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:44,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:45,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:45,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:45,015 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2025-03-15 01:54:45,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 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:54:45,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:45,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2025-03-15 01:54:45,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:45,120 INFO L124 PetriNetUnfolderBase]: 7/157 cut-off events. [2025-03-15 01:54:45,120 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 01:54:45,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 157 events. 7/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 227 event pairs, 6 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 100. Up to 32 conditions per place. [2025-03-15 01:54:45,124 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 22 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2025-03-15 01:54:45,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 279 flow [2025-03-15 01:54:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2025-03-15 01:54:45,137 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8754716981132076 [2025-03-15 01:54:45,139 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 3 predicate places. [2025-03-15 01:54:45,139 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 279 flow [2025-03-15 01:54:45,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 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:54:45,140 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:45,140 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, 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:54:45,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:54:45,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:45,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1456172715, now seen corresponding path program 1 times [2025-03-15 01:54:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:45,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200683001] [2025-03-15 01:54:45,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:45,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:45,281 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:54:45,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200683001] [2025-03-15 01:54:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200683001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:54:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56347765] [2025-03-15 01:54:45,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:45,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:45,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:45,285 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:54:45,286 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:54:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:45,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:54:45,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:54:45,433 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:54:45,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:54:45,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56347765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:45,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:54:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:54:45,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820133079] [2025-03-15 01:54:45,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:45,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:45,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:45,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:45,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:54:45,437 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2025-03-15 01:54:45,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:54:45,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:45,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2025-03-15 01:54:45,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:45,550 INFO L124 PetriNetUnfolderBase]: 7/156 cut-off events. [2025-03-15 01:54:45,551 INFO L125 PetriNetUnfolderBase]: For 15/21 co-relation queries the response was YES. [2025-03-15 01:54:45,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 156 events. 7/156 cut-off events. For 15/21 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 223 event pairs, 6 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 117. Up to 31 conditions per place. [2025-03-15 01:54:45,552 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 18 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2025-03-15 01:54:45,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 325 flow [2025-03-15 01:54:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:54:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:54:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 635 transitions. [2025-03-15 01:54:45,555 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8557951482479784 [2025-03-15 01:54:45,556 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2025-03-15 01:54:45,556 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 111 transitions, 325 flow [2025-03-15 01:54:45,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:54:45,556 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:45,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:45,568 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:54:45,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:45,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:45,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2103286306, now seen corresponding path program 1 times [2025-03-15 01:54:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:45,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138847843] [2025-03-15 01:54:45,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:45,827 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:54:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138847843] [2025-03-15 01:54:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138847843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:45,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:45,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:45,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072659444] [2025-03-15 01:54:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:45,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:45,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:45,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:45,829 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2025-03-15 01:54:45,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 111 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:54:45,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:45,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2025-03-15 01:54:45,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:45,887 INFO L124 PetriNetUnfolderBase]: 7/155 cut-off events. [2025-03-15 01:54:45,887 INFO L125 PetriNetUnfolderBase]: For 42/54 co-relation queries the response was YES. [2025-03-15 01:54:45,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 155 events. 7/155 cut-off events. For 42/54 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 220 event pairs, 6 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 132. Up to 30 conditions per place. [2025-03-15 01:54:45,892 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 16 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2025-03-15 01:54:45,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 110 transitions, 367 flow [2025-03-15 01:54:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2025-03-15 01:54:45,895 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8566037735849057 [2025-03-15 01:54:45,895 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 11 predicate places. [2025-03-15 01:54:45,895 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 110 transitions, 367 flow [2025-03-15 01:54:45,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:54:45,896 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:45,896 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:45,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:54:45,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:45,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash -541731582, now seen corresponding path program 1 times [2025-03-15 01:54:45,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:45,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680162536] [2025-03-15 01:54:45,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:45,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:46,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:46,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680162536] [2025-03-15 01:54:46,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680162536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:54:46,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995040741] [2025-03-15 01:54:46,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:46,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:46,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:46,004 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:54:46,006 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:54:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:46,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:54:46,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:54:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:46,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:54:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:46,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995040741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:54:46,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:54:46,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 01:54:46,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652694533] [2025-03-15 01:54:46,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:54:46,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:54:46,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:46,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:54:46,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:54:46,138 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2025-03-15 01:54:46,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 110 transitions, 367 flow. Second operand has 10 states, 10 states have (on average 89.9) internal successors, (899), 10 states have internal predecessors, (899), 0 states have call successors, (0), 0 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:54:46,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:46,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2025-03-15 01:54:46,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:46,242 INFO L124 PetriNetUnfolderBase]: 7/163 cut-off events. [2025-03-15 01:54:46,242 INFO L125 PetriNetUnfolderBase]: For 82/100 co-relation queries the response was YES. [2025-03-15 01:54:46,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 163 events. 7/163 cut-off events. For 82/100 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 204 event pairs, 6 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 190. Up to 38 conditions per place. [2025-03-15 01:54:46,243 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 23 selfloop transitions, 9 changer transitions 0/118 dead transitions. [2025-03-15 01:54:46,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 118 transitions, 495 flow [2025-03-15 01:54:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:54:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:54:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 817 transitions. [2025-03-15 01:54:46,246 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8563941299790356 [2025-03-15 01:54:46,246 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 19 predicate places. [2025-03-15 01:54:46,246 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 118 transitions, 495 flow [2025-03-15 01:54:46,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.9) internal successors, (899), 10 states have internal predecessors, (899), 0 states have call successors, (0), 0 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:54:46,247 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:46,247 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:46,254 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:54:46,447 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,SelfDestructingSolverStorable3 [2025-03-15 01:54:46,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:46,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash 86967362, now seen corresponding path program 2 times [2025-03-15 01:54:46,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:46,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604844814] [2025-03-15 01:54:46,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:46,466 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:46,466 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-15 01:54:46,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:46,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604844814] [2025-03-15 01:54:46,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604844814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:46,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:46,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560094498] [2025-03-15 01:54:46,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:46,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:46,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:46,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:46,550 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 106 [2025-03-15 01:54:46,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 118 transitions, 495 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:54:46,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:46,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 106 [2025-03-15 01:54:46,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:46,621 INFO L124 PetriNetUnfolderBase]: 37/243 cut-off events. [2025-03-15 01:54:46,621 INFO L125 PetriNetUnfolderBase]: For 325/333 co-relation queries the response was YES. [2025-03-15 01:54:46,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 243 events. 37/243 cut-off events. For 325/333 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 699 event pairs, 10 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 411. Up to 63 conditions per place. [2025-03-15 01:54:46,624 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 19 selfloop transitions, 5 changer transitions 10/137 dead transitions. [2025-03-15 01:54:46,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 137 transitions, 641 flow [2025-03-15 01:54:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2025-03-15 01:54:46,626 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.930188679245283 [2025-03-15 01:54:46,627 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 23 predicate places. [2025-03-15 01:54:46,627 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 137 transitions, 641 flow [2025-03-15 01:54:46,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:54:46,627 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:46,627 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:46,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:54:46,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:46,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1750045727, now seen corresponding path program 1 times [2025-03-15 01:54:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:46,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462480975] [2025-03-15 01:54:46,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-15 01:54:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462480975] [2025-03-15 01:54:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462480975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:46,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:46,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:46,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253514111] [2025-03-15 01:54:46,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:46,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:46,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:46,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:46,747 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 106 [2025-03-15 01:54:46,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 137 transitions, 641 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:54:46,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:46,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 106 [2025-03-15 01:54:46,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:46,826 INFO L124 PetriNetUnfolderBase]: 64/317 cut-off events. [2025-03-15 01:54:46,827 INFO L125 PetriNetUnfolderBase]: For 695/713 co-relation queries the response was YES. [2025-03-15 01:54:46,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 317 events. 64/317 cut-off events. For 695/713 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1158 event pairs, 16 based on Foata normal form. 4/311 useless extension candidates. Maximal degree in co-relation 715. Up to 81 conditions per place. [2025-03-15 01:54:46,830 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 23 selfloop transitions, 5 changer transitions 22/152 dead transitions. [2025-03-15 01:54:46,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 152 transitions, 807 flow [2025-03-15 01:54:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2025-03-15 01:54:46,834 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9150943396226415 [2025-03-15 01:54:46,834 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 27 predicate places. [2025-03-15 01:54:46,834 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 152 transitions, 807 flow [2025-03-15 01:54:46,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:54:46,835 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:46,835 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:46,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:54:46,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:46,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1942617563, now seen corresponding path program 1 times [2025-03-15 01:54:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716038734] [2025-03-15 01:54:46,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:46,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-15 01:54:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716038734] [2025-03-15 01:54:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716038734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:46,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846732724] [2025-03-15 01:54:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:46,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:54:46,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:46,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:54:46,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:54:46,956 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 106 [2025-03-15 01:54:46,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 152 transitions, 807 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:54:46,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:46,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 106 [2025-03-15 01:54:46,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:47,030 INFO L124 PetriNetUnfolderBase]: 6/152 cut-off events. [2025-03-15 01:54:47,030 INFO L125 PetriNetUnfolderBase]: For 421/441 co-relation queries the response was YES. [2025-03-15 01:54:47,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 152 events. 6/152 cut-off events. For 421/441 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 3 based on Foata normal form. 12/156 useless extension candidates. Maximal degree in co-relation 247. Up to 61 conditions per place. [2025-03-15 01:54:47,031 INFO L140 encePairwiseOnDemand]: 102/106 looper letters, 55 selfloop transitions, 6 changer transitions 5/130 dead transitions. [2025-03-15 01:54:47,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 130 transitions, 757 flow [2025-03-15 01:54:47,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:54:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:54:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-03-15 01:54:47,032 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6477987421383647 [2025-03-15 01:54:47,033 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 29 predicate places. [2025-03-15 01:54:47,033 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 130 transitions, 757 flow [2025-03-15 01:54:47,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:54:47,033 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:47,033 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:47,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:54:47,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:47,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash 674455358, now seen corresponding path program 1 times [2025-03-15 01:54:47,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:47,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43420116] [2025-03-15 01:54:47,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:47,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43420116] [2025-03-15 01:54:47,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43420116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:54:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494790868] [2025-03-15 01:54:47,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:47,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:47,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:47,158 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:54:47,160 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:54:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:47,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 01:54:47,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:54:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:47,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:54:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:47,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494790868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:54:47,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:54:47,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 01:54:47,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880694653] [2025-03-15 01:54:47,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:54:47,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 01:54:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:47,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 01:54:47,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 01:54:47,401 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2025-03-15 01:54:47,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 130 transitions, 757 flow. Second operand has 18 states, 18 states have (on average 90.27777777777777) internal successors, (1625), 18 states have internal predecessors, (1625), 0 states have call successors, (0), 0 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:54:47,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:47,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2025-03-15 01:54:47,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:47,606 INFO L124 PetriNetUnfolderBase]: 6/180 cut-off events. [2025-03-15 01:54:47,606 INFO L125 PetriNetUnfolderBase]: For 296/313 co-relation queries the response was YES. [2025-03-15 01:54:47,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 180 events. 6/180 cut-off events. For 296/313 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 3 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 445. Up to 65 conditions per place. [2025-03-15 01:54:47,607 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 41 selfloop transitions, 21 changer transitions 5/158 dead transitions. [2025-03-15 01:54:47,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 158 transitions, 1169 flow [2025-03-15 01:54:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 01:54:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 01:54:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1891 transitions. [2025-03-15 01:54:47,610 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8495058400718778 [2025-03-15 01:54:47,611 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 49 predicate places. [2025-03-15 01:54:47,611 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 158 transitions, 1169 flow [2025-03-15 01:54:47,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 90.27777777777777) internal successors, (1625), 18 states have internal predecessors, (1625), 0 states have call successors, (0), 0 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:54:47,611 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:47,612 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:47,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 01:54:47,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:47,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:47,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1281592514, now seen corresponding path program 2 times [2025-03-15 01:54:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225895002] [2025-03-15 01:54:47,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:47,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:47,825 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:47,825 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-15 01:54:47,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:47,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225895002] [2025-03-15 01:54:47,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225895002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:47,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:47,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:47,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447973755] [2025-03-15 01:54:47,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:47,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:47,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:47,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:47,896 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2025-03-15 01:54:47,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 158 transitions, 1169 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:47,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:47,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2025-03-15 01:54:47,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:47,980 INFO L124 PetriNetUnfolderBase]: 10/191 cut-off events. [2025-03-15 01:54:47,980 INFO L125 PetriNetUnfolderBase]: For 463/484 co-relation queries the response was YES. [2025-03-15 01:54:47,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 191 events. 10/191 cut-off events. For 463/484 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 228 event pairs, 9 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 447. Up to 70 conditions per place. [2025-03-15 01:54:47,981 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 21 selfloop transitions, 6 changer transitions 9/160 dead transitions. [2025-03-15 01:54:47,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 160 transitions, 1287 flow [2025-03-15 01:54:47,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:54:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:54:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 625 transitions. [2025-03-15 01:54:47,982 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8423180592991913 [2025-03-15 01:54:47,983 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 54 predicate places. [2025-03-15 01:54:47,983 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 160 transitions, 1287 flow [2025-03-15 01:54:47,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:47,983 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:47,983 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:47,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:54:47,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:47,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:47,984 INFO L85 PathProgramCache]: Analyzing trace with hash -690504532, now seen corresponding path program 1 times [2025-03-15 01:54:47,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:47,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397435006] [2025-03-15 01:54:47,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:47,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:48,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:48,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397435006] [2025-03-15 01:54:48,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397435006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:54:48,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184480110] [2025-03-15 01:54:48,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:48,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:48,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:48,252 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:54:48,253 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:54:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:48,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 01:54:48,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:54:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:48,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:54:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:48,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184480110] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:54:48,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:54:48,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 01:54:48,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888337158] [2025-03-15 01:54:48,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:54:48,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 01:54:48,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:48,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 01:54:48,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 01:54:48,605 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2025-03-15 01:54:48,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 160 transitions, 1287 flow. Second operand has 23 states, 23 states have (on average 90.47826086956522) internal successors, (2081), 23 states have internal predecessors, (2081), 0 states have call successors, (0), 0 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:54:48,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:48,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2025-03-15 01:54:48,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:48,926 INFO L124 PetriNetUnfolderBase]: 10/212 cut-off events. [2025-03-15 01:54:48,926 INFO L125 PetriNetUnfolderBase]: For 603/628 co-relation queries the response was YES. [2025-03-15 01:54:48,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 212 events. 10/212 cut-off events. For 603/628 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 227 event pairs, 9 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 651. Up to 91 conditions per place. [2025-03-15 01:54:48,928 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 53 selfloop transitions, 30 changer transitions 9/181 dead transitions. [2025-03-15 01:54:48,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 181 transitions, 1717 flow [2025-03-15 01:54:48,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 01:54:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 01:54:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2694 transitions. [2025-03-15 01:54:48,933 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8471698113207548 [2025-03-15 01:54:48,934 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 83 predicate places. [2025-03-15 01:54:48,934 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 181 transitions, 1717 flow [2025-03-15 01:54:48,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 90.47826086956522) internal successors, (2081), 23 states have internal predecessors, (2081), 0 states have call successors, (0), 0 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:54:48,934 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:48,934 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:48,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 01:54:49,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:49,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:49,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:49,136 INFO L85 PathProgramCache]: Analyzing trace with hash -700289458, now seen corresponding path program 2 times [2025-03-15 01:54:49,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:49,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907312198] [2025-03-15 01:54:49,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:49,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:49,150 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:49,150 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:54:49,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:49,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907312198] [2025-03-15 01:54:49,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907312198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:49,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:49,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:49,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924732124] [2025-03-15 01:54:49,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:49,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:49,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:49,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:49,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:49,229 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2025-03-15 01:54:49,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 181 transitions, 1717 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:49,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:49,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2025-03-15 01:54:49,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:49,338 INFO L124 PetriNetUnfolderBase]: 9/209 cut-off events. [2025-03-15 01:54:49,339 INFO L125 PetriNetUnfolderBase]: For 659/688 co-relation queries the response was YES. [2025-03-15 01:54:49,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 209 events. 9/209 cut-off events. For 659/688 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 201 event pairs, 3 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 653. Up to 90 conditions per place. [2025-03-15 01:54:49,340 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 21 selfloop transitions, 6 changer transitions 9/181 dead transitions. [2025-03-15 01:54:49,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 181 transitions, 1801 flow [2025-03-15 01:54:49,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:54:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:54:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 625 transitions. [2025-03-15 01:54:49,341 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8423180592991913 [2025-03-15 01:54:49,341 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 88 predicate places. [2025-03-15 01:54:49,341 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 181 transitions, 1801 flow [2025-03-15 01:54:49,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:49,342 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:49,342 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:49,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:54:49,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:49,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash 423114200, now seen corresponding path program 1 times [2025-03-15 01:54:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:49,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609357527] [2025-03-15 01:54:49,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:54:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609357527] [2025-03-15 01:54:49,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609357527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:49,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:49,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:49,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961417004] [2025-03-15 01:54:49,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:49,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:49,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:49,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:49,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:49,460 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2025-03-15 01:54:49,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 181 transitions, 1801 flow. Second operand has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 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:54:49,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:49,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2025-03-15 01:54:49,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:49,539 INFO L124 PetriNetUnfolderBase]: 9/208 cut-off events. [2025-03-15 01:54:49,539 INFO L125 PetriNetUnfolderBase]: For 757/790 co-relation queries the response was YES. [2025-03-15 01:54:49,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 208 events. 9/208 cut-off events. For 757/790 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 194 event pairs, 3 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 655. Up to 90 conditions per place. [2025-03-15 01:54:49,540 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 12 selfloop transitions, 4 changer transitions 22/180 dead transitions. [2025-03-15 01:54:49,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 180 transitions, 1863 flow [2025-03-15 01:54:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:54:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:54:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 788 transitions. [2025-03-15 01:54:49,542 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8259958071278826 [2025-03-15 01:54:49,542 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 95 predicate places. [2025-03-15 01:54:49,543 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 180 transitions, 1863 flow [2025-03-15 01:54:49,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 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:54:49,543 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:49,543 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:49,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:54:49,543 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:54:49,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:49,544 INFO L85 PathProgramCache]: Analyzing trace with hash -234136449, now seen corresponding path program 1 times [2025-03-15 01:54:49,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:49,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102633291] [2025-03-15 01:54:49,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:54:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102633291] [2025-03-15 01:54:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102633291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:49,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:49,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:49,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107679719] [2025-03-15 01:54:49,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:49,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:49,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:49,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:49,674 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2025-03-15 01:54:49,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 180 transitions, 1863 flow. Second operand has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 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:54:49,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:49,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2025-03-15 01:54:49,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:49,741 INFO L124 PetriNetUnfolderBase]: 8/205 cut-off events. [2025-03-15 01:54:49,741 INFO L125 PetriNetUnfolderBase]: For 841/878 co-relation queries the response was YES. [2025-03-15 01:54:49,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 205 events. 8/205 cut-off events. For 841/878 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 182 event pairs, 1 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 657. Up to 89 conditions per place. [2025-03-15 01:54:49,741 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 0 selfloop transitions, 0 changer transitions 181/181 dead transitions. [2025-03-15 01:54:49,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 181 transitions, 1969 flow [2025-03-15 01:54:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:54:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:54:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 790 transitions. [2025-03-15 01:54:49,744 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8280922431865828 [2025-03-15 01:54:49,745 INFO L298 CegarLoopForPetriNet]: 109 programPoint places, 102 predicate places. [2025-03-15 01:54:49,745 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 181 transitions, 1969 flow [2025-03-15 01:54:49,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 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:54:49,749 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/05-lval_ls_02-idx_nr.i_petrified1_AllErrorsAtOnce [2025-03-15 01:54:49,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 9 remaining) [2025-03-15 01:54:49,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-03-15 01:54:49,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-03-15 01:54:49,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-03-15 01:54:49,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-03-15 01:54:49,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-03-15 01:54:49,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-03-15 01:54:49,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-03-15 01:54:49,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-03-15 01:54:49,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:54:49,781 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:49,785 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:54:49,785 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:54:49,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:54:49 BasicIcfg [2025-03-15 01:54:49,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:54:49,791 INFO L158 Benchmark]: Toolchain (without parser) took 5994.33ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 43.1MB in the beginning and 33.1MB in the end (delta: 10.0MB). Peak memory consumption was 68.9MB. Max. memory is 8.0GB. [2025-03-15 01:54:49,791 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:49,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.83ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 22.1MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-03-15 01:54:49,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.77ms. Allocated memory is still 71.3MB. Free memory was 22.1MB in the beginning and 20.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:49,792 INFO L158 Benchmark]: Boogie Preprocessor took 29.51ms. Allocated memory is still 71.3MB. Free memory was 20.2MB in the beginning and 19.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:49,792 INFO L158 Benchmark]: RCFGBuilder took 341.58ms. Allocated memory is still 71.3MB. Free memory was 19.0MB in the beginning and 30.3MB in the end (delta: -11.2MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2025-03-15 01:54:49,792 INFO L158 Benchmark]: TraceAbstraction took 5244.25ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 29.3MB in the beginning and 33.1MB in the end (delta: -3.8MB). Peak memory consumption was 57.8MB. Max. memory is 8.0GB. [2025-03-15 01:54:49,793 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 335.83ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 22.1MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.77ms. Allocated memory is still 71.3MB. Free memory was 22.1MB in the beginning and 20.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.51ms. Allocated memory is still 71.3MB. Free memory was 20.2MB in the beginning and 19.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 341.58ms. Allocated memory is still 71.3MB. Free memory was 19.0MB in the beginning and 30.3MB in the end (delta: -11.2MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * TraceAbstraction took 5244.25ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 29.3MB in the beginning and 33.1MB in the end (delta: -3.8MB). Peak memory consumption was 57.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 688]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 688]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 693]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 693]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 683]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 683]: 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 3 procedures, 122 locations, 9 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: 5.2s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 877 IncrementalHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 139 mSDtfsCounter, 877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 660 SyntacticMatches, 11 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=13, InterpolantAutomatonStates: 122, 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.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1747 NumberOfCodeBlocks, 1607 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2034 ConstructedInterpolants, 0 QuantifiedInterpolants, 4082 SizeOfPredicates, 25 NumberOfNonLiveVariables, 775 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 1210/1751 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:54:49,804 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...