./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/sum_10x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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_10x0-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 68d0cd7d514b491e1404560081afc21267eb1b3dae98cdb9832a8634357d65e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:33:11,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:33:11,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:33:11,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:33:11,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:33:11,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:33:11,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:33:11,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:33:11,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:33:11,896 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:33:11,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:33:11,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:33:11,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:33:11,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:33:11,898 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:33:11,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:33:11,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:33:11,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:33:11,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:33:11,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:33:11,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:33:11,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:33:11,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:33:11,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:33:11,899 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:33:11,900 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:33:11,900 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:33:11,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:33:11,900 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:33:11,900 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:33:11,900 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:33:11,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:33:11,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:33:11,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:33:11,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:33:11,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:33:11,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:33:11,902 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:33:11,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:33:11,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:33:11,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:33:11,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:33:11,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:33:11,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:33:11,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:33:11,903 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 -> 68d0cd7d514b491e1404560081afc21267eb1b3dae98cdb9832a8634357d65e4 [2025-02-06 14:33:12,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:33:12,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:33:12,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:33:12,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:33:12,205 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:33:12,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2025-02-06 14:33:13,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5823901de/fbdace47315746479f8c379e7dfc98cf/FLAGaa795a5ac [2025-02-06 14:33:13,771 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:33:13,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2025-02-06 14:33:13,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5823901de/fbdace47315746479f8c379e7dfc98cf/FLAGaa795a5ac [2025-02-06 14:33:13,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5823901de/fbdace47315746479f8c379e7dfc98cf [2025-02-06 14:33:13,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:33:13,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:33:13,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:33:13,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:33:13,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:33:13,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:33:13" (1/1) ... [2025-02-06 14:33:13,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39712991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:13, skipping insertion in model container [2025-02-06 14:33:13,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:33:13" (1/1) ... [2025-02-06 14:33:13,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:33:13,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:33:14,001 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:33:14,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:33:14,029 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:33:14,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14 WrapperNode [2025-02-06 14:33:14,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:33:14,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:33:14,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:33:14,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:33:14,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,056 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2025-02-06 14:33:14,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:33:14,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:33:14,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:33:14,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:33:14,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,080 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-02-06 14:33:14,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:33:14,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:33:14,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:33:14,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:33:14,093 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (1/1) ... [2025-02-06 14:33:14,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:33:14,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:33:14,128 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-02-06 14:33:14,131 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-02-06 14:33:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:33:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:33:14,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:33:14,156 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-02-06 14:33:14,156 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-02-06 14:33:14,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:33:14,209 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:33:14,211 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:33:14,323 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc #t~ret4; [2025-02-06 14:33:14,337 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-06 14:33:14,341 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:33:14,350 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:33:14,350 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:33:14,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:33:14 BoogieIcfgContainer [2025-02-06 14:33:14,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:33:14,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:33:14,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:33:14,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:33:14,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:33:13" (1/3) ... [2025-02-06 14:33:14,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cb0d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:33:14, skipping insertion in model container [2025-02-06 14:33:14,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:33:14" (2/3) ... [2025-02-06 14:33:14,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cb0d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:33:14, skipping insertion in model container [2025-02-06 14:33:14,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:33:14" (3/3) ... [2025-02-06 14:33:14,360 INFO L128 eAbstractionObserver]: Analyzing ICFG sum_10x0-1.c [2025-02-06 14:33:14,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:33:14,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum_10x0-1.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-06 14:33:14,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:33:14,440 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;@1d549510, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:33:14,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 14:33:14,444 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-02-06 14:33:14,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:33:14,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:14,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:33:14,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:14,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1242226034, now seen corresponding path program 1 times [2025-02-06 14:33:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:14,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628773476] [2025-02-06 14:33:14,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:14,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:33:14,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:33:14,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:14,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:14,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:14,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628773476] [2025-02-06 14:33:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628773476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:33:14,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:33:14,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:33:14,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99611334] [2025-02-06 14:33:14,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:33:14,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:33:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:14,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:33:14,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:33:14,662 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-02-06 14:33:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:14,788 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-02-06 14:33:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:33:14,792 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-02-06 14:33:14,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:14,797 INFO L225 Difference]: With dead ends: 62 [2025-02-06 14:33:14,797 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 14:33:14,800 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-02-06 14:33:14,802 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:14,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:33:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 14:33:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-02-06 14:33:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 30 states have internal predecessors, (34), 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-02-06 14:33:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-02-06 14:33:14,837 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 6 [2025-02-06 14:33:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:14,837 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-02-06 14:33:14,838 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-02-06 14:33:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-02-06 14:33:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 14:33:14,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:14,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:33:14,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:33:14,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:14,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash -145697313, now seen corresponding path program 1 times [2025-02-06 14:33:14,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:14,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642554043] [2025-02-06 14:33:14,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:14,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 14:33:14,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 14:33:14,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:14,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:14,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:14,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642554043] [2025-02-06 14:33:14,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642554043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:33:14,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:33:14,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:33:14,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169010752] [2025-02-06 14:33:14,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:33:14,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:33:14,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:14,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:33:14,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:33:14,919 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-02-06 14:33:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:14,991 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-02-06 14:33:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:33:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2025-02-06 14:33:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:14,993 INFO L225 Difference]: With dead ends: 38 [2025-02-06 14:33:14,994 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 14:33:14,995 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-02-06 14:33:14,995 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:14,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 29 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:33:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 14:33:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-02-06 14:33:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.391304347826087) internal successors, (32), 29 states have internal predecessors, (32), 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-02-06 14:33:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-02-06 14:33:15,007 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 7 [2025-02-06 14:33:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:15,007 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-02-06 14:33:15,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-02-06 14:33:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-02-06 14:33:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 14:33:15,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:15,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:33:15,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:33:15,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash -221649414, now seen corresponding path program 1 times [2025-02-06 14:33:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207763751] [2025-02-06 14:33:15,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:15,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:33:15,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:33:15,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:15,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:15,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:15,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207763751] [2025-02-06 14:33:15,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207763751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:33:15,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:33:15,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:33:15,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102295809] [2025-02-06 14:33:15,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:33:15,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:33:15,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:15,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:33:15,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:33:15,090 INFO L87 Difference]: Start difference. First operand 35 states and 38 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-02-06 14:33:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:15,146 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-02-06 14:33:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:33:15,147 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-02-06 14:33:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:15,148 INFO L225 Difference]: With dead ends: 37 [2025-02-06 14:33:15,148 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 14:33:15,148 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-02-06 14:33:15,149 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:15,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:33:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 14:33:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 14:33:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 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-02-06 14:33:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-02-06 14:33:15,159 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2025-02-06 14:33:15,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:15,159 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-02-06 14:33:15,159 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-02-06 14:33:15,159 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-02-06 14:33:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 14:33:15,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:15,161 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:33:15,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:33:15,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:15,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash -759415764, now seen corresponding path program 1 times [2025-02-06 14:33:15,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:15,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407113028] [2025-02-06 14:33:15,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:15,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 14:33:15,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 14:33:15,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:15,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:15,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:15,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407113028] [2025-02-06 14:33:15,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407113028] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:33:15,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132781829] [2025-02-06 14:33:15,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:15,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:15,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:33:15,300 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-02-06 14:33:15,303 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-02-06 14:33:15,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 14:33:15,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 14:33:15,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:15,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:15,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 14:33:15,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:33:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:15,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:33:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:15,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132781829] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:33:15,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:33:15,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-06 14:33:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774438883] [2025-02-06 14:33:15,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:33:15,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 14:33:15,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:15,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 14:33:15,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:33:15,497 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 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-02-06 14:33:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:15,659 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-02-06 14:33:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:33:15,660 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 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 13 [2025-02-06 14:33:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:15,661 INFO L225 Difference]: With dead ends: 88 [2025-02-06 14:33:15,661 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 14:33:15,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 14:33:15,662 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 88 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:15,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 152 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:33:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 14:33:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2025-02-06 14:33:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 52 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-02-06 14:33:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2025-02-06 14:33:15,672 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 13 [2025-02-06 14:33:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:15,672 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2025-02-06 14:33:15,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 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-02-06 14:33:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2025-02-06 14:33:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:33:15,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:15,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:33:15,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 14:33:15,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:15,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:15,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash 345931316, now seen corresponding path program 1 times [2025-02-06 14:33:15,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:15,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212554992] [2025-02-06 14:33:15,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:15,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:15,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:33:15,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:33:15,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:15,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:15,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:15,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212554992] [2025-02-06 14:33:15,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212554992] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:33:15,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133359742] [2025-02-06 14:33:15,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:15,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:15,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:33:15,975 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-02-06 14:33:15,976 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-02-06 14:33:15,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:33:16,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:33:16,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:16,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:16,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 14:33:16,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:33:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:16,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:33:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133359742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:33:16,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:33:16,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-02-06 14:33:16,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444127747] [2025-02-06 14:33:16,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:33:16,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:33:16,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:16,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:33:16,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:33:16,060 INFO L87 Difference]: Start difference. First operand 64 states and 71 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-02-06 14:33:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:16,130 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-02-06 14:33:16,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:33:16,130 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-02-06 14:33:16,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:16,131 INFO L225 Difference]: With dead ends: 66 [2025-02-06 14:33:16,131 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 14:33:16,132 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-02-06 14:33:16,132 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:16,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 49 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:33:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 14:33:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-02-06 14:33:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 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-02-06 14:33:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-02-06 14:33:16,141 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2025-02-06 14:33:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:16,141 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-02-06 14:33:16,141 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-02-06 14:33:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-02-06 14:33:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 14:33:16,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:16,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 14:33:16,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 14:33:16,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:16,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:16,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2133936195, now seen corresponding path program 1 times [2025-02-06 14:33:16,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368751159] [2025-02-06 14:33:16,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:16,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 14:33:16,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 14:33:16,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:16,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:16,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368751159] [2025-02-06 14:33:16,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368751159] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:33:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290331928] [2025-02-06 14:33:16,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:16,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:33:16,418 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-02-06 14:33:16,419 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-02-06 14:33:16,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 14:33:16,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 14:33:16,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:16,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:16,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 14:33:16,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:33:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:16,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:33:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290331928] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:33:16,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:33:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-06 14:33:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159523986] [2025-02-06 14:33:16,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:33:16,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 14:33:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:16,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 14:33:16,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:33:16,570 INFO L87 Difference]: Start difference. First operand 63 states and 67 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-02-06 14:33:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:16,689 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2025-02-06 14:33:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:33:16,690 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-02-06 14:33:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:16,690 INFO L225 Difference]: With dead ends: 66 [2025-02-06 14:33:16,690 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 14:33:16,691 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-02-06 14:33:16,691 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:16,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 148 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:33:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 14:33:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-02-06 14:33:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 51 states have internal predecessors, (52), 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-02-06 14:33:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2025-02-06 14:33:16,699 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 16 [2025-02-06 14:33:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:16,699 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2025-02-06 14:33:16,699 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-02-06 14:33:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2025-02-06 14:33:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 14:33:16,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:16,700 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-06 14:33:16,708 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-02-06 14:33:16,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:16,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:16,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1442921742, now seen corresponding path program 2 times [2025-02-06 14:33:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:16,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462926628] [2025-02-06 14:33:16,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:33:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:16,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 14:33:16,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 14:33:16,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:33:16,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462926628] [2025-02-06 14:33:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462926628] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:33:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106483377] [2025-02-06 14:33:17,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:33:17,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:17,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:33:17,173 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-02-06 14:33:17,176 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-02-06 14:33:17,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 14:33:17,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 14:33:17,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:33:17,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:17,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 14:33:17,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:33:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:17,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:33:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:17,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106483377] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:33:17,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:33:17,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-02-06 14:33:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929743360] [2025-02-06 14:33:17,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:33:17,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 14:33:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:17,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 14:33:17,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 14:33:17,727 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 35 states, 32 states have (on average 2.625) internal successors, (84), 20 states have internal predecessors, (84), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:18,698 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2025-02-06 14:33:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 14:33:18,698 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.625) internal successors, (84), 20 states have internal predecessors, (84), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-06 14:33:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:18,700 INFO L225 Difference]: With dead ends: 153 [2025-02-06 14:33:18,700 INFO L226 Difference]: Without dead ends: 129 [2025-02-06 14:33:18,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=779, Invalid=3511, Unknown=0, NotChecked=0, Total=4290 [2025-02-06 14:33:18,706 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 553 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:18,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 289 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:33:18,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-06 14:33:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2025-02-06 14:33:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.0947368421052632) internal successors, (104), 97 states have internal predecessors, (104), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 14:33:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2025-02-06 14:33:18,719 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 34 [2025-02-06 14:33:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:18,719 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2025-02-06 14:33:18,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.625) internal successors, (84), 20 states have internal predecessors, (84), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2025-02-06 14:33:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 14:33:18,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:18,721 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2025-02-06 14:33:18,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 14:33:18,922 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,SelfDestructingSolverStorable6 [2025-02-06 14:33:18,922 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:18,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2047671363, now seen corresponding path program 2 times [2025-02-06 14:33:18,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:18,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075721289] [2025-02-06 14:33:18,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:33:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:18,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 14:33:18,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 14:33:18,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:33:18,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:19,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075721289] [2025-02-06 14:33:19,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075721289] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:33:19,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066488410] [2025-02-06 14:33:19,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:33:19,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:33:19,094 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-02-06 14:33:19,096 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-02-06 14:33:19,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 14:33:19,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 14:33:19,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:33:19,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:19,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 14:33:19,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:33:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:19,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:33:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:19,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066488410] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:33:19,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:33:19,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-02-06 14:33:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557406660] [2025-02-06 14:33:19,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:33:19,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 14:33:19,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:19,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 14:33:19,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2025-02-06 14:33:19,410 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand has 27 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 16 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:19,684 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2025-02-06 14:33:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 14:33:19,685 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 16 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-06 14:33:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:19,686 INFO L225 Difference]: With dead ends: 124 [2025-02-06 14:33:19,686 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 14:33:19,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 14:33:19,687 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 188 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:19,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 328 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:33:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 14:33:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2025-02-06 14:33:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 97 states have internal predecessors, (98), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 14:33:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2025-02-06 14:33:19,709 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 37 [2025-02-06 14:33:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:19,710 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2025-02-06 14:33:19,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 16 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:19,710 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2025-02-06 14:33:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 14:33:19,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:19,711 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 14:33:19,719 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-02-06 14:33:19,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:19,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:19,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2108646142, now seen corresponding path program 1 times [2025-02-06 14:33:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:19,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485607626] [2025-02-06 14:33:19,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:19,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 14:33:19,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 14:33:19,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:19,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:20,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:20,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485607626] [2025-02-06 14:33:20,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485607626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:33:20,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950766649] [2025-02-06 14:33:20,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:20,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:20,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:33:20,385 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-02-06 14:33:20,386 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-02-06 14:33:20,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 14:33:20,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 14:33:20,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:20,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:20,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 14:33:20,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:33:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:20,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:33:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950766649] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:33:21,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:33:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 53 [2025-02-06 14:33:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011334900] [2025-02-06 14:33:21,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:33:21,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-06 14:33:21,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:21,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-06 14:33:21,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=2233, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 14:33:21,278 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 54 states, 50 states have (on average 2.82) internal successors, (141), 31 states have internal predecessors, (141), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:22,376 INFO L93 Difference]: Finished difference Result 278 states and 312 transitions. [2025-02-06 14:33:22,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-02-06 14:33:22,377 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 2.82) internal successors, (141), 31 states have internal predecessors, (141), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-06 14:33:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:22,379 INFO L225 Difference]: With dead ends: 278 [2025-02-06 14:33:22,379 INFO L226 Difference]: Without dead ends: 276 [2025-02-06 14:33:22,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1882 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1788, Invalid=6044, Unknown=0, NotChecked=0, Total=7832 [2025-02-06 14:33:22,381 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 596 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:22,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 446 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:33:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-06 14:33:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 252. [2025-02-06 14:33:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 205 states have (on average 1.0634146341463415) internal successors, (218), 206 states have internal predecessors, (218), 23 states have call successors, (23), 22 states have call predecessors, (23), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 14:33:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2025-02-06 14:33:22,414 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 77 [2025-02-06 14:33:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:22,415 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2025-02-06 14:33:22,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 2.82) internal successors, (141), 31 states have internal predecessors, (141), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2025-02-06 14:33:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 14:33:22,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:22,420 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:33:22,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 14:33:22,624 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,SelfDestructingSolverStorable8 [2025-02-06 14:33:22,624 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:22,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1910483159, now seen corresponding path program 1 times [2025-02-06 14:33:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812860082] [2025-02-06 14:33:22,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:33:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:22,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 14:33:22,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 14:33:22,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:33:22,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-06 14:33:22,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:22,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812860082] [2025-02-06 14:33:22,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812860082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:33:22,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:33:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:33:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220975224] [2025-02-06 14:33:22,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:33:22,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:33:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:22,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:33:22,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:33:22,715 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-02-06 14:33:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:22,726 INFO L93 Difference]: Finished difference Result 252 states and 264 transitions. [2025-02-06 14:33:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:33:22,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 112 [2025-02-06 14:33:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:22,727 INFO L225 Difference]: With dead ends: 252 [2025-02-06 14:33:22,727 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 14:33:22,728 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-02-06 14:33:22,728 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:22,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:33:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 14:33:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2025-02-06 14:33:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 134 states have (on average 1.007462686567164) internal successors, (135), 134 states have internal predecessors, (135), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2025-02-06 14:33:22,737 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 112 [2025-02-06 14:33:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:22,738 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2025-02-06 14:33:22,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-02-06 14:33:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2025-02-06 14:33:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 14:33:22,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:33:22,740 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 1, 1, 1, 1] [2025-02-06 14:33:22,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:33:22,740 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:33:22,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:33:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1505238077, now seen corresponding path program 3 times [2025-02-06 14:33:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:33:22,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430952847] [2025-02-06 14:33:22,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:33:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:33:22,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 156 statements into 22 equivalence classes. [2025-02-06 14:33:22,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 14:33:22,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2025-02-06 14:33:22,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:33:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 1596 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:33:24,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:33:24,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430952847] [2025-02-06 14:33:24,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430952847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:33:24,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:33:24,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2025-02-06 14:33:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363471639] [2025-02-06 14:33:24,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:33:24,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-06 14:33:24,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:33:24,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-06 14:33:24,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 14:33:24,113 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand has 47 states, 46 states have (on average 2.9130434782608696) internal successors, (134), 25 states have internal predecessors, (134), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:24,410 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2025-02-06 14:33:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 14:33:24,410 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.9130434782608696) internal successors, (134), 25 states have internal predecessors, (134), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2025-02-06 14:33:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:24,410 INFO L225 Difference]: With dead ends: 157 [2025-02-06 14:33:24,410 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:33:24,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=762, Invalid=2544, Unknown=0, NotChecked=0, Total=3306 [2025-02-06 14:33:24,413 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:24,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 223 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:33:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:33:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:33:24,414 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-02-06 14:33:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:33:24,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2025-02-06 14:33:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:24,414 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:33:24,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.9130434782608696) internal successors, (134), 25 states have internal predecessors, (134), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:33:24,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:33:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 14:33:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 14:33:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 14:33:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 14:33:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 14:33:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 14:33:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 14:33:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 14:33:24,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:33:24,422 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 14:33:24,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:33:26,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:33:26,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:33:26 BoogieIcfgContainer [2025-02-06 14:33:26,182 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:33:26,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:33:26,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:33:26,183 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:33:26,184 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:33:14" (3/4) ... [2025-02-06 14:33:26,185 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:33:26,190 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sum [2025-02-06 14:33:26,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 14:33:26,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 14:33:26,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:33:26,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:33:26,266 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:33:26,267 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:33:26,267 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:33:26,268 INFO L158 Benchmark]: Toolchain (without parser) took 12426.28ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 113.9MB in the beginning and 196.8MB in the end (delta: -82.9MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2025-02-06 14:33:26,269 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:33:26,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.29ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 103.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:33:26,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.53ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 102.3MB in the end (delta: 988.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:33:26,270 INFO L158 Benchmark]: Boogie Preprocessor took 31.16ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:33:26,270 INFO L158 Benchmark]: IcfgBuilder took 261.56ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 90.5MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 14:33:26,270 INFO L158 Benchmark]: TraceAbstraction took 11828.43ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 90.0MB in the beginning and 203.2MB in the end (delta: -113.2MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2025-02-06 14:33:26,270 INFO L158 Benchmark]: Witness Printer took 84.25ms. Allocated memory is still 276.8MB. Free memory was 203.2MB in the beginning and 196.8MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:33:26,272 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.34ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.29ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 103.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.53ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 102.3MB in the end (delta: 988.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.16ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 261.56ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 90.5MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11828.43ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 90.0MB in the beginning and 203.2MB in the end (delta: -113.2MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. * Witness Printer took 84.25ms. Allocated memory is still 276.8MB. Free memory was 203.2MB in the beginning and 196.8MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 10.0s, OverallIterations: 11, TraceHistogramMax: 22, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1661 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1650 mSDsluCounter, 1840 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1577 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2081 IncrementalHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 263 mSDtfsCounter, 2081 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 589 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3896 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=9, InterpolantAutomatonStates: 191, 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, 11 MinimizatonAttempts, 52 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 828 ConstructedInterpolants, 0 QuantifiedInterpolants, 2400 SizeOfPredicates, 28 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 2102/3473 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-02-06 14:33:26,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE