./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_init3_ground-1.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_init3_ground-1.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 cf075c7a0f36deed034651e013a7dc7f79bc6e15194db51bf9fa9ace21130e71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:37:38,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:37:38,745 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:38,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:37:38,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:37:38,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:37:38,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:37:38,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:37:38,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:37:38,765 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:37:38,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:37:38,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:37:38,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:37:38,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:37:38,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:37:38,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:37:38,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:37:38,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:37:38,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:37:38,768 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 -> cf075c7a0f36deed034651e013a7dc7f79bc6e15194db51bf9fa9ace21130e71 [2025-03-17 14:37:38,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:37:39,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:37:39,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:37:39,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:37:39,008 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:37:39,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init3_ground-1.i [2025-03-17 14:37:40,117 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e0f9ca9/6ae22bd2817a42c2a1dd982272754e5d/FLAG71914437b [2025-03-17 14:37:40,293 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:37:40,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init3_ground-1.i [2025-03-17 14:37:40,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e0f9ca9/6ae22bd2817a42c2a1dd982272754e5d/FLAG71914437b [2025-03-17 14:37:40,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e0f9ca9/6ae22bd2817a42c2a1dd982272754e5d [2025-03-17 14:37:40,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:37:40,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:37:40,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:37:40,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:37:40,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:37:40,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:37:40" (1/1) ... [2025-03-17 14:37:40,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:40, skipping insertion in model container [2025-03-17 14:37:40,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:37:40" (1/1) ... [2025-03-17 14:37:40,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:37:40,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:37:40,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:37:40,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:37:40,852 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:37:40,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:40 WrapperNode [2025-03-17 14:37:40,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:37:40,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:37:40,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:37:40,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:37:40,857 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:40" (1/1) ... [2025-03-17 14:37:40,864 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:40" (1/1) ... [2025-03-17 14:37:40,875 INFO L138 Inliner]: procedures = 15, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-03-17 14:37:40,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:37:40,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:37:40,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:37:40,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:37:40,883 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:40" (1/1) ... [2025-03-17 14:37:40,883 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:40" (1/1) ... [2025-03-17 14:37:40,888 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:40" (1/1) ... [2025-03-17 14:37:40,901 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-17 14:37:40,902 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:40" (1/1) ... [2025-03-17 14:37:40,902 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:40" (1/1) ... [2025-03-17 14:37:40,905 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:40" (1/1) ... [2025-03-17 14:37:40,909 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:40" (1/1) ... [2025-03-17 14:37:40,910 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:40" (1/1) ... [2025-03-17 14:37:40,910 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:40" (1/1) ... [2025-03-17 14:37:40,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:37:40,914 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:37:40,914 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:37:40,914 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:37:40,915 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:40" (1/1) ... [2025-03-17 14:37:40,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:37:40,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:40,945 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:40,948 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:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:37:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:37:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:37:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:37:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:37:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:37:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:37:40,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:37:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:37:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:37:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:37:41,016 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:37:41,017 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:37:41,133 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:41,139 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-17 14:37:41,140 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:37:41,146 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:37:41,147 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:37:41,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:37:41 BoogieIcfgContainer [2025-03-17 14:37:41,148 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:37:41,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:37:41,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:37:41,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:37:41,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:37:40" (1/3) ... [2025-03-17 14:37:41,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bde38d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:37:41, skipping insertion in model container [2025-03-17 14:37:41,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:40" (2/3) ... [2025-03-17 14:37:41,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bde38d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:37:41, skipping insertion in model container [2025-03-17 14:37:41,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:37:41" (3/3) ... [2025-03-17 14:37:41,156 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_init3_ground-1.i [2025-03-17 14:37:41,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:37:41,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_init3_ground-1.i that has 1 procedures, 28 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-17 14:37:41,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:37:41,202 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;@65f36757, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:37:41,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 14:37:41,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.736842105263158) internal successors, (33), 27 states have internal predecessors, (33), 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:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 14:37:41,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:41,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 14:37:41,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:37:41,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash 62527, now seen corresponding path program 1 times [2025-03-17 14:37:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:41,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595123234] [2025-03-17 14:37:41,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:41,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:41,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:37:41,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:37:41,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:41,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:41,330 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:41,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595123234] [2025-03-17 14:37:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595123234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:41,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:41,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:37:41,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592928711] [2025-03-17 14:37:41,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:41,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:37:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:41,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:37:41,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:41,351 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.736842105263158) internal successors, (33), 27 states have internal predecessors, (33), 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:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:41,417 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2025-03-17 14:37:41,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:37:41,419 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:41,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:41,423 INFO L225 Difference]: With dead ends: 60 [2025-03-17 14:37:41,423 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 14:37:41,424 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:41,426 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:41,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:37:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 14:37:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 14:37:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 31 states have internal predecessors, (35), 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:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-03-17 14:37:41,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 3 [2025-03-17 14:37:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:41,451 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-03-17 14:37:41,452 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:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-03-17 14:37:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:37:41,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:41,454 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:37:41,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:37:41,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:37:41,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1862739997, now seen corresponding path program 1 times [2025-03-17 14:37:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:41,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530577224] [2025-03-17 14:37:41,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:41,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:41,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:37:41,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:37:41,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:41,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:37:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:41,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530577224] [2025-03-17 14:37:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530577224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:37:41,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014377605] [2025-03-17 14:37:41,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:41,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:41,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:41,535 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:41,537 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:41,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:37:41,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:37:41,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:41,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:41,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:37:41,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:37:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:37:41,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:37:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014377605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:37:41,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-03-17 14:37:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110542438] [2025-03-17 14:37:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:41,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:37:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:41,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:37:41,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:37:41,621 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:37:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:41,674 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-03-17 14:37:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:37:41,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:37:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:41,675 INFO L225 Difference]: With dead ends: 32 [2025-03-17 14:37:41,675 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 14:37:41,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:37:41,675 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:41,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 22 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:37:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 14:37:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-17 14:37:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:37:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-03-17 14:37:41,679 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 6 [2025-03-17 14:37:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:41,679 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-03-17 14:37:41,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:37:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-03-17 14:37:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:37:41,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:41,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 14:37:41,687 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:41,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:41,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:37:41,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:41,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1910365057, now seen corresponding path program 1 times [2025-03-17 14:37:41,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:41,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949940975] [2025-03-17 14:37:41,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:41,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:41,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:37:41,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:37:41,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:41,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:41,921 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:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:41,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949940975] [2025-03-17 14:37:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949940975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:41,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:37:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334868403] [2025-03-17 14:37:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:41,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:37:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:41,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:37:41,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:41,922 INFO L87 Difference]: Start difference. First operand 29 states and 32 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:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:41,949 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-03-17 14:37:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:37:41,951 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:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:41,951 INFO L225 Difference]: With dead ends: 29 [2025-03-17 14:37:41,951 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 14:37:41,951 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:41,952 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:41,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:37:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 14:37:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2025-03-17 14:37:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-17 14:37:41,954 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 7 [2025-03-17 14:37:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:41,954 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-17 14:37:41,954 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:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-17 14:37:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:37:41,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:41,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:41,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:37:41,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:37:41,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1747651659, now seen corresponding path program 1 times [2025-03-17 14:37:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:41,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028925194] [2025-03-17 14:37:41,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:41,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:37:41,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:37:41,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:41,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:37:42,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028925194] [2025-03-17 14:37:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028925194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:37:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300993855] [2025-03-17 14:37:42,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:42,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:42,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:42,020 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:42,022 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:42,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:37:42,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:37:42,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:42,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:42,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:37:42,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:37:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:37:42,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:37:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:37:42,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300993855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:37:42,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:37:42,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:37:42,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626696455] [2025-03-17 14:37:42,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:37:42,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:37:42,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:42,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:37:42,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:37:42,105 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:42,165 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-03-17 14:37:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:37:42,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 17 [2025-03-17 14:37:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:42,166 INFO L225 Difference]: With dead ends: 62 [2025-03-17 14:37:42,166 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 14:37:42,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:37:42,166 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:42,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 25 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:37:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 14:37:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 14:37:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 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:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2025-03-17 14:37:42,170 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 17 [2025-03-17 14:37:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:42,170 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2025-03-17 14:37:42,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2025-03-17 14:37:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 14:37:42,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:42,171 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:42,176 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:42,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 14:37:42,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:37:42,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash 574070963, now seen corresponding path program 2 times [2025-03-17 14:37:42,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:42,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404146603] [2025-03-17 14:37:42,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:37:42,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:42,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 14:37:42,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 44 statements. [2025-03-17 14:37:42,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:37:42,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 14:37:42,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404146603] [2025-03-17 14:37:42,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404146603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:42,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:42,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:37:42,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786923970] [2025-03-17 14:37:42,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:42,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:37:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:42,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:37:42,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:37:42,435 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:42,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:42,463 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2025-03-17 14:37:42,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:37:42,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 44 [2025-03-17 14:37:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:42,464 INFO L225 Difference]: With dead ends: 54 [2025-03-17 14:37:42,465 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 14:37:42,465 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:42,465 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 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:42,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 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:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 14:37:42,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 14:37:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 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:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2025-03-17 14:37:42,469 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 44 [2025-03-17 14:37:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:42,471 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2025-03-17 14:37:42,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2025-03-17 14:37:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 14:37:42,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:42,472 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:42,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:37:42,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:37:42,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:42,473 INFO L85 PathProgramCache]: Analyzing trace with hash -544609392, now seen corresponding path program 1 times [2025-03-17 14:37:42,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:42,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-03-17 14:37:42,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:42,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:42,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:37:42,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:37:42,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:42,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 14:37:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-03-17 14:37:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930090440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:37:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972584427] [2025-03-17 14:37:42,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:42,641 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:42,643 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:42,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:37:42,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:37:42,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:42,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:42,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:37:42,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:37:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 14:37:42,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:37:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 14:37:42,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972584427] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:37:42,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:37:42,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 14:37:42,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961495467] [2025-03-17 14:37:42,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:37:42,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:37:42,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:42,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:37:42,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:37:42,790 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 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:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:42,956 INFO L93 Difference]: Finished difference Result 144 states and 167 transitions. [2025-03-17 14:37:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:37:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 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 49 [2025-03-17 14:37:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:42,957 INFO L225 Difference]: With dead ends: 144 [2025-03-17 14:37:42,957 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 14:37:42,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:37:42,958 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 84 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:42,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 46 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:37:42,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 14:37:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 14:37:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0480769230769231) internal successors, (109), 105 states have internal predecessors, (109), 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:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2025-03-17 14:37:42,971 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 49 [2025-03-17 14:37:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:42,971 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2025-03-17 14:37:42,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 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:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2025-03-17 14:37:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 14:37:42,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:42,973 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:42,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:37:43,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:43,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:37:43,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1104286512, now seen corresponding path program 2 times [2025-03-17 14:37:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553412419] [2025-03-17 14:37:43,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:37:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:43,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-03-17 14:37:43,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 14:37:43,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:37:43,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 14:37:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553412419] [2025-03-17 14:37:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553412419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:37:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78916703] [2025-03-17 14:37:43,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:37:43,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:43,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:43,353 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:37:43,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:37:43,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-03-17 14:37:43,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 14:37:43,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:37:43,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:43,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:37:43,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:37:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-03-17 14:37:43,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:37:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-03-17 14:37:43,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78916703] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:37:43,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:37:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 28 [2025-03-17 14:37:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070566133] [2025-03-17 14:37:43,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:37:43,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 14:37:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:43,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 14:37:43,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:37:43,857 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 28 states have internal predecessors, (100), 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:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:44,204 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2025-03-17 14:37:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 14:37:44,205 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 28 states have internal predecessors, (100), 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 103 [2025-03-17 14:37:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:44,206 INFO L225 Difference]: With dead ends: 287 [2025-03-17 14:37:44,206 INFO L226 Difference]: Without dead ends: 213 [2025-03-17 14:37:44,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 183 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:44,210 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 333 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:44,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 24 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:37:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-17 14:37:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-03-17 14:37:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.0188679245283019) internal successors, (216), 212 states have internal predecessors, (216), 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:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 216 transitions. [2025-03-17 14:37:44,230 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 216 transitions. Word has length 103 [2025-03-17 14:37:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:44,231 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 216 transitions. [2025-03-17 14:37:44,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 28 states have internal predecessors, (100), 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:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 216 transitions. [2025-03-17 14:37:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-17 14:37:44,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:44,234 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:44,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:37:44,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:44,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:37:44,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash 994724502, now seen corresponding path program 1 times [2025-03-17 14:37:44,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:44,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114033973] [2025-03-17 14:37:44,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:44,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:44,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 14:37:44,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 14:37:44,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:44,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2146 trivial. 0 not checked. [2025-03-17 14:37:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114033973] [2025-03-17 14:37:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114033973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:37:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865930358] [2025-03-17 14:37:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:44,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:37:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:44,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:37:44,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:37:44,620 INFO L87 Difference]: Start difference. First operand 213 states and 216 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:44,633 INFO L93 Difference]: Finished difference Result 213 states and 216 transitions. [2025-03-17 14:37:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:37:44,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 212 [2025-03-17 14:37:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:44,635 INFO L225 Difference]: With dead ends: 213 [2025-03-17 14:37:44,636 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:37:44,636 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:44,636 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 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:44,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 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:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:37:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:37:44,639 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:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:37:44,639 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2025-03-17 14:37:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:44,639 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:37:44,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:37:44,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:37:44,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 14:37:44,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 14:37:44,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 14:37:44,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 14:37:44,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 14:37:44,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 14:37:44,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 14:37:44,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 14:37:44,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:37:44,647 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-17 14:37:44,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:37:44,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:37:44,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:37:44 BoogieIcfgContainer [2025-03-17 14:37:44,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:37:44,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:37:44,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:37:44,711 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:37:44,712 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:41" (3/4) ... [2025-03-17 14:37:44,713 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:37:44,719 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 14:37:44,720 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:37:44,720 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:37:44,720 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:37:44,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:37:44,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:37:44,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:37:44,773 INFO L158 Benchmark]: Toolchain (without parser) took 4083.39ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 40.7MB in the end (delta: 72.8MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2025-03-17 14:37:44,774 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:37:44,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.78ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 102.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:37:44,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.29ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:37:44,775 INFO L158 Benchmark]: Boogie Preprocessor took 37.27ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:37:44,775 INFO L158 Benchmark]: IcfgBuilder took 234.18ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 87.7MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:37:44,775 INFO L158 Benchmark]: TraceAbstraction took 3560.54ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 46.5MB in the end (delta: 40.7MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2025-03-17 14:37:44,775 INFO L158 Benchmark]: Witness Printer took 62.03ms. Allocated memory is still 142.6MB. Free memory was 46.5MB in the beginning and 40.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:37:44,776 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.24ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.78ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 102.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.29ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.27ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 234.18ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 87.7MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3560.54ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 46.5MB in the end (delta: 40.7MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * Witness Printer took 62.03ms. Allocated memory is still 142.6MB. Free memory was 46.5MB in the beginning and 40.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: 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, 28 locations, 33 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 464 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 296 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 553 IncrementalHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 296 mSolverCounterUnsat, 98 mSDtfsCounter, 553 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=7, InterpolantAutomatonStates: 64, 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, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 616 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 770 ConstructedInterpolants, 0 QuantifiedInterpolants, 1058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 632 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 3394/3759 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 17]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: ((0 < x) || (x == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:37:44,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE