./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_init9_ground-2.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/array-examples/standard_init9_ground-2.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 477192436c119b4e74e1ff9bea9de738ba755c58e7908ace744a87a82dccf838 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:37:47,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:37:48,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:37:48,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:37:48,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:37:48,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:37:48,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:37:48,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:37:48,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:37:48,033 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:37:48,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:37:48,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:37:48,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:37:48,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:37:48,035 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:37:48,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:37:48,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:37:48,035 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:37:48,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:37:48,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:37:48,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:37:48,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:37:48,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:37:48,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:37:48,036 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:37:48,036 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:37:48,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:37:48,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:37:48,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:37:48,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:37:48,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:37:48,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:37:48,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:37:48,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:37:48,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:37:48,038 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 -> 477192436c119b4e74e1ff9bea9de738ba755c58e7908ace744a87a82dccf838 [2025-03-17 14:37:48,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:37:48,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:37:48,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:37:48,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:37:48,279 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:37:48,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init9_ground-2.i [2025-03-17 14:37:49,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c940b2b75/c407233a61f940e5b0187f17771e77a5/FLAGb99a0e5a6 [2025-03-17 14:37:49,648 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:37:49,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init9_ground-2.i [2025-03-17 14:37:49,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c940b2b75/c407233a61f940e5b0187f17771e77a5/FLAGb99a0e5a6 [2025-03-17 14:37:49,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c940b2b75/c407233a61f940e5b0187f17771e77a5 [2025-03-17 14:37:49,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:37:49,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:37:49,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:37:49,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:37:49,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:37:49,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:37:49" (1/1) ... [2025-03-17 14:37:49,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ff4fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:49, skipping insertion in model container [2025-03-17 14:37:49,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:37:49" (1/1) ... [2025-03-17 14:37:49,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:37:50,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:37:50,111 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:37:50,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:37:50,133 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:37:50,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50 WrapperNode [2025-03-17 14:37:50,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:37:50,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:37:50,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:37:50,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:37:50,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,162 INFO L138 Inliner]: procedures = 15, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-03-17 14:37:50,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:37:50,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:37:50,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:37:50,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:37:50,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,179 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2025-03-17 14:37:50,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:37:50,187 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:37:50,187 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:37:50,187 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:37:50,187 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (1/1) ... [2025-03-17 14:37:50,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:37:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:50,214 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 14:37:50,218 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 14:37:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:37:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:37:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:37:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:37:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:37:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:37:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:37:50,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:37:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:37:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:37:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:37:50,282 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:37:50,283 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:37:50,486 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-17 14:37:50,498 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-17 14:37:50,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:37:50,508 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:37:50,509 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:37:50,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:37:50 BoogieIcfgContainer [2025-03-17 14:37:50,511 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:37:50,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:37:50,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:37:50,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:37:50,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:37:49" (1/3) ... [2025-03-17 14:37:50,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd92e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:37:50, skipping insertion in model container [2025-03-17 14:37:50,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:50" (2/3) ... [2025-03-17 14:37:50,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd92e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:37:50, skipping insertion in model container [2025-03-17 14:37:50,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:37:50" (3/3) ... [2025-03-17 14:37:50,520 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_init9_ground-2.i [2025-03-17 14:37:50,531 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:37:50,532 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_init9_ground-2.i that has 1 procedures, 58 locations, 1 initial locations, 10 loop locations, and 20 error locations. [2025-03-17 14:37:50,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:37:50,582 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;@95da526, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:37:50,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-17 14:37:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.864864864864865) internal successors, (69), 57 states have internal predecessors, (69), 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 14:37:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 14:37:50,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:50,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 14:37:50,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:37:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash 98275, now seen corresponding path program 1 times [2025-03-17 14:37:50,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:50,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866028079] [2025-03-17 14:37:50,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:50,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:50,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:37:50,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:37:50,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:50,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:50,726 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 14:37:50,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:50,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866028079] [2025-03-17 14:37:50,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866028079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:50,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:50,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:37:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203717015] [2025-03-17 14:37:50,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:50,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:37:50,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:50,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:37:50,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:50,744 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.864864864864865) internal successors, (69), 57 states have internal predecessors, (69), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 14:37:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:50,848 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2025-03-17 14:37:50,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:37:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-03-17 14:37:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:50,855 INFO L225 Difference]: With dead ends: 69 [2025-03-17 14:37:50,855 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 14:37:50,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:50,859 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:50,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:37:50,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 14:37:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 14:37:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.606060606060606) internal successors, (53), 43 states have internal predecessors, (53), 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 14:37:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-03-17 14:37:50,887 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 3 [2025-03-17 14:37:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:50,888 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-03-17 14:37:50,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 14:37:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-03-17 14:37:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:37:50,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:50,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:37:50,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:37:50,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:37:50,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:50,889 INFO L85 PathProgramCache]: Analyzing trace with hash 3046559, now seen corresponding path program 1 times [2025-03-17 14:37:50,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:50,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040124517] [2025-03-17 14:37:50,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:50,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:50,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:37:50,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:37:50,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:50,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:50,924 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 14:37:50,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:50,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040124517] [2025-03-17 14:37:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040124517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:50,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:50,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:37:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357740122] [2025-03-17 14:37:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:50,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:37:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:50,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:37:50,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:50,927 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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 14:37:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:51,041 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2025-03-17 14:37:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:37:51,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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 14:37:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:51,042 INFO L225 Difference]: With dead ends: 111 [2025-03-17 14:37:51,042 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 14:37:51,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:51,043 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:51,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:37:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 14:37:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 14:37:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 70 states have internal predecessors, (80), 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 14:37:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2025-03-17 14:37:51,049 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 4 [2025-03-17 14:37:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:51,049 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2025-03-17 14:37:51,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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 14:37:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2025-03-17 14:37:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:37:51,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:51,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 14:37:51,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:37:51,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:37:51,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash 565763621, now seen corresponding path program 1 times [2025-03-17 14:37:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:51,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737558011] [2025-03-17 14:37:51,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:51,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:37:51,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:37:51,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:51,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:37:51,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737558011] [2025-03-17 14:37:51,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737558011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:51,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:51,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:37:51,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604555490] [2025-03-17 14:37:51,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:51,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:37:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:51,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:37:51,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:51,088 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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 14:37:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:51,162 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2025-03-17 14:37:51,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:37:51,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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 14:37:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:51,163 INFO L225 Difference]: With dead ends: 71 [2025-03-17 14:37:51,163 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 14:37:51,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:51,164 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:51,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:37:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 14:37:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2025-03-17 14:37:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 43 states have internal predecessors, (53), 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 14:37:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-03-17 14:37:51,170 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 7 [2025-03-17 14:37:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:51,170 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-03-17 14:37:51,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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 14:37:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-03-17 14:37:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 14:37:51,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:51,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:51,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:37:51,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:37:51,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash -998231609, now seen corresponding path program 1 times [2025-03-17 14:37:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097592889] [2025-03-17 14:37:51,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:51,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 14:37:51,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 14:37:51,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:51,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:37:51,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097592889] [2025-03-17 14:37:51,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097592889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:37:51,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14164103] [2025-03-17 14:37:51,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:51,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:51,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:51,272 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 14:37:51,273 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 14:37:51,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 14:37:51,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 14:37:51,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:51,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:51,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:37:51,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:37:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:37:51,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:37:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:37:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14164103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:37:51,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:37:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 14:37:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554740934] [2025-03-17 14:37:51,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:37:51,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:37:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:51,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:37:51,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:37:51,393 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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 14:37:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:51,592 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2025-03-17 14:37:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:37:51,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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 41 [2025-03-17 14:37:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:51,593 INFO L225 Difference]: With dead ends: 164 [2025-03-17 14:37:51,594 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 14:37:51,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:37:51,594 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 100 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:51,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 31 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:37:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 14:37:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-17 14:37:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.089430894308943) internal successors, (134), 124 states have internal predecessors, (134), 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 14:37:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2025-03-17 14:37:51,603 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 41 [2025-03-17 14:37:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:51,603 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2025-03-17 14:37:51,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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 14:37:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2025-03-17 14:37:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 14:37:51,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:51,605 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:51,612 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 14:37:51,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:51,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:37:51,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:51,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1618175039, now seen corresponding path program 2 times [2025-03-17 14:37:51,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:51,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544215648] [2025-03-17 14:37:51,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:37:51,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:51,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-17 14:37:51,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 122 statements. [2025-03-17 14:37:51,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:37:51,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-03-17 14:37:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:51,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544215648] [2025-03-17 14:37:51,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544215648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:51,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:51,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:37:51,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741290952] [2025-03-17 14:37:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:51,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:37:51,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:51,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:37:51,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:37:51,890 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 14:37:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:51,907 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-03-17 14:37:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:37:51,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 122 [2025-03-17 14:37:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:51,908 INFO L225 Difference]: With dead ends: 132 [2025-03-17 14:37:51,908 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 14:37:51,908 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 14:37:51,909 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:51,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:37:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 14:37:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-17 14:37:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.0859375) internal successors, (139), 129 states have internal predecessors, (139), 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 14:37:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2025-03-17 14:37:51,924 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 122 [2025-03-17 14:37:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:51,927 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2025-03-17 14:37:51,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 14:37:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2025-03-17 14:37:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 14:37:51,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:51,929 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:51,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:37:51,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:37:51,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:51,930 INFO L85 PathProgramCache]: Analyzing trace with hash -16930494, now seen corresponding path program 1 times [2025-03-17 14:37:51,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:51,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816686482] [2025-03-17 14:37:51,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:51,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:51,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 14:37:51,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 14:37:51,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:51,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 14:37:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816686482] [2025-03-17 14:37:52,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816686482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:37:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624127933] [2025-03-17 14:37:52,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:52,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:52,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:52,204 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 14:37:52,205 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 14:37:52,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 14:37:52,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 14:37:52,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:52,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:52,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:37:52,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:37:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 14:37:52,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:37:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 14:37:52,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624127933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:37:52,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:37:52,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 14:37:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119077150] [2025-03-17 14:37:52,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:37:52,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:37:52,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:52,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:37:52,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:37:52,431 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 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 14:37:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:52,810 INFO L93 Difference]: Finished difference Result 408 states and 479 transitions. [2025-03-17 14:37:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:37:52,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 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 127 [2025-03-17 14:37:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:52,815 INFO L225 Difference]: With dead ends: 408 [2025-03-17 14:37:52,815 INFO L226 Difference]: Without dead ends: 292 [2025-03-17 14:37:52,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:37:52,816 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 308 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:52,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 38 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:37:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-17 14:37:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-03-17 14:37:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 290 states have (on average 1.0379310344827586) internal successors, (301), 291 states have internal predecessors, (301), 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 14:37:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 301 transitions. [2025-03-17 14:37:52,843 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 301 transitions. Word has length 127 [2025-03-17 14:37:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:52,843 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 301 transitions. [2025-03-17 14:37:52,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 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 14:37:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 301 transitions. [2025-03-17 14:37:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-17 14:37:52,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:52,845 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:52,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:37:53,046 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 14:37:53,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:37:53,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1185260414, now seen corresponding path program 2 times [2025-03-17 14:37:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:53,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432860047] [2025-03-17 14:37:53,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:37:53,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:53,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 289 statements into 2 equivalence classes. [2025-03-17 14:37:53,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 289 of 289 statements. [2025-03-17 14:37:53,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:37:53,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2025-03-17 14:37:53,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:53,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432860047] [2025-03-17 14:37:53,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432860047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:37:53,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52771915] [2025-03-17 14:37:53,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:37:53,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:53,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:53,397 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 14:37:53,399 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 14:37:53,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 289 statements into 2 equivalence classes. [2025-03-17 14:37:53,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 289 of 289 statements. [2025-03-17 14:37:53,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:37:53,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:53,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:37:53,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:37:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 1164 trivial. 0 not checked. [2025-03-17 14:37:53,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:37:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 1164 trivial. 0 not checked. [2025-03-17 14:37:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52771915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:37:53,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:37:53,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 28 [2025-03-17 14:37:53,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503071304] [2025-03-17 14:37:53,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:37:53,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 14:37:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:53,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 14:37:53,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:37:53,989 INFO L87 Difference]: Start difference. First operand 292 states and 301 transitions. Second operand has 28 states, 28 states have (on average 5.285714285714286) internal successors, (148), 28 states have internal predecessors, (148), 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 14:37:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:54,924 INFO L93 Difference]: Finished difference Result 875 states and 1001 transitions. [2025-03-17 14:37:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 14:37:54,924 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.285714285714286) internal successors, (148), 28 states have internal predecessors, (148), 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 289 [2025-03-17 14:37:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:54,926 INFO L225 Difference]: With dead ends: 875 [2025-03-17 14:37:54,926 INFO L226 Difference]: Without dead ends: 615 [2025-03-17 14:37:54,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:37:54,928 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 805 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:54,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 62 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 14:37:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-17 14:37:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2025-03-17 14:37:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.01628664495114) internal successors, (624), 614 states have internal predecessors, (624), 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 14:37:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 624 transitions. [2025-03-17 14:37:54,950 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 624 transitions. Word has length 289 [2025-03-17 14:37:54,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:54,950 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 624 transitions. [2025-03-17 14:37:54,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.285714285714286) internal successors, (148), 28 states have internal predecessors, (148), 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 14:37:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 624 transitions. [2025-03-17 14:37:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-17 14:37:54,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:54,961 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:54,968 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 14:37:55,161 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 14:37:55,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:37:55,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash -462090972, now seen corresponding path program 1 times [2025-03-17 14:37:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:55,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617871679] [2025-03-17 14:37:55,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:55,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:55,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-17 14:37:55,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-17 14:37:55,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:55,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6436 trivial. 0 not checked. [2025-03-17 14:37:55,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:55,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617871679] [2025-03-17 14:37:55,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617871679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:55,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:55,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:37:55,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181977408] [2025-03-17 14:37:55,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:55,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:37:55,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:55,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:37:55,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:37:55,606 INFO L87 Difference]: Start difference. First operand 615 states and 624 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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 14:37:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:55,627 INFO L93 Difference]: Finished difference Result 615 states and 624 transitions. [2025-03-17 14:37:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:37:55,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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 614 [2025-03-17 14:37:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:55,629 INFO L225 Difference]: With dead ends: 615 [2025-03-17 14:37:55,629 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:37:55,630 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 14:37:55,631 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:55,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:37:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:37:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:37:55,632 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 14:37:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:37:55,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 614 [2025-03-17 14:37:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:55,633 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:37:55,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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 14:37:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:37:55,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:37:55,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2025-03-17 14:37:55,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2025-03-17 14:37:55,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2025-03-17 14:37:55,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2025-03-17 14:37:55,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2025-03-17 14:37:55,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2025-03-17 14:37:55,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2025-03-17 14:37:55,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2025-03-17 14:37:55,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2025-03-17 14:37:55,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2025-03-17 14:37:55,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2025-03-17 14:37:55,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2025-03-17 14:37:55,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2025-03-17 14:37:55,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2025-03-17 14:37:55,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2025-03-17 14:37:55,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2025-03-17 14:37:55,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2025-03-17 14:37:55,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2025-03-17 14:37:55,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2025-03-17 14:37:55,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2025-03-17 14:37:55,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:37:55,641 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-17 14:37:55,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:37:55,728 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:37:55,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:37:55 BoogieIcfgContainer [2025-03-17 14:37:55,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:37:55,743 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:37:55,743 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:37:55,743 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:37:55,743 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:37:50" (3/4) ... [2025-03-17 14:37:55,746 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:37:55,753 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 14:37:55,754 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:37:55,754 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:37:55,754 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:37:55,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:37:55,822 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:37:55,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:37:55,823 INFO L158 Benchmark]: Toolchain (without parser) took 5838.48ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 114.0MB in the beginning and 61.9MB in the end (delta: 52.1MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2025-03-17 14:37:55,823 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:37:55,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.48ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 102.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:37:55,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.07ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.5MB in the end (delta: 988.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:37:55,824 INFO L158 Benchmark]: Boogie Preprocessor took 22.78ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:37:55,824 INFO L158 Benchmark]: IcfgBuilder took 324.10ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 85.4MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:37:55,824 INFO L158 Benchmark]: TraceAbstraction took 5229.46ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 84.9MB in the beginning and 68.5MB in the end (delta: 16.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-17 14:37:55,824 INFO L158 Benchmark]: Witness Printer took 79.11ms. Allocated memory is still 192.9MB. Free memory was 68.5MB in the beginning and 61.9MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:37:55,826 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.21ms. Allocated memory is still 226.5MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.48ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 102.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.07ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.5MB in the end (delta: 988.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.78ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 324.10ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 85.4MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5229.46ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 84.9MB in the beginning and 68.5MB in the end (delta: 16.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 79.11ms. Allocated memory is still 192.9MB. Free memory was 68.5MB in the beginning and 61.9MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: 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, 58 locations, 69 edges, 20 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1263 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1263 mSDsluCounter, 435 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 876 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1388 IncrementalHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 876 mSolverCounterUnsat, 179 mSDtfsCounter, 1388 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 885 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=615occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1556 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2107 ConstructedInterpolants, 0 QuantifiedInterpolants, 2381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1450 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 10838/11201 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 20 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 17]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 47]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 62]: Location Invariant Derived location invariant: ((0 < x) || (x == 0)) - InvariantResult [Line: 52]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 57]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:37:55,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE