./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark34_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/loop-zilu/benchmark34_conjunctive.i -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 0414607cdfaf86248673acc731020b311087823754eb03e229e19e48245fa120 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:02:36,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:02:36,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:02:36,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:02:36,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:02:36,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:02:36,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:02:36,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:02:36,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:02:36,766 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:02:36,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:02:36,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:02:36,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:02:36,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:02:36,766 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:02:36,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:02:36,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:02:36,767 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:02:36,768 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:02:36,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:02:36,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:02:36,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:02:36,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:02:36,770 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 -> 0414607cdfaf86248673acc731020b311087823754eb03e229e19e48245fa120 [2025-03-17 15:02:36,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:02:36,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:02:36,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:02:36,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:02:36,974 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:02:36,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark34_conjunctive.i [2025-03-17 15:02:38,086 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e426ed9/7f12ca701a5e4f1d851db303f16661ab/FLAG6dd14df67 [2025-03-17 15:02:38,292 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:02:38,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark34_conjunctive.i [2025-03-17 15:02:38,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e426ed9/7f12ca701a5e4f1d851db303f16661ab/FLAG6dd14df67 [2025-03-17 15:02:38,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e426ed9/7f12ca701a5e4f1d851db303f16661ab [2025-03-17 15:02:38,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:02:38,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:02:38,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:02:38,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:02:38,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:02:38,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad3cdde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38, skipping insertion in model container [2025-03-17 15:02:38,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:02:38,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:02:38,768 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:02:38,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:02:38,790 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:02:38,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38 WrapperNode [2025-03-17 15:02:38,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:02:38,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:02:38,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:02:38,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:02:38,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,809 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2025-03-17 15:02:38,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:02:38,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:02:38,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:02:38,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:02:38,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,827 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:02:38,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:02:38,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:02:38,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:02:38,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:02:38,838 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (1/1) ... [2025-03-17 15:02:38,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:02:38,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:38,869 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-17 15:02:38,871 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-17 15:02:38,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:02:38,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:02:38,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:02:38,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:02:38,932 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:02:38,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:02:39,040 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-17 15:02:39,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:02:39,049 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:02:39,050 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:02:39,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:39 BoogieIcfgContainer [2025-03-17 15:02:39,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:02:39,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:02:39,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:02:39,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:02:39,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:02:38" (1/3) ... [2025-03-17 15:02:39,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2850339f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:02:39, skipping insertion in model container [2025-03-17 15:02:39,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:38" (2/3) ... [2025-03-17 15:02:39,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2850339f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:02:39, skipping insertion in model container [2025-03-17 15:02:39,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:39" (3/3) ... [2025-03-17 15:02:39,059 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark34_conjunctive.i [2025-03-17 15:02:39,070 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:02:39,071 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark34_conjunctive.i that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-17 15:02:39,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:02:39,107 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;@46eca898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:02:39,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 15:02:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 15:02:39,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:39,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 15:02:39,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:39,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1568895, now seen corresponding path program 1 times [2025-03-17 15:02:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515779198] [2025-03-17 15:02:39,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:39,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:39,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 15:02:39,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 15:02:39,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:39,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:39,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:39,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515779198] [2025-03-17 15:02:39,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515779198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:39,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:39,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:02:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960640618] [2025-03-17 15:02:39,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:39,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:39,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:39,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:39,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:39,264 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:39,292 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-03-17 15:02:39,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:39,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 15:02:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:39,298 INFO L225 Difference]: With dead ends: 22 [2025-03-17 15:02:39,298 INFO L226 Difference]: Without dead ends: 10 [2025-03-17 15:02:39,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:39,301 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:39,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-17 15:02:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-17 15:02:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-03-17 15:02:39,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 4 [2025-03-17 15:02:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:39,319 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-03-17 15:02:39,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-03-17 15:02:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:02:39,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:39,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:02:39,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:02:39,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 48635728, now seen corresponding path program 1 times [2025-03-17 15:02:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:39,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380022689] [2025-03-17 15:02:39,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:39,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:39,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:02:39,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:02:39,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:39,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:39,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380022689] [2025-03-17 15:02:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380022689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:02:39,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067539675] [2025-03-17 15:02:39,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:39,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:39,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:39,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:39,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:39,372 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:39,384 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-17 15:02:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:39,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 15:02:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:39,385 INFO L225 Difference]: With dead ends: 14 [2025-03-17 15:02:39,385 INFO L226 Difference]: Without dead ends: 13 [2025-03-17 15:02:39,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:39,385 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:39,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-17 15:02:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-17 15:02:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-17 15:02:39,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2025-03-17 15:02:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:39,388 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-17 15:02:39,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-17 15:02:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:02:39,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:39,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:02:39,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:02:39,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:39,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1507707549, now seen corresponding path program 1 times [2025-03-17 15:02:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:39,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699517656] [2025-03-17 15:02:39,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:39,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:39,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:02:39,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:02:39,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:39,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:39,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699517656] [2025-03-17 15:02:39,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699517656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:39,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:39,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:02:39,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28545018] [2025-03-17 15:02:39,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:39,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:39,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:39,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:39,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:39,433 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:39,447 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-03-17 15:02:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:39,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 15:02:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:39,448 INFO L225 Difference]: With dead ends: 16 [2025-03-17 15:02:39,448 INFO L226 Difference]: Without dead ends: 15 [2025-03-17 15:02:39,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:39,449 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:39,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:39,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-17 15:02:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-17 15:02:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-17 15:02:39,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2025-03-17 15:02:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:39,451 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-17 15:02:39,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-17 15:02:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:02:39,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:39,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:39,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:02:39,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:39,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash -505706258, now seen corresponding path program 1 times [2025-03-17 15:02:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980491567] [2025-03-17 15:02:39,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:39,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:02:39,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:02:39,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:39,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:39,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:39,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980491567] [2025-03-17 15:02:39,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980491567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:39,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:39,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:02:39,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948912464] [2025-03-17 15:02:39,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:39,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:39,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:39,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:39,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:39,495 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:39,506 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-17 15:02:39,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:39,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 15:02:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:39,506 INFO L225 Difference]: With dead ends: 14 [2025-03-17 15:02:39,506 INFO L226 Difference]: Without dead ends: 13 [2025-03-17 15:02:39,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:39,507 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:39,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-17 15:02:39,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-17 15:02:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-17 15:02:39,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2025-03-17 15:02:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:39,509 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-17 15:02:39,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-17 15:02:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 15:02:39,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:39,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:39,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:02:39,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:39,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1250129315, now seen corresponding path program 1 times [2025-03-17 15:02:39,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:39,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817271177] [2025-03-17 15:02:39,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:39,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:39,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:02:39,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:02:39,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:39,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:39,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:39,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817271177] [2025-03-17 15:02:39,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817271177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:39,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670473613] [2025-03-17 15:02:39,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:39,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:39,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:39,594 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-17 15:02:39,596 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-17 15:02:39,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:02:39,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:02:39,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:39,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:39,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:02:39,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:39,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:39,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670473613] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:39,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:39,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 15:02:39,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659623791] [2025-03-17 15:02:39,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:39,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:02:39,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:39,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:02:39,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:02:39,715 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:39,743 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-17 15:02:39,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:02:39,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 15:02:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:39,743 INFO L225 Difference]: With dead ends: 30 [2025-03-17 15:02:39,743 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 15:02:39,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:02:39,744 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:39,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 15:02:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-17 15:02:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-03-17 15:02:39,750 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2025-03-17 15:02:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:39,750 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-03-17 15:02:39,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-03-17 15:02:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 15:02:39,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:39,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:02:39,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:02:39,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:39,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:39,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:39,952 INFO L85 PathProgramCache]: Analyzing trace with hash 99303082, now seen corresponding path program 1 times [2025-03-17 15:02:39,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:39,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108053211] [2025-03-17 15:02:39,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:39,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:39,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 15:02:39,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 15:02:39,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:39,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:40,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:40,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108053211] [2025-03-17 15:02:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108053211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:40,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18027789] [2025-03-17 15:02:40,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:40,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:40,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:40,038 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-17 15:02:40,040 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-17 15:02:40,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 15:02:40,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 15:02:40,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:40,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:40,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:02:40,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:40,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:40,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18027789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:40,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:40,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-17 15:02:40,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050205764] [2025-03-17 15:02:40,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:40,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 15:02:40,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:40,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 15:02:40,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:02:40,287 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:40,431 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-03-17 15:02:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 15:02:40,431 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 15:02:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:40,431 INFO L225 Difference]: With dead ends: 35 [2025-03-17 15:02:40,432 INFO L226 Difference]: Without dead ends: 34 [2025-03-17 15:02:40,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-17 15:02:40,432 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:40,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 27 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:02:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-17 15:02:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-03-17 15:02:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-17 15:02:40,438 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 11 [2025-03-17 15:02:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:40,438 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-17 15:02:40,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-17 15:02:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:02:40,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:40,438 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1] [2025-03-17 15:02:40,447 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-17 15:02:40,638 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,SelfDestructingSolverStorable5 [2025-03-17 15:02:40,639 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:40,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:40,639 INFO L85 PathProgramCache]: Analyzing trace with hash -627785968, now seen corresponding path program 2 times [2025-03-17 15:02:40,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:40,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093290173] [2025-03-17 15:02:40,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:40,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:40,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 15:02:40,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 25 statements. [2025-03-17 15:02:40,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 15:02:40,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 15:02:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093290173] [2025-03-17 15:02:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093290173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904284602] [2025-03-17 15:02:40,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:40,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:40,676 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-17 15:02:40,678 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-17 15:02:40,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 15:02:40,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 25 statements. [2025-03-17 15:02:40,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 15:02:40,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:40,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:02:40,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 15:02:40,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 15:02:40,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904284602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:40,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:40,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-17 15:02:40,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066261455] [2025-03-17 15:02:40,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:40,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:40,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:40,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:40,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:40,768 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:40,778 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2025-03-17 15:02:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:40,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 15:02:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:40,779 INFO L225 Difference]: With dead ends: 33 [2025-03-17 15:02:40,779 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 15:02:40,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:02:40,780 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:40,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 15:02:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 15:02:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2025-03-17 15:02:40,783 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 25 [2025-03-17 15:02:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:40,783 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2025-03-17 15:02:40,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2025-03-17 15:02:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:02:40,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:40,786 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2025-03-17 15:02:40,791 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-17 15:02:40,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:40,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:40,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:40,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1902965142, now seen corresponding path program 2 times [2025-03-17 15:02:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077651447] [2025-03-17 15:02:40,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:40,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 15:02:40,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:02:40,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:41,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 15:02:41,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:41,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077651447] [2025-03-17 15:02:41,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077651447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:41,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275544621] [2025-03-17 15:02:41,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:41,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:41,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:41,197 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-17 15:02:41,199 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-17 15:02:41,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 15:02:41,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:02:41,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:41,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:41,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 15:02:41,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:41,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:41,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275544621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:41,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:41,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 19] total 40 [2025-03-17 15:02:41,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274652330] [2025-03-17 15:02:41,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:41,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-17 15:02:41,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:41,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 15:02:41,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1424, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 15:02:41,941 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 41 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:42,511 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2025-03-17 15:02:42,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 15:02:42,511 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-17 15:02:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:42,511 INFO L225 Difference]: With dead ends: 34 [2025-03-17 15:02:42,511 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:02:42,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=510, Invalid=3030, Unknown=0, NotChecked=0, Total=3540 [2025-03-17 15:02:42,513 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:42,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:02:42,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:02:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:02:42,513 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-17 15:02:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:02:42,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-03-17 15:02:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:42,513 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:02:42,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:02:42,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:02:42,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-17 15:02:42,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-17 15:02:42,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-17 15:02:42,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-17 15:02:42,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:02:42,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:42,721 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-17 15:02:42,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:02:42,820 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:02:42,830 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post4 [2025-03-17 15:02:42,831 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post4 [2025-03-17 15:02:42,832 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post4 [2025-03-17 15:02:42,832 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post4 [2025-03-17 15:02:42,832 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post4 [2025-03-17 15:02:42,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:02:42 BoogieIcfgContainer [2025-03-17 15:02:42,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:02:42,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:02:42,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:02:42,835 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:02:42,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:39" (3/4) ... [2025-03-17 15:02:42,837 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:02:42,841 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-17 15:02:42,842 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:02:42,842 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:02:42,842 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:02:42,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:02:42,888 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:02:42,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:02:42,888 INFO L158 Benchmark]: Toolchain (without parser) took 4243.26ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 53.0MB in the end (delta: 69.8MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-03-17 15:02:42,889 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:02:42,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.71ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 112.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:02:42,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.64ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 111.3MB in the end (delta: 870.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:02:42,889 INFO L158 Benchmark]: Boogie Preprocessor took 27.13ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 110.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:02:42,890 INFO L158 Benchmark]: IcfgBuilder took 212.95ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 99.3MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:02:42,890 INFO L158 Benchmark]: TraceAbstraction took 3782.27ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 58.7MB in the end (delta: 39.7MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2025-03-17 15:02:42,890 INFO L158 Benchmark]: Witness Printer took 53.38ms. Allocated memory is still 167.8MB. Free memory was 58.7MB in the beginning and 53.0MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:02:42,891 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.23ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.71ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 112.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.64ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 111.3MB in the end (delta: 870.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.13ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 110.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 212.95ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 99.3MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3782.27ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 58.7MB in the end (delta: 39.7MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Witness Printer took 53.38ms. Allocated memory is still 167.8MB. Free memory was 58.7MB in the beginning and 53.0MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post4 * 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: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: 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 1 procedures, 18 locations, 21 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 590 IncrementalHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 45 mSDtfsCounter, 590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=6, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 176 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 1199 SizeOfPredicates, 10 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 157/357 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 4 specifications checked. All of them hold - InvariantResult [Line: 24]: Location Invariant Derived location invariant: (((((n <= 2147483647) && (0 <= ((long long) 2147483647 + k))) && (k <= 2147483647)) && (0 <= j)) && (n <= ((long long) j + k))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:02:42,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE