./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/sum_2x3-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_2x3-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b2c85aee86c4b142223e11d6ae03fc30f95f303d54efdd7315c1aab75b140c6a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:34:13,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:34:13,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:34:13,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:34:13,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:34:13,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:34:13,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:34:13,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:34:13,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:34:13,799 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:34:13,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:34:13,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:34:13,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:34:13,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:34:13,801 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:34:13,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:34:13,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:34:13,802 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:34:13,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:34:13,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:34:13,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:34:13,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:34:13,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:34:13,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:34:13,803 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:34:13,803 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:34:13,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:34:13,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:34:13,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:34:13,803 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:34:13,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:34:13,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:34:13,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:34:13,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:34:13,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:13,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:34:13,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:34:13,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:34:13,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:34:13,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:13,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:34:13,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:34:13,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:34:13,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:34:13,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:34:13,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:34:13,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:34:13,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:34:13,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:34:13,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:34:13,806 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-jdk21/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 -> b2c85aee86c4b142223e11d6ae03fc30f95f303d54efdd7315c1aab75b140c6a [2025-01-10 02:34:14,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:34:14,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:34:14,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:34:14,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:34:14,118 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:34:14,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_2x3-1.c [2025-01-10 02:34:15,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e9c0d5ba/7254641cf79c4b19a00cb5c2e1caa13e/FLAG53eb7db4b [2025-01-10 02:34:15,576 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:34:15,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_2x3-1.c [2025-01-10 02:34:15,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e9c0d5ba/7254641cf79c4b19a00cb5c2e1caa13e/FLAG53eb7db4b [2025-01-10 02:34:15,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e9c0d5ba/7254641cf79c4b19a00cb5c2e1caa13e [2025-01-10 02:34:15,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:34:15,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:34:15,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:34:15,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:34:15,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:34:15,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:15" (1/1) ... [2025-01-10 02:34:15,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552adb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:15, skipping insertion in model container [2025-01-10 02:34:15,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:15" (1/1) ... [2025-01-10 02:34:15,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:34:16,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:34:16,085 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:34:16,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:34:16,110 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:34:16,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16 WrapperNode [2025-01-10 02:34:16,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:34:16,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:34:16,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:34:16,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:34:16,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,138 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2025-01-10 02:34:16,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:34:16,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:34:16,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:34:16,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:34:16,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,163 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-01-10 02:34:16,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,166 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:34:16,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:34:16,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:34:16,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:34:16,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (1/1) ... [2025-01-10 02:34:16,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:16,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:16,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:34:16,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:34:16,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:34:16,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:34:16,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:34:16,236 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-01-10 02:34:16,237 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-01-10 02:34:16,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:34:16,289 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:34:16,291 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:34:16,415 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-10 02:34:16,415 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:34:16,425 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:34:16,425 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:34:16,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:16 BoogieIcfgContainer [2025-01-10 02:34:16,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:34:16,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:34:16,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:34:16,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:34:16,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:34:15" (1/3) ... [2025-01-10 02:34:16,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6c14b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:16, skipping insertion in model container [2025-01-10 02:34:16,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:16" (2/3) ... [2025-01-10 02:34:16,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6c14b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:16, skipping insertion in model container [2025-01-10 02:34:16,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:16" (3/3) ... [2025-01-10 02:34:16,436 INFO L128 eAbstractionObserver]: Analyzing ICFG sum_2x3-1.c [2025-01-10 02:34:16,452 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:34:16,453 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum_2x3-1.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 02:34:16,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:34:16,512 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;@341b5a13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:34:16,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 02:34:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.5) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:34:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:34:16,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:16,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:34:16,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:34:16,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:16,528 INFO L85 PathProgramCache]: Analyzing trace with hash 890593104, now seen corresponding path program 1 times [2025-01-10 02:34:16,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:16,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047733136] [2025-01-10 02:34:16,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:16,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:34:16,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:34:16,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:16,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:16,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:16,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047733136] [2025-01-10 02:34:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047733136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:16,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:16,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93069891] [2025-01-10 02:34:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:16,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:34:16,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:16,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:34:16,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:34:16,767 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.5) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:16,895 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-01-10 02:34:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:34:16,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 02:34:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:16,903 INFO L225 Difference]: With dead ends: 62 [2025-01-10 02:34:16,903 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 02:34:16,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:16,909 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:16,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 75 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 02:34:16,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-01-10 02:34:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:34:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-01-10 02:34:16,947 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 6 [2025-01-10 02:34:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:16,948 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-01-10 02:34:16,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-01-10 02:34:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:34:16,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:16,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:16,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:34:16,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:34:16,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:16,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1161636818, now seen corresponding path program 1 times [2025-01-10 02:34:16,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:16,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981864825] [2025-01-10 02:34:16,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:16,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:16,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:34:16,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:34:16,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:16,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:17,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:17,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981864825] [2025-01-10 02:34:17,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981864825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:17,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:17,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:34:17,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177419125] [2025-01-10 02:34:17,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:17,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:34:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:17,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:34:17,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:34:17,038 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:17,117 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2025-01-10 02:34:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:34:17,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 02:34:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:17,118 INFO L225 Difference]: With dead ends: 38 [2025-01-10 02:34:17,120 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 02:34:17,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:17,121 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:17,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 72 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 02:34:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-10 02:34:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:34:17,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-01-10 02:34:17,133 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 8 [2025-01-10 02:34:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:17,133 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-01-10 02:34:17,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-01-10 02:34:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 02:34:17,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:17,135 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:17,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:34:17,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:34:17,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1131512701, now seen corresponding path program 1 times [2025-01-10 02:34:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:17,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209809468] [2025-01-10 02:34:17,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:17,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 02:34:17,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 02:34:17,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:17,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:17,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209809468] [2025-01-10 02:34:17,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209809468] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:17,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036323250] [2025-01-10 02:34:17,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:17,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:17,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:17,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:34:17,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 02:34:17,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 02:34:17,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 02:34:17,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:17,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:17,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:34:17,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:17,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:34:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:17,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036323250] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:34:17,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:34:17,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-01-10 02:34:17,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318913140] [2025-01-10 02:34:17,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:34:17,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:34:17,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:17,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:34:17,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:34:17,489 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:17,599 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2025-01-10 02:34:17,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:34:17,600 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 02:34:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:17,602 INFO L225 Difference]: With dead ends: 65 [2025-01-10 02:34:17,603 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 02:34:17,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:34:17,604 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:17,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 92 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 02:34:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2025-01-10 02:34:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 37 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:34:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-01-10 02:34:17,614 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 13 [2025-01-10 02:34:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:17,615 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-01-10 02:34:17,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-01-10 02:34:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:34:17,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:17,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:17,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:34:17,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:17,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:34:17,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:17,823 INFO L85 PathProgramCache]: Analyzing trace with hash 717160386, now seen corresponding path program 1 times [2025-01-10 02:34:17,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:17,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567096726] [2025-01-10 02:34:17,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:17,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:17,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:34:17,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:34:17,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:17,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:17,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567096726] [2025-01-10 02:34:17,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567096726] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624128371] [2025-01-10 02:34:17,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:17,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:17,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:17,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:34:17,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:34:17,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:34:17,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:34:17,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:17,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:17,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:34:17,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:18,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:18,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624128371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:18,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:18,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-01-10 02:34:18,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274020773] [2025-01-10 02:34:18,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:18,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:18,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:18,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:34:18,015 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:18,103 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-01-10 02:34:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:34:18,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 02:34:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:18,104 INFO L225 Difference]: With dead ends: 47 [2025-01-10 02:34:18,104 INFO L226 Difference]: Without dead ends: 46 [2025-01-10 02:34:18,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:34:18,105 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:18,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 47 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-10 02:34:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-01-10 02:34:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 36 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:34:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-01-10 02:34:18,118 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 14 [2025-01-10 02:34:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:18,118 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-01-10 02:34:18,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-01-10 02:34:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:34:18,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:18,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:18,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:34:18,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:18,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:34:18,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:18,321 INFO L85 PathProgramCache]: Analyzing trace with hash 757135551, now seen corresponding path program 1 times [2025-01-10 02:34:18,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:18,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58569275] [2025-01-10 02:34:18,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:18,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:34:18,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:34:18,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:18,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:18,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58569275] [2025-01-10 02:34:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58569275] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408263418] [2025-01-10 02:34:18,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:18,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:18,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:18,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:34:18,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:34:18,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:34:18,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:34:18,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:18,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:18,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:34:18,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:18,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408263418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:18,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:18,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-01-10 02:34:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210165194] [2025-01-10 02:34:18,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:18,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:18,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:18,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:34:18,514 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:18,586 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-01-10 02:34:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:34:18,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 02:34:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:18,588 INFO L225 Difference]: With dead ends: 46 [2025-01-10 02:34:18,590 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 02:34:18,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:34:18,591 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:18,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 46 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 02:34:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-01-10 02:34:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:34:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-01-10 02:34:18,597 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 15 [2025-01-10 02:34:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:18,597 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-01-10 02:34:18,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-01-10 02:34:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 02:34:18,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:18,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:18,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:34:18,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:18,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:34:18,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:18,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1996365668, now seen corresponding path program 1 times [2025-01-10 02:34:18,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:18,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271838670] [2025-01-10 02:34:18,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:18,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:18,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:34:18,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:34:18,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:18,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271838670] [2025-01-10 02:34:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271838670] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103524120] [2025-01-10 02:34:18,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:18,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:18,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:18,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:34:18,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 02:34:18,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:34:18,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:34:18,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:18,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:18,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:34:18,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:18,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:34:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103524120] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:34:19,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:34:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 02:34:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640179158] [2025-01-10 02:34:19,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:34:19,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 02:34:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:19,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 02:34:19,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:34:19,018 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 15 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:19,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:19,204 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-01-10 02:34:19,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:34:19,206 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-10 02:34:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:19,207 INFO L225 Difference]: With dead ends: 78 [2025-01-10 02:34:19,207 INFO L226 Difference]: Without dead ends: 77 [2025-01-10 02:34:19,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:34:19,208 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 80 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:19,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 143 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-10 02:34:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2025-01-10 02:34:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 55 states have internal predecessors, (62), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:34:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2025-01-10 02:34:19,225 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 16 [2025-01-10 02:34:19,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:19,225 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2025-01-10 02:34:19,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2025-01-10 02:34:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 02:34:19,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:19,226 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:34:19,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:34:19,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-10 02:34:19,426 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:34:19,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:19,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2105949520, now seen corresponding path program 2 times [2025-01-10 02:34:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:19,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447192549] [2025-01-10 02:34:19,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:19,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:19,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 02:34:19,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:34:19,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:19,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:19,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:19,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447192549] [2025-01-10 02:34:19,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447192549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:19,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717856712] [2025-01-10 02:34:19,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:19,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:19,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:19,572 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:34:19,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 02:34:19,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 02:34:19,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:34:19,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:19,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:19,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:34:19,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:19,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:19,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717856712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:19,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:19,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 14 [2025-01-10 02:34:19,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925888339] [2025-01-10 02:34:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:19,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:34:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:19,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:34:19,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:34:19,747 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:19,896 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2025-01-10 02:34:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:34:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 02:34:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:19,898 INFO L225 Difference]: With dead ends: 73 [2025-01-10 02:34:19,898 INFO L226 Difference]: Without dead ends: 72 [2025-01-10 02:34:19,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-01-10 02:34:19,899 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 51 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:19,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 63 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-10 02:34:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2025-01-10 02:34:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 54 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:34:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2025-01-10 02:34:19,913 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 20 [2025-01-10 02:34:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:19,913 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2025-01-10 02:34:19,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2025-01-10 02:34:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 02:34:19,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:19,915 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:19,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:34:20,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:20,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:34:20,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash -859925622, now seen corresponding path program 1 times [2025-01-10 02:34:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:20,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919036258] [2025-01-10 02:34:20,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:20,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:20,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 02:34:20,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 02:34:20,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:20,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:20,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:20,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919036258] [2025-01-10 02:34:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919036258] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:20,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64701823] [2025-01-10 02:34:20,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:20,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:20,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:20,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:34:20,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 02:34:20,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 02:34:20,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 02:34:20,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:20,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:20,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:34:20,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:20,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:34:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64701823] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:34:20,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:34:20,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-01-10 02:34:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270342929] [2025-01-10 02:34:20,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:34:20,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 02:34:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:20,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 02:34:20,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:34:20,472 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 22 states, 18 states have (on average 2.5) internal successors, (45), 15 states have internal predecessors, (45), 8 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:20,764 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2025-01-10 02:34:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 02:34:20,765 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.5) internal successors, (45), 15 states have internal predecessors, (45), 8 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-10 02:34:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:20,765 INFO L225 Difference]: With dead ends: 87 [2025-01-10 02:34:20,765 INFO L226 Difference]: Without dead ends: 85 [2025-01-10 02:34:20,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 02:34:20,767 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 122 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:20,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 164 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-10 02:34:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2025-01-10 02:34:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.098360655737705) internal successors, (67), 63 states have internal predecessors, (67), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:34:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2025-01-10 02:34:20,775 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 21 [2025-01-10 02:34:20,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:20,776 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2025-01-10 02:34:20,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.5) internal successors, (45), 15 states have internal predecessors, (45), 8 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2025-01-10 02:34:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 02:34:20,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:20,776 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:20,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 02:34:20,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 02:34:20,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:34:20,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1377740818, now seen corresponding path program 1 times [2025-01-10 02:34:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:20,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156319507] [2025-01-10 02:34:20,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:20,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:20,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:34:20,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:34:20,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:20,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:34:21,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156319507] [2025-01-10 02:34:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156319507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:21,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:21,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:34:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927230102] [2025-01-10 02:34:21,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:21,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:34:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:21,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:34:21,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:34:21,026 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:34:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:21,034 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2025-01-10 02:34:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:34:21,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-01-10 02:34:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:21,035 INFO L225 Difference]: With dead ends: 77 [2025-01-10 02:34:21,036 INFO L226 Difference]: Without dead ends: 46 [2025-01-10 02:34:21,036 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-01-10 02:34:21,037 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:21,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-10 02:34:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-01-10 02:34:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2025-01-10 02:34:21,045 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 31 [2025-01-10 02:34:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:21,046 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2025-01-10 02:34:21,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:34:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2025-01-10 02:34:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 02:34:21,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:21,047 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1] [2025-01-10 02:34:21,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:34:21,047 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:34:21,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:21,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1066274340, now seen corresponding path program 2 times [2025-01-10 02:34:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:21,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490118827] [2025-01-10 02:34:21,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:21,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 02:34:21,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:34:21,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:21,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 02:34:21,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490118827] [2025-01-10 02:34:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490118827] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081461595] [2025-01-10 02:34:21,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:21,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:21,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:21,180 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:34:21,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:34:21,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 02:34:21,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:34:21,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:21,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:21,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:34:21,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 02:34:21,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081461595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:21,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:21,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2025-01-10 02:34:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14489968] [2025-01-10 02:34:21,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:21,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:34:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:21,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:34:21,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:34:21,286 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:21,337 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2025-01-10 02:34:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:34:21,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-10 02:34:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:21,338 INFO L225 Difference]: With dead ends: 45 [2025-01-10 02:34:21,338 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:34:21,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:34:21,340 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:21,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:34:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:34:21,341 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-01-10 02:34:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:34:21,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2025-01-10 02:34:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:21,342 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:34:21,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:34:21,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:34:21,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 02:34:21,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 02:34:21,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 02:34:21,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 02:34:21,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 02:34:21,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 02:34:21,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 02:34:21,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 02:34:21,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:34:21,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:21,549 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:21,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:34:21,866 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:34:21,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:34:21 BoogieIcfgContainer [2025-01-10 02:34:21,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:34:21,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:34:21,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:34:21,872 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:34:21,873 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:16" (3/4) ... [2025-01-10 02:34:21,875 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:34:21,879 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2025-01-10 02:34:21,883 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 02:34:21,884 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 02:34:21,884 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:34:21,884 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:34:21,950 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:34:21,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:34:21,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:34:21,952 INFO L158 Benchmark]: Toolchain (without parser) took 6031.42ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 76.0MB in the end (delta: 37.4MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2025-01-10 02:34:21,953 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:34:21,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.78ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 103.1MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:34:21,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.54ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 102.1MB in the end (delta: 972.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:34:21,953 INFO L158 Benchmark]: Boogie Preprocessor took 34.29ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.1MB in the end (delta: 986.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:34:21,953 INFO L158 Benchmark]: RCFGBuilder took 251.88ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 90.3MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:34:21,954 INFO L158 Benchmark]: TraceAbstraction took 5443.90ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 81.0MB in the end (delta: 8.9MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2025-01-10 02:34:21,955 INFO L158 Benchmark]: Witness Printer took 79.15ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 76.0MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:34:21,956 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.78ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 103.1MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.54ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 102.1MB in the end (delta: 972.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.29ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.1MB in the end (delta: 986.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 251.88ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 90.3MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5443.90ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 81.0MB in the end (delta: 8.9MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * Witness Printer took 79.15ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 76.0MB in the end (delta: 5.0MB). There was no memory consumed. 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: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: 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 2 procedures, 32 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 773 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 606 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 818 IncrementalHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 167 mSDtfsCounter, 818 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 36 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 959 SizeOfPredicates, 19 NumberOfNonLiveVariables, 464 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 229/315 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 02:34:21,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE