./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash befa5004268d4c15cae2c05402ac6cc0f86cef85e498084909e66f7e8cc4b8f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:13:50,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:13:51,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:13:51,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:13:51,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:13:51,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:13:51,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:13:51,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:13:51,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:13:51,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:13:51,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:13:51,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:13:51,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:13:51,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:13:51,068 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:13:51,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:13:51,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:13:51,068 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:13:51,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:13:51,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:13:51,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:13:51,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:13:51,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:13:51,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:13:51,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:13:51,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:13:51,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:13:51,070 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:13:51,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:13:51,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:13:51,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:13:51,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:13:51,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:13:51,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:13:51,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:13:51,070 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> befa5004268d4c15cae2c05402ac6cc0f86cef85e498084909e66f7e8cc4b8f3 [2025-03-04 11:13:51,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:13:51,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:13:51,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:13:51,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:13:51,306 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:13:51,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c [2025-03-04 11:13:52,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac08fef1f/5a0ca163b04143a9bca3faa7c622b3d5/FLAG85af56056 [2025-03-04 11:13:52,719 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:13:52,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c [2025-03-04 11:13:52,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac08fef1f/5a0ca163b04143a9bca3faa7c622b3d5/FLAG85af56056 [2025-03-04 11:13:53,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac08fef1f/5a0ca163b04143a9bca3faa7c622b3d5 [2025-03-04 11:13:53,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:13:53,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:13:53,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:13:53,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:13:53,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:13:53,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32fa3121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53, skipping insertion in model container [2025-03-04 11:13:53,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:13:53,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:13:53,193 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:13:53,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:13:53,222 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:13:53,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53 WrapperNode [2025-03-04 11:13:53,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:13:53,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:13:53,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:13:53,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:13:53,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,251 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-03-04 11:13:53,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:13:53,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:13:53,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:13:53,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:13:53,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,274 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-04 11:13:53,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:13:53,282 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:13:53,282 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:13:53,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:13:53,283 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:13:53,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:53,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:13:53,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:13:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:13:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:13:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:13:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:13:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:13:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:13:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:13:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:13:53,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:13:53,439 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:13:53,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:13:53,590 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-04 11:13:53,590 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:13:53,597 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:13:53,597 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:13:53,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:13:53 BoogieIcfgContainer [2025-03-04 11:13:53,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:13:53,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:13:53,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:13:53,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:13:53,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:13:53" (1/3) ... [2025-03-04 11:13:53,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314a0ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:13:53, skipping insertion in model container [2025-03-04 11:13:53,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53" (2/3) ... [2025-03-04 11:13:53,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314a0ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:13:53, skipping insertion in model container [2025-03-04 11:13:53,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:13:53" (3/3) ... [2025-03-04 11:13:53,607 INFO L128 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound5.c [2025-03-04 11:13:53,618 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:13:53,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lcm1_unwindbound5.c that has 3 procedures, 47 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 11:13:53,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:13:53,668 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=LoopHeads, 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;@69124ca6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:13:53,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:13:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:13:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:13:53,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:53,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:53,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:53,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash -867382927, now seen corresponding path program 1 times [2025-03-04 11:13:53,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:53,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161020732] [2025-03-04 11:13:53,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:53,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:53,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:53,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:53,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:53,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:13:53,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161020732] [2025-03-04 11:13:53,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161020732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:53,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941346692] [2025-03-04 11:13:53,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:53,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:53,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:53,795 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-04 11:13:53,797 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-04 11:13:53,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:53,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:53,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:53,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:53,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:13:53,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:13:53,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:13:53,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941346692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:53,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:13:53,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:13:53,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260876441] [2025-03-04 11:13:53,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:53,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:13:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:53,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:13:53,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:13:53,891 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:13:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:53,905 INFO L93 Difference]: Finished difference Result 90 states and 132 transitions. [2025-03-04 11:13:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:13:53,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-04 11:13:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:53,910 INFO L225 Difference]: With dead ends: 90 [2025-03-04 11:13:53,910 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 11:13:53,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:13:53,915 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:53,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 11:13:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 11:13:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:13:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-04 11:13:53,942 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 25 [2025-03-04 11:13:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:53,942 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-04 11:13:53,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:13:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-03-04 11:13:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:13:53,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:53,943 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:53,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:13:54,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:13:54,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:54,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:54,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1360078897, now seen corresponding path program 1 times [2025-03-04 11:13:54,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:54,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697353755] [2025-03-04 11:13:54,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:54,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:54,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:54,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:54,285 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-04 11:13:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:54,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697353755] [2025-03-04 11:13:54,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697353755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:54,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:54,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:13:54,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388947667] [2025-03-04 11:13:54,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:54,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:13:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:54,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:13:54,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:13:54,288 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:13:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:54,331 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-04 11:13:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:13:54,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2025-03-04 11:13:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:54,332 INFO L225 Difference]: With dead ends: 45 [2025-03-04 11:13:54,332 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 11:13:54,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:13:54,333 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:54,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 11:13:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-03-04 11:13:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:13:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-04 11:13:54,338 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 25 [2025-03-04 11:13:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:54,339 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-04 11:13:54,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:13:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-04 11:13:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:13:54,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:54,340 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-04 11:13:54,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:13:54,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:54,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:54,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1700255200, now seen corresponding path program 1 times [2025-03-04 11:13:54,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:54,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450461567] [2025-03-04 11:13:54,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:54,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:13:54,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:13:54,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:54,521 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-04 11:13:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450461567] [2025-03-04 11:13:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450461567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:13:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418505722] [2025-03-04 11:13:54,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:54,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:13:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:54,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:13:54,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:13:54,523 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:54,672 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-03-04 11:13:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:13:54,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-03-04 11:13:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:54,674 INFO L225 Difference]: With dead ends: 62 [2025-03-04 11:13:54,674 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 11:13:54,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:54,675 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:54,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 177 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 11:13:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-03-04 11:13:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 42 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:13:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-03-04 11:13:54,683 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 35 [2025-03-04 11:13:54,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:54,683 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-03-04 11:13:54,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-03-04 11:13:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:13:54,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:54,684 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-04 11:13:54,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:13:54,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:54,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1168303653, now seen corresponding path program 1 times [2025-03-04 11:13:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:54,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279926853] [2025-03-04 11:13:54,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:54,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:13:54,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:13:54,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:54,829 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-04 11:13:54,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:54,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279926853] [2025-03-04 11:13:54,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279926853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:54,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:54,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:13:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727935701] [2025-03-04 11:13:54,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:54,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:13:54,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:54,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:13:54,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:13:54,831 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:54,918 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2025-03-04 11:13:54,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:13:54,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2025-03-04 11:13:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:54,920 INFO L225 Difference]: With dead ends: 91 [2025-03-04 11:13:54,920 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 11:13:54,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:54,920 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:54,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 11:13:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 11:13:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:13:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-04 11:13:54,931 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 36 [2025-03-04 11:13:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:54,932 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-04 11:13:54,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-04 11:13:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:13:54,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:54,932 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 11:13:54,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:13:54,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:54,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1272493830, now seen corresponding path program 1 times [2025-03-04 11:13:54,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:54,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391482815] [2025-03-04 11:13:54,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:54,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:13:54,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:13:54,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:13:55,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:55,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391482815] [2025-03-04 11:13:55,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391482815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:55,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:55,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:13:55,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809175320] [2025-03-04 11:13:55,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:55,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:13:55,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:55,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:13:55,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:55,077 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:55,416 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-03-04 11:13:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:13:55,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2025-03-04 11:13:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:55,418 INFO L225 Difference]: With dead ends: 81 [2025-03-04 11:13:55,418 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 11:13:55,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:13:55,419 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:55,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 232 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:13:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 11:13:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-03-04 11:13:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 57 states have internal predecessors, (68), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:13:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2025-03-04 11:13:55,428 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 45 [2025-03-04 11:13:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:55,428 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2025-03-04 11:13:55,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2025-03-04 11:13:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:13:55,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:55,429 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-04 11:13:55,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:13:55,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:55,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:55,430 INFO L85 PathProgramCache]: Analyzing trace with hash 792603048, now seen corresponding path program 1 times [2025-03-04 11:13:55,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:55,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204853366] [2025-03-04 11:13:55,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:55,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:55,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:55,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:55,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:13:55,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:55,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204853366] [2025-03-04 11:13:55,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204853366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:55,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:55,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:13:55,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102007779] [2025-03-04 11:13:55,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:55,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:13:55,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:55,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:13:55,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:55,539 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:55,704 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-03-04 11:13:55,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:13:55,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2025-03-04 11:13:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:55,705 INFO L225 Difference]: With dead ends: 115 [2025-03-04 11:13:55,705 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 11:13:55,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:13:55,706 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:55,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 186 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 11:13:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-03-04 11:13:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 65 states have internal predecessors, (77), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 11:13:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2025-03-04 11:13:55,716 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 46 [2025-03-04 11:13:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:55,716 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2025-03-04 11:13:55,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2025-03-04 11:13:55,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:13:55,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:55,717 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:55,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:13:55,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:55,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:55,718 INFO L85 PathProgramCache]: Analyzing trace with hash 792675539, now seen corresponding path program 1 times [2025-03-04 11:13:55,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:55,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758254498] [2025-03-04 11:13:55,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:55,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:55,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:55,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:55,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:55,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:13:55,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758254498] [2025-03-04 11:13:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758254498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259511917] [2025-03-04 11:13:55,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:55,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:55,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:55,821 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-04 11:13:55,822 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-04 11:13:55,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:55,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:55,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:55,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:55,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:13:55,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:55,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:13:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259511917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:56,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:56,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-04 11:13:56,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567225239] [2025-03-04 11:13:56,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:56,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:13:56,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:56,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:13:56,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:13:56,117 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-04 11:13:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:56,639 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2025-03-04 11:13:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:13:56,639 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 46 [2025-03-04 11:13:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:56,641 INFO L225 Difference]: With dead ends: 233 [2025-03-04 11:13:56,641 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 11:13:56,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:13:56,642 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:56,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 289 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:13:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 11:13:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2025-03-04 11:13:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 125 states have (on average 1.272) internal successors, (159), 130 states have internal predecessors, (159), 18 states have call successors, (18), 14 states have call predecessors, (18), 14 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:13:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 195 transitions. [2025-03-04 11:13:56,656 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 195 transitions. Word has length 46 [2025-03-04 11:13:56,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:56,658 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 195 transitions. [2025-03-04 11:13:56,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-04 11:13:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2025-03-04 11:13:56,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:13:56,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:56,659 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2025-03-04 11:13:56,668 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-04 11:13:56,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 11:13:56,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:56,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1498090115, now seen corresponding path program 1 times [2025-03-04 11:13:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:56,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637110319] [2025-03-04 11:13:56,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:56,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:56,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:13:56,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:13:56,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:56,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:56,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:56,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637110319] [2025-03-04 11:13:56,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637110319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:56,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:56,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:13:56,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115323168] [2025-03-04 11:13:56,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:56,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:13:56,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:56,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:13:56,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:13:56,932 INFO L87 Difference]: Start difference. First operand 163 states and 195 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:13:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:56,997 INFO L93 Difference]: Finished difference Result 270 states and 329 transitions. [2025-03-04 11:13:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:13:56,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2025-03-04 11:13:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:56,999 INFO L225 Difference]: With dead ends: 270 [2025-03-04 11:13:56,999 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:13:57,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:13:57,000 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:57,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:13:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 183. [2025-03-04 11:13:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 146 states have internal predecessors, (182), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:13:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 226 transitions. [2025-03-04 11:13:57,021 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 226 transitions. Word has length 55 [2025-03-04 11:13:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:57,021 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 226 transitions. [2025-03-04 11:13:57,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:13:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 226 transitions. [2025-03-04 11:13:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:13:57,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:57,022 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:57,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:13:57,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:57,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:57,022 INFO L85 PathProgramCache]: Analyzing trace with hash -803810935, now seen corresponding path program 1 times [2025-03-04 11:13:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:57,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016885034] [2025-03-04 11:13:57,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:57,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:57,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:13:57,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:13:57,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:57,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:57,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:57,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016885034] [2025-03-04 11:13:57,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016885034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:57,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424827266] [2025-03-04 11:13:57,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:57,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:57,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:57,169 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-04 11:13:57,175 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-04 11:13:57,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:13:57,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:13:57,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:57,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:57,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:13:57,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:57,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:57,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424827266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:57,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:57,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-04 11:13:57,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083873013] [2025-03-04 11:13:57,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:57,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 11:13:57,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:57,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 11:13:57,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:13:57,465 INFO L87 Difference]: Start difference. First operand 183 states and 226 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 11:13:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:58,423 INFO L93 Difference]: Finished difference Result 379 states and 473 transitions. [2025-03-04 11:13:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 11:13:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Word has length 56 [2025-03-04 11:13:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:58,426 INFO L225 Difference]: With dead ends: 379 [2025-03-04 11:13:58,426 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 11:13:58,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=507, Invalid=1943, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 11:13:58,428 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 175 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:58,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 327 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:13:58,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 11:13:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 263. [2025-03-04 11:13:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 206 states have (on average 1.2766990291262137) internal successors, (263), 211 states have internal predecessors, (263), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 11:13:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 321 transitions. [2025-03-04 11:13:58,458 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 321 transitions. Word has length 56 [2025-03-04 11:13:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:58,458 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 321 transitions. [2025-03-04 11:13:58,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 11:13:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 321 transitions. [2025-03-04 11:13:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 11:13:58,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:58,460 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:58,467 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-04 11:13:58,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:58,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:58,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -281102517, now seen corresponding path program 1 times [2025-03-04 11:13:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694626836] [2025-03-04 11:13:58,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:58,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:13:58,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:13:58,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:58,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:58,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694626836] [2025-03-04 11:13:58,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694626836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414888886] [2025-03-04 11:13:58,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:58,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:58,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:58,773 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-04 11:13:58,775 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-04 11:13:58,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:13:58,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:13:58,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:58,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:58,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:13:58,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:58,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:59,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414888886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:59,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:59,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 17 [2025-03-04 11:13:59,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216183493] [2025-03-04 11:13:59,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:59,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:13:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:59,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:13:59,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:13:59,032 INFO L87 Difference]: Start difference. First operand 263 states and 321 transitions. Second operand has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 6 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-04 11:13:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:59,455 INFO L93 Difference]: Finished difference Result 425 states and 526 transitions. [2025-03-04 11:13:59,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:13:59,456 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 6 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 59 [2025-03-04 11:13:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:59,459 INFO L225 Difference]: With dead ends: 425 [2025-03-04 11:13:59,459 INFO L226 Difference]: Without dead ends: 286 [2025-03-04 11:13:59,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2025-03-04 11:13:59,461 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:59,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 378 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:13:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-04 11:13:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 281. [2025-03-04 11:13:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 222 states have (on average 1.2567567567567568) internal successors, (279), 227 states have internal predecessors, (279), 30 states have call successors, (30), 23 states have call predecessors, (30), 23 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 11:13:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 339 transitions. [2025-03-04 11:13:59,479 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 339 transitions. Word has length 59 [2025-03-04 11:13:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:59,480 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 339 transitions. [2025-03-04 11:13:59,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 6 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-04 11:13:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 339 transitions. [2025-03-04 11:13:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:13:59,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:59,482 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:59,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:13:59,682 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-04 11:13:59,683 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:59,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash -926240830, now seen corresponding path program 1 times [2025-03-04 11:13:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:59,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113860112] [2025-03-04 11:13:59,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:59,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:13:59,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:13:59,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:59,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:13:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113860112] [2025-03-04 11:13:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113860112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640717075] [2025-03-04 11:13:59,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:59,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:59,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:59,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:13:59,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:13:59,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:13:59,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:13:59,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:59,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:59,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:13:59,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:00,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:14:00,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640717075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:00,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:14:00,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2025-03-04 11:14:00,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573145612] [2025-03-04 11:14:00,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:00,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:14:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:00,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:14:00,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:14:00,021 INFO L87 Difference]: Start difference. First operand 281 states and 339 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 11:14:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:00,384 INFO L93 Difference]: Finished difference Result 349 states and 421 transitions. [2025-03-04 11:14:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:14:00,384 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 65 [2025-03-04 11:14:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:00,386 INFO L225 Difference]: With dead ends: 349 [2025-03-04 11:14:00,386 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 11:14:00,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:14:00,389 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:00,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 142 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:14:00,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 11:14:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 255. [2025-03-04 11:14:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 202 states have (on average 1.183168316831683) internal successors, (239), 205 states have internal predecessors, (239), 28 states have call successors, (28), 22 states have call predecessors, (28), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 11:14:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 295 transitions. [2025-03-04 11:14:00,404 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 295 transitions. Word has length 65 [2025-03-04 11:14:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:00,404 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 295 transitions. [2025-03-04 11:14:00,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 11:14:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 295 transitions. [2025-03-04 11:14:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:14:00,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:00,405 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:00,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:00,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:14:00,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:00,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1351305348, now seen corresponding path program 1 times [2025-03-04 11:14:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322008861] [2025-03-04 11:14:00,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:00,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:14:00,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:14:00,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:00,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:14:00,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:00,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322008861] [2025-03-04 11:14:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322008861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:00,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964641185] [2025-03-04 11:14:00,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:00,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:00,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:00,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:00,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:14:00,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:14:00,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:14:00,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:00,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:00,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:14:00,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:00,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:14:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964641185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:01,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:01,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-03-04 11:14:01,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346658351] [2025-03-04 11:14:01,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:01,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 11:14:01,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:01,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 11:14:01,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:14:01,105 INFO L87 Difference]: Start difference. First operand 255 states and 295 transitions. Second operand has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-04 11:14:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:02,167 INFO L93 Difference]: Finished difference Result 294 states and 342 transitions. [2025-03-04 11:14:02,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 11:14:02,168 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Word has length 66 [2025-03-04 11:14:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:02,170 INFO L225 Difference]: With dead ends: 294 [2025-03-04 11:14:02,170 INFO L226 Difference]: Without dead ends: 293 [2025-03-04 11:14:02,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 11:14:02,172 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 174 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:02,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 369 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:14:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-04 11:14:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2025-03-04 11:14:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 213 states have (on average 1.1784037558685445) internal successors, (251), 216 states have internal predecessors, (251), 29 states have call successors, (29), 23 states have call predecessors, (29), 23 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 11:14:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 309 transitions. [2025-03-04 11:14:02,191 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 309 transitions. Word has length 66 [2025-03-04 11:14:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:02,191 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 309 transitions. [2025-03-04 11:14:02,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-04 11:14:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 309 transitions. [2025-03-04 11:14:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 11:14:02,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:02,193 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-04 11:14:02,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:02,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:02,393 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:02,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash -112849287, now seen corresponding path program 1 times [2025-03-04 11:14:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:02,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755150553] [2025-03-04 11:14:02,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:02,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:02,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 11:14:02,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:14:02,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:02,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:14:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755150553] [2025-03-04 11:14:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755150553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922633051] [2025-03-04 11:14:02,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:02,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:02,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:02,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:02,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:14:02,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 11:14:02,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:14:02,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:02,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:02,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:14:02,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:02,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:14:02,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922633051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:02,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:02,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 15 [2025-03-04 11:14:02,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019720936] [2025-03-04 11:14:02,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:02,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:14:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:02,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:14:02,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:14:02,818 INFO L87 Difference]: Start difference. First operand 268 states and 309 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-04 11:14:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:03,033 INFO L93 Difference]: Finished difference Result 427 states and 497 transitions. [2025-03-04 11:14:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:14:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 70 [2025-03-04 11:14:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:03,035 INFO L225 Difference]: With dead ends: 427 [2025-03-04 11:14:03,035 INFO L226 Difference]: Without dead ends: 268 [2025-03-04 11:14:03,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 128 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:14:03,036 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:03,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 282 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-04 11:14:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-04 11:14:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 213 states have (on average 1.1737089201877935) internal successors, (250), 216 states have internal predecessors, (250), 29 states have call successors, (29), 23 states have call predecessors, (29), 23 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 11:14:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2025-03-04 11:14:03,049 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 70 [2025-03-04 11:14:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:03,049 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2025-03-04 11:14:03,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-04 11:14:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2025-03-04 11:14:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 11:14:03,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:03,050 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:03,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:14:03,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:03,254 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:03,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:03,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1620485776, now seen corresponding path program 1 times [2025-03-04 11:14:03,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:03,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054384028] [2025-03-04 11:14:03,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:03,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:03,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 11:14:03,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 11:14:03,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:03,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:14:03,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:03,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054384028] [2025-03-04 11:14:03,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054384028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:03,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159772978] [2025-03-04 11:14:03,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:03,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:03,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:03,434 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:03,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:14:03,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 11:14:03,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 11:14:03,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:03,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:03,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:14:03,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:03,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:14:03,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159772978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:03,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:03,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2025-03-04 11:14:03,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429857673] [2025-03-04 11:14:03,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:03,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 11:14:03,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:03,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 11:14:03,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:14:03,865 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 36 states have internal predecessors, (109), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-04 11:14:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:05,103 INFO L93 Difference]: Finished difference Result 456 states and 538 transitions. [2025-03-04 11:14:05,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-04 11:14:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 36 states have internal predecessors, (109), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) Word has length 76 [2025-03-04 11:14:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:05,105 INFO L225 Difference]: With dead ends: 456 [2025-03-04 11:14:05,105 INFO L226 Difference]: Without dead ends: 454 [2025-03-04 11:14:05,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1283, Invalid=4723, Unknown=0, NotChecked=0, Total=6006 [2025-03-04 11:14:05,108 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 321 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:05,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 419 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:14:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-04 11:14:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 387. [2025-03-04 11:14:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 308 states have (on average 1.1948051948051948) internal successors, (368), 311 states have internal predecessors, (368), 41 states have call successors, (41), 35 states have call predecessors, (41), 35 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 11:14:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 450 transitions. [2025-03-04 11:14:05,131 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 450 transitions. Word has length 76 [2025-03-04 11:14:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:05,131 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 450 transitions. [2025-03-04 11:14:05,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 36 states have internal predecessors, (109), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-04 11:14:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 450 transitions. [2025-03-04 11:14:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:14:05,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:05,132 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:05,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:05,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:14:05,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:05,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:05,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1354261003, now seen corresponding path program 1 times [2025-03-04 11:14:05,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:05,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158853290] [2025-03-04 11:14:05,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:05,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:05,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:14:05,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:14:05,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:05,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:14:05,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:05,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158853290] [2025-03-04 11:14:05,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158853290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:05,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74593900] [2025-03-04 11:14:05,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:05,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:05,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:05,526 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:05,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:14:05,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:14:05,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:14:05,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:05,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:05,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:14:05,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 3 proven. 76 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:05,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:14:06,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74593900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:06,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:06,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 40 [2025-03-04 11:14:06,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973617158] [2025-03-04 11:14:06,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:06,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 11:14:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:06,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 11:14:06,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1315, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 11:14:06,003 INFO L87 Difference]: Start difference. First operand 387 states and 450 transitions. Second operand has 41 states, 40 states have (on average 3.025) internal successors, (121), 41 states have internal predecessors, (121), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-04 11:14:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:07,458 INFO L93 Difference]: Finished difference Result 497 states and 575 transitions. [2025-03-04 11:14:07,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-04 11:14:07,458 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.025) internal successors, (121), 41 states have internal predecessors, (121), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) Word has length 80 [2025-03-04 11:14:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:07,461 INFO L225 Difference]: With dead ends: 497 [2025-03-04 11:14:07,461 INFO L226 Difference]: Without dead ends: 496 [2025-03-04 11:14:07,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1498, Invalid=6158, Unknown=0, NotChecked=0, Total=7656 [2025-03-04 11:14:07,467 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 327 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:07,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 451 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:14:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-04 11:14:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 345. [2025-03-04 11:14:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 274 states have (on average 1.1934306569343065) internal successors, (327), 277 states have internal predecessors, (327), 37 states have call successors, (37), 31 states have call predecessors, (37), 31 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 11:14:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 401 transitions. [2025-03-04 11:14:07,483 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 401 transitions. Word has length 80 [2025-03-04 11:14:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:07,483 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 401 transitions. [2025-03-04 11:14:07,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.025) internal successors, (121), 41 states have internal predecessors, (121), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-04 11:14:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 401 transitions. [2025-03-04 11:14:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 11:14:07,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:07,484 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:07,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:14:07,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:14:07,685 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:07,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1139431772, now seen corresponding path program 1 times [2025-03-04 11:14:07,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:07,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934184269] [2025-03-04 11:14:07,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:07,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:07,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:14:07,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:14:07,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:07,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 11:14:07,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:07,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934184269] [2025-03-04 11:14:07,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934184269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:07,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121692277] [2025-03-04 11:14:07,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:07,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:07,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:07,855 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:07,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:14:07,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:14:07,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:14:07,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:07,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:07,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:14:07,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 11:14:07,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 11:14:08,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121692277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:08,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:08,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 17 [2025-03-04 11:14:08,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001709748] [2025-03-04 11:14:08,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:08,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:14:08,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:08,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:14:08,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:14:08,100 INFO L87 Difference]: Start difference. First operand 345 states and 401 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-04 11:14:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:08,696 INFO L93 Difference]: Finished difference Result 769 states and 900 transitions. [2025-03-04 11:14:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:14:08,697 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 96 [2025-03-04 11:14:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:08,699 INFO L225 Difference]: With dead ends: 769 [2025-03-04 11:14:08,699 INFO L226 Difference]: Without dead ends: 553 [2025-03-04 11:14:08,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 179 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:14:08,700 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 65 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:08,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 596 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:14:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-04 11:14:08,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 516. [2025-03-04 11:14:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 413 states have (on average 1.2130750605326877) internal successors, (501), 416 states have internal predecessors, (501), 53 states have call successors, (53), 47 states have call predecessors, (53), 47 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-04 11:14:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 607 transitions. [2025-03-04 11:14:08,725 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 607 transitions. Word has length 96 [2025-03-04 11:14:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:08,725 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 607 transitions. [2025-03-04 11:14:08,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-04 11:14:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 607 transitions. [2025-03-04 11:14:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 11:14:08,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:08,726 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:08,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:14:08,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:14:08,927 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:08,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash -341088397, now seen corresponding path program 1 times [2025-03-04 11:14:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686234577] [2025-03-04 11:14:08,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:08,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:14:08,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:14:08,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:08,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-04 11:14:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686234577] [2025-03-04 11:14:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686234577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:08,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:08,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:14:08,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781825678] [2025-03-04 11:14:08,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:08,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:14:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:08,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:14:08,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:14:08,984 INFO L87 Difference]: Start difference. First operand 516 states and 607 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:14:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:09,031 INFO L93 Difference]: Finished difference Result 932 states and 1104 transitions. [2025-03-04 11:14:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:14:09,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2025-03-04 11:14:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:09,034 INFO L225 Difference]: With dead ends: 932 [2025-03-04 11:14:09,034 INFO L226 Difference]: Without dead ends: 559 [2025-03-04 11:14:09,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:14:09,035 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:09,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-04 11:14:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 522. [2025-03-04 11:14:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 420 states have (on average 1.207142857142857) internal successors, (507), 423 states have internal predecessors, (507), 52 states have call successors, (52), 47 states have call predecessors, (52), 47 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 11:14:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 611 transitions. [2025-03-04 11:14:09,061 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 611 transitions. Word has length 100 [2025-03-04 11:14:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:09,061 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 611 transitions. [2025-03-04 11:14:09,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:14:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 611 transitions. [2025-03-04 11:14:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:14:09,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:09,064 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 1, 1, 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-04 11:14:09,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:14:09,065 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1740723666, now seen corresponding path program 2 times [2025-03-04 11:14:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127771273] [2025-03-04 11:14:09,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:09,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-03-04 11:14:09,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:14:09,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:09,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-04 11:14:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:09,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127771273] [2025-03-04 11:14:09,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127771273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:09,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:09,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189861771] [2025-03-04 11:14:09,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:09,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:14:09,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:09,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:14:09,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:14:09,203 INFO L87 Difference]: Start difference. First operand 522 states and 611 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:09,294 INFO L93 Difference]: Finished difference Result 550 states and 641 transitions. [2025-03-04 11:14:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:14:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 106 [2025-03-04 11:14:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:09,297 INFO L225 Difference]: With dead ends: 550 [2025-03-04 11:14:09,297 INFO L226 Difference]: Without dead ends: 549 [2025-03-04 11:14:09,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:14:09,298 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:09,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-04 11:14:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 525. [2025-03-04 11:14:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 423 states have (on average 1.2009456264775413) internal successors, (508), 426 states have internal predecessors, (508), 52 states have call successors, (52), 47 states have call predecessors, (52), 47 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 11:14:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 612 transitions. [2025-03-04 11:14:09,325 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 612 transitions. Word has length 106 [2025-03-04 11:14:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:09,325 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 612 transitions. [2025-03-04 11:14:09,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 612 transitions. [2025-03-04 11:14:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 11:14:09,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:09,326 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:09,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:14:09,327 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:09,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:09,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1487313239, now seen corresponding path program 1 times [2025-03-04 11:14:09,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:09,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901345563] [2025-03-04 11:14:09,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:09,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 11:14:09,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 11:14:09,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:09,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-04 11:14:09,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:09,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901345563] [2025-03-04 11:14:09,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901345563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:09,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714838743] [2025-03-04 11:14:09,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:09,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:09,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:09,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:09,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:14:09,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 11:14:09,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 11:14:09,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:09,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:09,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:14:09,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 196 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-04 11:14:09,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 96 proven. 3 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 11:14:09,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714838743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:09,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:09,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2025-03-04 11:14:09,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466305730] [2025-03-04 11:14:09,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:09,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:14:09,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:09,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:14:09,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:14:09,749 INFO L87 Difference]: Start difference. First operand 525 states and 612 transitions. Second operand has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-04 11:14:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:10,367 INFO L93 Difference]: Finished difference Result 824 states and 962 transitions. [2025-03-04 11:14:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 11:14:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) Word has length 110 [2025-03-04 11:14:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:10,370 INFO L225 Difference]: With dead ends: 824 [2025-03-04 11:14:10,370 INFO L226 Difference]: Without dead ends: 602 [2025-03-04 11:14:10,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 199 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=1504, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 11:14:10,372 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:10,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 420 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:14:10,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-04 11:14:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 425. [2025-03-04 11:14:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 345 states have (on average 1.1884057971014492) internal successors, (410), 348 states have internal predecessors, (410), 41 states have call successors, (41), 36 states have call predecessors, (41), 36 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 11:14:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 492 transitions. [2025-03-04 11:14:10,391 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 492 transitions. Word has length 110 [2025-03-04 11:14:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:10,392 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 492 transitions. [2025-03-04 11:14:10,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-04 11:14:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 492 transitions. [2025-03-04 11:14:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 11:14:10,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:10,393 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 10, 10, 9, 9, 9, 9, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:10,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:10,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:10,595 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:10,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash -333555862, now seen corresponding path program 1 times [2025-03-04 11:14:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:10,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535975273] [2025-03-04 11:14:10,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:10,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 11:14:10,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 11:14:10,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:10,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-04 11:14:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535975273] [2025-03-04 11:14:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535975273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695641718] [2025-03-04 11:14:10,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:10,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:10,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:10,713 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:10,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:14:10,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 11:14:10,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 11:14:10,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:10,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:10,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:14:10,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 293 proven. 1 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:14:10,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 93 proven. 1 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2025-03-04 11:14:11,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695641718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:11,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2025-03-04 11:14:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201971787] [2025-03-04 11:14:11,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:11,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:14:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:11,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:14:11,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:14:11,101 INFO L87 Difference]: Start difference. First operand 425 states and 492 transitions. Second operand has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 10 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-03-04 11:14:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:11,687 INFO L93 Difference]: Finished difference Result 786 states and 912 transitions. [2025-03-04 11:14:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 11:14:11,687 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 10 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 156 [2025-03-04 11:14:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:11,689 INFO L225 Difference]: With dead ends: 786 [2025-03-04 11:14:11,689 INFO L226 Difference]: Without dead ends: 341 [2025-03-04 11:14:11,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 289 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:14:11,690 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 111 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:11,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 388 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:14:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-04 11:14:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 202. [2025-03-04 11:14:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 161 states have (on average 1.1677018633540373) internal successors, (188), 162 states have internal predecessors, (188), 21 states have call successors, (21), 18 states have call predecessors, (21), 18 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 11:14:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 230 transitions. [2025-03-04 11:14:11,701 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 230 transitions. Word has length 156 [2025-03-04 11:14:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:11,701 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 230 transitions. [2025-03-04 11:14:11,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 10 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-03-04 11:14:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 230 transitions. [2025-03-04 11:14:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 11:14:11,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:11,702 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 10, 10, 10, 9, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:11,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:14:11,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:11,907 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:11,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:11,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2010221641, now seen corresponding path program 1 times [2025-03-04 11:14:11,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:11,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173380393] [2025-03-04 11:14:11,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:11,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:11,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 11:14:11,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 11:14:11,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:11,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-04 11:14:11,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:11,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173380393] [2025-03-04 11:14:11,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173380393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:11,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:11,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:11,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902481275] [2025-03-04 11:14:11,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:11,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:11,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:11,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:11,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:11,969 INFO L87 Difference]: Start difference. First operand 202 states and 230 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:14:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:11,993 INFO L93 Difference]: Finished difference Result 356 states and 407 transitions. [2025-03-04 11:14:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:11,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 160 [2025-03-04 11:14:11,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:11,995 INFO L225 Difference]: With dead ends: 356 [2025-03-04 11:14:11,995 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 11:14:11,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:11,996 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:11,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 143 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 11:14:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2025-03-04 11:14:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 145 states have internal predecessors, (157), 19 states have call successors, (19), 16 states have call predecessors, (19), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 11:14:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2025-03-04 11:14:12,004 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 160 [2025-03-04 11:14:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:12,005 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2025-03-04 11:14:12,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:14:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2025-03-04 11:14:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 11:14:12,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:12,006 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:12,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:14:12,006 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:12,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1768344369, now seen corresponding path program 2 times [2025-03-04 11:14:12,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:12,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796595832] [2025-03-04 11:14:12,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:12,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-04 11:14:12,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 11:14:12,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:12,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 137 proven. 7 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-03-04 11:14:12,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:12,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796595832] [2025-03-04 11:14:12,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796595832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:12,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7013127] [2025-03-04 11:14:12,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:12,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:12,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:12,191 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:12,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:14:12,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-04 11:14:12,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 11:14:12,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:12,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:12,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:14:12,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 472 proven. 4 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-04 11:14:12,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 272 proven. 4 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 11:14:12,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7013127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:12,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:12,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 22 [2025-03-04 11:14:12,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774753978] [2025-03-04 11:14:12,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:12,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 11:14:12,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:12,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 11:14:12,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:14:12,591 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 22 states have internal predecessors, (96), 10 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-04 11:14:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:13,125 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2025-03-04 11:14:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 11:14:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 22 states have internal predecessors, (96), 10 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 160 [2025-03-04 11:14:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:13,130 INFO L225 Difference]: With dead ends: 308 [2025-03-04 11:14:13,130 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 11:14:13,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 296 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1433, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:14:13,131 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 77 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:13,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 451 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:14:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 11:14:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2025-03-04 11:14:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 148 states have (on average 1.0743243243243243) internal successors, (159), 148 states have internal predecessors, (159), 19 states have call successors, (19), 16 states have call predecessors, (19), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 11:14:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 197 transitions. [2025-03-04 11:14:13,142 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 197 transitions. Word has length 160 [2025-03-04 11:14:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:13,142 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 197 transitions. [2025-03-04 11:14:13,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 22 states have internal predecessors, (96), 10 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-04 11:14:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 197 transitions. [2025-03-04 11:14:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-04 11:14:13,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:13,144 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:13,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:13,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 11:14:13,345 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:13,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash 204943619, now seen corresponding path program 1 times [2025-03-04 11:14:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:13,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583148706] [2025-03-04 11:14:13,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:13,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 11:14:13,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 11:14:13,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:13,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2025-03-04 11:14:13,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:13,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583148706] [2025-03-04 11:14:13,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583148706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:13,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235944130] [2025-03-04 11:14:13,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:13,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:13,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:13,491 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:13,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:14:13,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 11:14:13,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 11:14:13,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:13,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:13,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:14:13,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-03-04 11:14:13,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:14:13,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235944130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:13,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:14:13,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-03-04 11:14:13,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678961530] [2025-03-04 11:14:13,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:13,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:14:13,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:13,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:14:13,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:14:13,605 INFO L87 Difference]: Start difference. First operand 184 states and 197 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:13,651 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2025-03-04 11:14:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:14:13,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 182 [2025-03-04 11:14:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:13,652 INFO L225 Difference]: With dead ends: 192 [2025-03-04 11:14:13,653 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:14:13,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:14:13,653 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:13,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 157 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:14:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:14:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:14:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:14:13,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2025-03-04 11:14:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:13,654 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:14:13,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:14:13,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:14:13,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 11:14:13,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 11:14:13,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 11:14:13,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 11:14:13,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 11:14:13,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 11:14:13,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:13,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:13,865 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:13,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:14:15,127 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:14:15,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:14:15 BoogieIcfgContainer [2025-03-04 11:14:15,142 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:14:15,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:14:15,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:14:15,143 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:14:15,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:13:53" (3/4) ... [2025-03-04 11:14:15,145 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:14:15,150 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 11:14:15,151 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:14:15,154 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 11:14:15,155 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 11:14:15,155 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:14:15,155 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:14:15,155 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:14:15,235 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:14:15,236 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:14:15,236 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:14:15,236 INFO L158 Benchmark]: Toolchain (without parser) took 22188.32ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 105.5MB in the beginning and 328.9MB in the end (delta: -223.4MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2025-03-04 11:14:15,237 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:14:15,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.58ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:14:15,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.69ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:14:15,238 INFO L158 Benchmark]: Boogie Preprocessor took 29.42ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.4MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:14:15,238 INFO L158 Benchmark]: IcfgBuilder took 315.55ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 77.8MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:14:15,238 INFO L158 Benchmark]: TraceAbstraction took 21542.00ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 76.8MB in the beginning and 335.6MB in the end (delta: -258.9MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. [2025-03-04 11:14:15,239 INFO L158 Benchmark]: Witness Printer took 93.13ms. Allocated memory is still 394.3MB. Free memory was 335.6MB in the beginning and 328.9MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:14:15,240 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.99ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.58ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.69ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.42ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.4MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 315.55ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 77.8MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21542.00ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 76.8MB in the beginning and 335.6MB in the end (delta: -258.9MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. * Witness Printer took 93.13ms. Allocated memory is still 394.3MB. Free memory was 335.6MB in the beginning and 328.9MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 23, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1816 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1810 mSDsluCounter, 6182 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5214 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4732 IncrementalHoareTripleChecker+Invalid, 4980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 968 mSDtfsCounter, 4732 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2676 GetRequests, 2028 SyntacticMatches, 58 SemanticMatches, 590 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6503 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=18, InterpolantAutomatonStates: 469, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 874 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 3102 NumberOfCodeBlocks, 3102 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4029 ConstructedInterpolants, 0 QuantifiedInterpolants, 7279 SizeOfPredicates, 106 NumberOfNonLiveVariables, 2941 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 48 InterpolantComputations, 12 PerfectInterpolantSequences, 9344/9911 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 - InvariantResult [Line: 44]: Location Invariant Derived location invariant: (((((counter == 3) || (counter == 5)) || (counter == 4)) || ((y != x) && (counter == 1))) || (counter == 2)) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((counter <= 5) && (3 <= counter)) || ((6 <= counter) && (counter <= 2147483645))) || (((2 <= counter) && (counter <= 5)) && (x <= y))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((4 <= counter) && (counter <= 2147483646)) || (counter == 0)) || (((counter <= 2147483646) && (x <= y)) && (3 <= counter))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:14:15,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE