./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-new/count_by_k.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-new/count_by_k.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 ee41851a84d57c0c483c2a5edf48180b7c141c1991cdc82f0d66c6775eb49f5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:57:30,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:57:30,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:57:30,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:57:30,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:57:30,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:57:30,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:57:30,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:57:30,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:57:30,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:57:30,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:57:30,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:57:30,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:57:30,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:57:30,630 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:57:30,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:57:30,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:57:30,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:57:30,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:57:30,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:57:30,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:57:30,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:57:30,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:57:30,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:57:30,631 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:57:30,632 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:57:30,632 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:57:30,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:57:30,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:57:30,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:57:30,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:57:30,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:57:30,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:57:30,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:57:30,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:30,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:57:30,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:57:30,633 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:57:30,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:57:30,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:57:30,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:57:30,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:57:30,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:57:30,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:57:30,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:57:30,633 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 -> ee41851a84d57c0c483c2a5edf48180b7c141c1991cdc82f0d66c6775eb49f5b [2025-03-09 01:57:30,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:57:30,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:57:30,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:57:30,848 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:57:30,848 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:57:30,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-new/count_by_k.i [2025-03-09 01:57:32,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e106f1e/cda5cfd65aed4c70a1a8df55a9313864/FLAGaf2cfbb49 [2025-03-09 01:57:32,204 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:57:32,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/count_by_k.i [2025-03-09 01:57:32,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e106f1e/cda5cfd65aed4c70a1a8df55a9313864/FLAGaf2cfbb49 [2025-03-09 01:57:32,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e106f1e/cda5cfd65aed4c70a1a8df55a9313864 [2025-03-09 01:57:32,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:57:32,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:57:32,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:32,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:57:32,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:57:32,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d11ea05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32, skipping insertion in model container [2025-03-09 01:57:32,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:57:32,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:57:32,696 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:57:32,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:57:32,714 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:57:32,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32 WrapperNode [2025-03-09 01:57:32,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:32,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:57:32,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:57:32,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:57:32,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,738 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2025-03-09 01:57:32,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:57:32,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:57:32,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:57:32,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:57:32,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,759 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:57:32,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,761 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:57:32,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:57:32,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:57:32,766 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:57:32,767 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (1/1) ... [2025-03-09 01:57:32,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:32,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:32,793 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-09 01:57:32,796 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-09 01:57:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:57:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:57:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:57:32,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:57:32,857 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:57:32,858 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:57:32,965 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-09 01:57:32,966 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:57:32,972 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:57:32,973 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:57:32,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:32 BoogieIcfgContainer [2025-03-09 01:57:32,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:57:32,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:57:32,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:57:32,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:57:32,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:57:32" (1/3) ... [2025-03-09 01:57:32,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40806409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:57:32, skipping insertion in model container [2025-03-09 01:57:32,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:32" (2/3) ... [2025-03-09 01:57:32,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40806409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:57:32, skipping insertion in model container [2025-03-09 01:57:32,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:32" (3/3) ... [2025-03-09 01:57:32,981 INFO L128 eAbstractionObserver]: Analyzing ICFG count_by_k.i [2025-03-09 01:57:32,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:57:32,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG count_by_k.i that has 1 procedures, 24 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-09 01:57:33,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:57:33,030 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;@226b2c3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:57:33,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:57:33,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 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-09 01:57:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 01:57:33,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:33,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 01:57:33,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:57:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1876794, now seen corresponding path program 1 times [2025-03-09 01:57:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:33,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418919733] [2025-03-09 01:57:33,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:33,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:33,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:57:33,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:57:33,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:33,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:33,174 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-09 01:57:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:33,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418919733] [2025-03-09 01:57:33,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418919733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:33,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292717820] [2025-03-09 01:57:33,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:33,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:33,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:33,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:33,196 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:33,241 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-09 01:57:33,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:33,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 01:57:33,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:33,248 INFO L225 Difference]: With dead ends: 34 [2025-03-09 01:57:33,248 INFO L226 Difference]: Without dead ends: 14 [2025-03-09 01:57:33,250 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-09 01:57:33,255 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:33,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 16 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-09 01:57:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-09 01:57:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-09 01:57:33,280 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2025-03-09 01:57:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:33,281 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-09 01:57:33,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-09 01:57:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:57:33,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:33,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:57:33,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:57:33,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:57:33,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash 58180604, now seen corresponding path program 1 times [2025-03-09 01:57:33,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:33,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296158560] [2025-03-09 01:57:33,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:33,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:57:33,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:57:33,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:33,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:33,305 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-09 01:57:33,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:33,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296158560] [2025-03-09 01:57:33,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296158560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:33,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:33,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:33,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685326896] [2025-03-09 01:57:33,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:33,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:33,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:33,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:33,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:33,307 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:33,326 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-09 01:57:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:33,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 01:57:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:33,326 INFO L225 Difference]: With dead ends: 14 [2025-03-09 01:57:33,326 INFO L226 Difference]: Without dead ends: 10 [2025-03-09 01:57:33,327 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-09 01:57:33,328 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:33,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-09 01:57:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-09 01:57:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-03-09 01:57:33,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2025-03-09 01:57:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:33,332 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-03-09 01:57:33,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-03-09 01:57:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:57:33,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:33,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:33,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:57:33,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:57:33,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash 76985210, now seen corresponding path program 1 times [2025-03-09 01:57:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:33,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838068242] [2025-03-09 01:57:33,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:33,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:57:33,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:57:33,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:33,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:33,402 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-09 01:57:33,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:33,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838068242] [2025-03-09 01:57:33,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838068242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:33,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:33,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173519572] [2025-03-09 01:57:33,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:33,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:33,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:33,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:33,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:33,406 INFO L87 Difference]: Start difference. First operand 10 states and 10 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-09 01:57:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:33,423 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-03-09 01:57:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:33,423 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-09 01:57:33,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:33,424 INFO L225 Difference]: With dead ends: 16 [2025-03-09 01:57:33,424 INFO L226 Difference]: Without dead ends: 15 [2025-03-09 01:57:33,424 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-09 01:57:33,425 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:33,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-09 01:57:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-09 01:57:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-09 01:57:33,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-03-09 01:57:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:33,428 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-09 01:57:33,428 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-09 01:57:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-09 01:57:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:57:33,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:33,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:33,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:57:33,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:57:33,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1908425802, now seen corresponding path program 1 times [2025-03-09 01:57:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414981047] [2025-03-09 01:57:33,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:33,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:57:33,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:57:33,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:33,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:33,482 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-09 01:57:33,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:33,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414981047] [2025-03-09 01:57:33,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414981047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:33,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:33,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:33,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141735175] [2025-03-09 01:57:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:33,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:33,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:33,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:33,483 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-09 01:57:33,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:33,498 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-03-09 01:57:33,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:33,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-09 01:57:33,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:33,499 INFO L225 Difference]: With dead ends: 16 [2025-03-09 01:57:33,499 INFO L226 Difference]: Without dead ends: 15 [2025-03-09 01:57:33,500 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-09 01:57:33,500 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:33,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-09 01:57:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-09 01:57:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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-09 01:57:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-09 01:57:33,502 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-03-09 01:57:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:33,503 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-09 01:57:33,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-09 01:57:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-09 01:57:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:57:33,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:33,503 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:33,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:57:33,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:57:33,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1410652494, now seen corresponding path program 1 times [2025-03-09 01:57:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972559844] [2025-03-09 01:57:33,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:33,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:57:33,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:57:33,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:33,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:33,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:33,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972559844] [2025-03-09 01:57:33,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972559844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:33,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273305146] [2025-03-09 01:57:33,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:33,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:33,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:33,585 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-09 01:57:33,586 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-09 01:57:33,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:57:33,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:57:33,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:33,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:33,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:57:33,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:33,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:33,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273305146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:33,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:33,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 01:57:33,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087946236] [2025-03-09 01:57:33,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:33,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:57:33,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:33,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:57:33,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:57:33,778 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 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-09 01:57:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:33,839 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-09 01:57:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:57:33,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 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) Word has length 12 [2025-03-09 01:57:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:33,840 INFO L225 Difference]: With dead ends: 18 [2025-03-09 01:57:33,840 INFO L226 Difference]: Without dead ends: 17 [2025-03-09 01:57:33,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:57:33,841 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:33,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-09 01:57:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2025-03-09 01:57:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-09 01:57:33,843 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2025-03-09 01:57:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:33,844 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-09 01:57:33,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 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-09 01:57:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-09 01:57:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:57:33,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:33,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:57:33,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:34,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:34,045 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:57:34,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:34,046 INFO L85 PathProgramCache]: Analyzing trace with hash -780554370, now seen corresponding path program 1 times [2025-03-09 01:57:34,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:34,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035272366] [2025-03-09 01:57:34,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:34,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:34,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:57:34,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:57:34,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:34,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:34,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:34,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035272366] [2025-03-09 01:57:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035272366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:34,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616375466] [2025-03-09 01:57:34,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:34,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:34,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:34,095 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-09 01:57:34,096 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-09 01:57:34,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:57:34,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:57:34,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:34,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:34,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:57:34,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:34,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:34,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616375466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:34,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:34,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-09 01:57:34,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876327640] [2025-03-09 01:57:34,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:34,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:57:34,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:34,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:57:34,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:34,214 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 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-09 01:57:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:34,268 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-09 01:57:34,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:57:34,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 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) Word has length 13 [2025-03-09 01:57:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:34,269 INFO L225 Difference]: With dead ends: 30 [2025-03-09 01:57:34,269 INFO L226 Difference]: Without dead ends: 29 [2025-03-09 01:57:34,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:57:34,270 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:34,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-09 01:57:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-09 01:57:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2025-03-09 01:57:34,276 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2025-03-09 01:57:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:34,276 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2025-03-09 01:57:34,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 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-09 01:57:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2025-03-09 01:57:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 01:57:34,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:34,276 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-03-09 01:57:34,282 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-09 01:57:34,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 01:57:34,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:57:34,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash -732842570, now seen corresponding path program 2 times [2025-03-09 01:57:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:34,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082730052] [2025-03-09 01:57:34,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:34,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 01:57:34,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 28 statements. [2025-03-09 01:57:34,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:57:34,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-09 01:57:34,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082730052] [2025-03-09 01:57:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082730052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625164083] [2025-03-09 01:57:34,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:34,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:34,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:34,518 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-09 01:57:34,519 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-09 01:57:34,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 01:57:34,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 28 statements. [2025-03-09 01:57:34,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:57:34,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:34,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:57:34,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-09 01:57:34,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:57:34,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625164083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:34,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:57:34,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 01:57:34,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382771709] [2025-03-09 01:57:34,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:34,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:34,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:34,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:34,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:57:34,607 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-09 01:57:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:34,619 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-03-09 01:57:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:34,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 28 [2025-03-09 01:57:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:34,620 INFO L225 Difference]: With dead ends: 29 [2025-03-09 01:57:34,620 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:57:34,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-09 01:57:34,621 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:34,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:57:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:57:34,622 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-09 01:57:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:57:34,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-03-09 01:57:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:34,622 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:57:34,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-09 01:57:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:57:34,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:57:34,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 01:57:34,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 01:57:34,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 01:57:34,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 01:57:34,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 01:57:34,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 01:57:34,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:34,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:34,830 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-03-09 01:57:34,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:57:34,897 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:57:34,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:57:34 BoogieIcfgContainer [2025-03-09 01:57:34,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:57:34,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:57:34,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:57:34,911 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:57:34,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:32" (3/4) ... [2025-03-09 01:57:34,913 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:57:34,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-09 01:57:34,919 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:57:34,919 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:57:34,919 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:57:34,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:57:34,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:57:34,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:57:34,970 INFO L158 Benchmark]: Toolchain (without parser) took 2397.17ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 130.9MB in the end (delta: 23.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2025-03-09 01:57:34,971 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:34,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.51ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 144.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:57:34,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.39ms. Allocated memory is still 201.3MB. Free memory was 144.0MB in the beginning and 142.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:34,971 INFO L158 Benchmark]: Boogie Preprocessor took 25.37ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 141.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:34,971 INFO L158 Benchmark]: IcfgBuilder took 208.21ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 130.2MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:57:34,972 INFO L158 Benchmark]: TraceAbstraction took 1934.91ms. Allocated memory is still 201.3MB. Free memory was 129.5MB in the beginning and 137.2MB in the end (delta: -7.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:34,972 INFO L158 Benchmark]: Witness Printer took 59.41ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 130.9MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:57:34,973 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 140.51ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 144.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.39ms. Allocated memory is still 201.3MB. Free memory was 144.0MB in the beginning and 142.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.37ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 141.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 208.21ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 130.2MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1934.91ms. Allocated memory is still 201.3MB. Free memory was 129.5MB in the beginning and 137.2MB in the end (delta: -7.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.41ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 130.9MB in the end (delta: 6.3MB). 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 28 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 32 mSDtfsCounter, 148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=6, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 130 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 647 SizeOfPredicates, 1 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 93/127 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 29]: Location Invariant Derived location invariant: ((((0 <= k) && (i == 0)) && (k <= 10)) || (((0 <= k) && (k <= 10)) && (k <= i))) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:57:34,984 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