./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/sum_25x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_25x0-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0189dbb29c824fc5d22409df9775c70fa543bd61c2bf554681db703f0a461966 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:30:53,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:30:53,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:30:53,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:30:53,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:30:53,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:30:53,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:30:53,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:30:53,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:30:53,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:30:53,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:30:53,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:30:53,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:30:53,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:30:53,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:30:53,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:30:53,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:30:53,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:30:53,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:30:53,411 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0189dbb29c824fc5d22409df9775c70fa543bd61c2bf554681db703f0a461966 [2025-03-04 11:30:53,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:30:53,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:30:53,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:30:53,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:30:53,640 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:30:53,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2025-03-04 11:30:54,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66686c074/c9d1bec2fc3547d0bb9304627c076b7a/FLAG8718975e7 [2025-03-04 11:30:54,972 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:30:54,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2025-03-04 11:30:54,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66686c074/c9d1bec2fc3547d0bb9304627c076b7a/FLAG8718975e7 [2025-03-04 11:30:54,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66686c074/c9d1bec2fc3547d0bb9304627c076b7a [2025-03-04 11:30:54,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:30:54,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:30:54,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:30:54,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:30:54,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:30:54,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:30:54" (1/1) ... [2025-03-04 11:30:54,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0d12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:54, skipping insertion in model container [2025-03-04 11:30:54,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:30:54" (1/1) ... [2025-03-04 11:30:55,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:30:55,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:30:55,109 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:30:55,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:30:55,127 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:30:55,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55 WrapperNode [2025-03-04 11:30:55,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:30:55,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:30:55,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:30:55,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:30:55,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,146 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2025-03-04 11:30:55,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:30:55,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:30:55,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:30:55,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:30:55,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,164 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:30:55,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:30:55,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:30:55,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:30:55,172 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:30:55,173 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (1/1) ... [2025-03-04 11:30:55,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:30:55,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:55,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:30:55,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:30:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:30:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:30:55,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:30:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-03-04 11:30:55,218 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-03-04 11:30:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:30:55,254 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:30:55,256 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:30:55,346 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc #t~ret4; [2025-03-04 11:30:55,354 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-04 11:30:55,357 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:30:55,363 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:30:55,364 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:30:55,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:30:55 BoogieIcfgContainer [2025-03-04 11:30:55,364 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:30:55,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:30:55,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:30:55,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:30:55,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:30:54" (1/3) ... [2025-03-04 11:30:55,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e56739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:30:55, skipping insertion in model container [2025-03-04 11:30:55,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:55" (2/3) ... [2025-03-04 11:30:55,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e56739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:30:55, skipping insertion in model container [2025-03-04 11:30:55,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:30:55" (3/3) ... [2025-03-04 11:30:55,374 INFO L128 eAbstractionObserver]: Analyzing ICFG sum_25x0-2.c [2025-03-04 11:30:55,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:30:55,385 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum_25x0-2.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 11:30:55,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:30:55,434 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;@9861316, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:30:55,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 11:30:55,437 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-03-04 11:30:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:30:55,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:55,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:30:55,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:30:55,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1242226034, now seen corresponding path program 1 times [2025-03-04 11:30:55,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:55,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460549632] [2025-03-04 11:30:55,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:55,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:55,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:30:55,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:30:55,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:55,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460549632] [2025-03-04 11:30:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460549632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:55,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:55,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:30:55,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210612356] [2025-03-04 11:30:55,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:55,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:30:55,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:55,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:30:55,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:30:55,616 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-03-04 11:30:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:55,699 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-03-04 11:30:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:30:55,700 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-03-04 11:30:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:55,703 INFO L225 Difference]: With dead ends: 62 [2025-03-04 11:30:55,703 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 11:30:55,705 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-03-04 11:30:55,707 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03-04 11:30:55,707 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-03-04 11:30:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 11:30:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-03-04 11:30:55,729 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-03-04 11:30:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-04 11:30:55,733 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 6 [2025-03-04 11:30:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:55,733 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-04 11:30:55,733 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-03-04 11:30:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-03-04 11:30:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:30:55,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:55,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:55,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:30:55,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:30:55,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash -145697313, now seen corresponding path program 1 times [2025-03-04 11:30:55,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:55,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621843583] [2025-03-04 11:30:55,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:55,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:55,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:30:55,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:30:55,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:55,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:55,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621843583] [2025-03-04 11:30:55,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621843583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:55,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:55,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:30:55,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654378903] [2025-03-04 11:30:55,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:55,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:30:55,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:55,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:30:55,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:30:55,782 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-03-04 11:30:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:55,840 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-04 11:30:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:30:55,841 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-03-04 11:30:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:55,842 INFO L225 Difference]: With dead ends: 38 [2025-03-04 11:30:55,842 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 11:30:55,843 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-03-04 11:30:55,843 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:55,843 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.0s Time] [2025-03-04 11:30:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 11:30:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-04 11:30:55,848 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-03-04 11:30:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-04 11:30:55,849 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 7 [2025-03-04 11:30:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:55,849 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-04 11:30:55,849 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-03-04 11:30:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-03-04 11:30:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:30:55,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:55,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:55,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:30:55,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:30:55,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash -221649414, now seen corresponding path program 1 times [2025-03-04 11:30:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:55,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026491842] [2025-03-04 11:30:55,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:55,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:30:55,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:30:55,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:55,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:55,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:55,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026491842] [2025-03-04 11:30:55,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026491842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:30:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623013069] [2025-03-04 11:30:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:55,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:30:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:55,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:30:55,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:30:55,917 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-03-04 11:30:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:55,958 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-04 11:30:55,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:30:55,959 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-03-04 11:30:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:55,959 INFO L225 Difference]: With dead ends: 37 [2025-03-04 11:30:55,960 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 11:30:55,960 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-03-04 11:30:55,961 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-03-04 11:30:55,961 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-03-04 11:30:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 11:30:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 11:30:55,967 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-03-04 11:30:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-04 11:30:55,969 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2025-03-04 11:30:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:55,969 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-04 11:30:55,969 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-03-04 11:30:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-04 11:30:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 11:30:55,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:55,970 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:55,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:30:55,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:30:55,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash -759415764, now seen corresponding path program 1 times [2025-03-04 11:30:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182016880] [2025-03-04 11:30:55,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:55,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:55,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 11:30:55,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 11:30:55,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:55,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:56,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:56,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182016880] [2025-03-04 11:30:56,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182016880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:56,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783320586] [2025-03-04 11:30:56,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:56,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:56,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:56,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:56,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:30:56,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 11:30:56,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 11:30:56,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:56,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:56,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:30:56,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:56,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783320586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:56,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 11:30:56,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014940939] [2025-03-04 11:30:56,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:56,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:30:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:56,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:30:56,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:30:56,207 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-03-04 11:30:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:56,335 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-03-04 11:30:56,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:30:56,335 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-03-04 11:30:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:56,336 INFO L225 Difference]: With dead ends: 88 [2025-03-04 11:30:56,336 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 11:30:56,336 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-03-04 11:30:56,336 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-03-04 11:30:56,337 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-03-04 11:30:56,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 11:30:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2025-03-04 11:30:56,342 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-03-04 11:30:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2025-03-04 11:30:56,342 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 13 [2025-03-04 11:30:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:56,343 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2025-03-04 11:30:56,343 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-03-04 11:30:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2025-03-04 11:30:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:30:56,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:56,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:56,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:30:56,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:56,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:30:56,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:56,544 INFO L85 PathProgramCache]: Analyzing trace with hash 345931316, now seen corresponding path program 1 times [2025-03-04 11:30:56,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:56,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144464855] [2025-03-04 11:30:56,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:56,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:30:56,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:30:56,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:56,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:56,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:56,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144464855] [2025-03-04 11:30:56,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144464855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:56,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777076905] [2025-03-04 11:30:56,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:56,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:56,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:56,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:56,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:30:56,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:30:56,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:30:56,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:56,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:56,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:30:56,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:56,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:30:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777076905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:56,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:30:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-04 11:30:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109693573] [2025-03-04 11:30:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:56,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:30:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:56,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:30:56,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:30:56,688 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-03-04 11:30:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:56,742 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-03-04 11:30:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:30:56,744 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-03-04 11:30:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:56,745 INFO L225 Difference]: With dead ends: 66 [2025-03-04 11:30:56,745 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 11:30:56,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:30:56,746 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-03-04 11:30:56,746 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-03-04 11:30:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 11:30:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-03-04 11:30:56,752 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-03-04 11:30:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-03-04 11:30:56,754 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2025-03-04 11:30:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:56,754 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-03-04 11:30:56,754 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-03-04 11:30:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-03-04 11:30:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:30:56,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:56,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:56,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:56,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:56,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:30:56,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2133936195, now seen corresponding path program 1 times [2025-03-04 11:30:56,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:56,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602136351] [2025-03-04 11:30:56,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:56,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:56,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:30:56,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:30:56,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:56,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:57,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:57,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602136351] [2025-03-04 11:30:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602136351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114519351] [2025-03-04 11:30:57,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:57,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:57,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:57,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:57,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:30:57,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:30:57,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:30:57,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:57,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:30:57,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:57,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:57,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114519351] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:57,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:57,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 11:30:57,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362310973] [2025-03-04 11:30:57,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:30:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:57,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:30:57,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:30:57,142 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-03-04 11:30:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:57,239 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2025-03-04 11:30:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:30:57,240 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-03-04 11:30:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:57,240 INFO L225 Difference]: With dead ends: 66 [2025-03-04 11:30:57,240 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 11:30:57,241 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-03-04 11:30:57,241 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03-04 11:30:57,241 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-03-04 11:30:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 11:30:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-03-04 11:30:57,246 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-03-04 11:30:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2025-03-04 11:30:57,247 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 16 [2025-03-04 11:30:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:57,247 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2025-03-04 11:30:57,247 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-03-04 11:30:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2025-03-04 11:30:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:30:57,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:57,248 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 11:30:57,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:57,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:57,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:30:57,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1442921742, now seen corresponding path program 2 times [2025-03-04 11:30:57,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:57,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14643885] [2025-03-04 11:30:57,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:57,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 11:30:57,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:30:57,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:57,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:57,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:57,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14643885] [2025-03-04 11:30:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14643885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:57,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80081397] [2025-03-04 11:30:57,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:57,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:57,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:57,620 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:57,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:30:57,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 11:30:57,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:30:57,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:57,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:57,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:30:57,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:57,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:58,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80081397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:58,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:58,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-03-04 11:30:58,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772659130] [2025-03-04 11:30:58,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:58,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 11:30:58,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:58,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 11:30:58,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 11:30:58,040 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-03-04 11:30:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:58,815 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2025-03-04 11:30:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 11:30:58,816 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-03-04 11:30:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:58,817 INFO L225 Difference]: With dead ends: 153 [2025-03-04 11:30:58,817 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 11:30:58,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=779, Invalid=3511, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 11:30:58,819 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 553 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03-04 11:30:58,819 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-03-04 11:30:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 11:30:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2025-03-04 11:30:58,828 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-03-04 11:30:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2025-03-04 11:30:58,829 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 34 [2025-03-04 11:30:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:58,829 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2025-03-04 11:30:58,829 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-03-04 11:30:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2025-03-04 11:30:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 11:30:58,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:58,830 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2025-03-04 11:30:58,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:30:59,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:59,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:30:59,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:59,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2047671363, now seen corresponding path program 2 times [2025-03-04 11:30:59,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:59,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426942106] [2025-03-04 11:30:59,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:59,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 11:30:59,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:30:59,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:59,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:59,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:59,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426942106] [2025-03-04 11:30:59,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426942106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:59,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852304579] [2025-03-04 11:30:59,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:59,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:59,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:59,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:59,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:30:59,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 11:30:59,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:30:59,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:59,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:59,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:30:59,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:59,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:59,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852304579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:59,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:59,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-04 11:30:59,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989659630] [2025-03-04 11:30:59,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:59,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 11:30:59,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:59,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 11:30:59,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:30:59,413 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-03-04 11:30:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:59,627 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2025-03-04 11:30:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:30:59,628 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-03-04 11:30:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:59,629 INFO L225 Difference]: With dead ends: 124 [2025-03-04 11:30:59,629 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 11:30:59,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 11:30:59,631 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-03-04 11:30:59,631 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-03-04 11:30:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 11:30:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2025-03-04 11:30:59,645 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-03-04 11:30:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2025-03-04 11:30:59,646 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 37 [2025-03-04 11:30:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:59,646 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2025-03-04 11:30:59,646 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-03-04 11:30:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2025-03-04 11:30:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 11:30:59,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:59,647 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:59,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:59,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:59,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:30:59,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:59,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2108646142, now seen corresponding path program 1 times [2025-03-04 11:30:59,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:59,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660442110] [2025-03-04 11:30:59,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:59,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:59,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 11:30:59,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 11:30:59,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:59,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:00,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660442110] [2025-03-04 11:31:00,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660442110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:00,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251576071] [2025-03-04 11:31:00,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:00,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:00,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:00,207 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:00,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:31:00,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 11:31:00,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 11:31:00,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:00,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:00,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:31:00,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:00,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251576071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:01,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:01,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-03-04 11:31:01,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17784407] [2025-03-04 11:31:01,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:01,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-04 11:31:01,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:01,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-04 11:31:01,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=4398, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 11:31:01,365 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 72 states, 69 states have (on average 2.8115942028985508) internal successors, (194), 39 states have internal predecessors, (194), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:02,379 INFO L93 Difference]: Finished difference Result 295 states and 319 transitions. [2025-03-04 11:31:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 11:31:02,380 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 69 states have (on average 2.8115942028985508) internal successors, (194), 39 states have internal predecessors, (194), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-04 11:31:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:02,381 INFO L225 Difference]: With dead ends: 295 [2025-03-04 11:31:02,382 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 11:31:02,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2028, Invalid=9102, Unknown=0, NotChecked=0, Total=11130 [2025-03-04 11:31:02,387 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 690 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:02,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 831 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:31:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 11:31:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 241. [2025-03-04 11:31:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 191 states have (on average 1.0732984293193717) internal successors, (205), 193 states have internal predecessors, (205), 24 states have call successors, (24), 23 states have call predecessors, (24), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 11:31:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 253 transitions. [2025-03-04 11:31:02,412 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 253 transitions. Word has length 77 [2025-03-04 11:31:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:02,412 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 253 transitions. [2025-03-04 11:31:02,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 69 states have (on average 2.8115942028985508) internal successors, (194), 39 states have internal predecessors, (194), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 253 transitions. [2025-03-04 11:31:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:31:02,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:02,414 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1] [2025-03-04 11:31:02,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:02,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:02,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:31:02,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash 930299395, now seen corresponding path program 3 times [2025-03-04 11:31:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:02,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392893488] [2025-03-04 11:31:02,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:31:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:02,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 12 equivalence classes. [2025-03-04 11:31:02,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:31:02,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 11:31:02,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:03,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:03,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392893488] [2025-03-04 11:31:03,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392893488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:03,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72153300] [2025-03-04 11:31:03,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:31:03,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:03,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:03,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:03,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:31:03,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 12 equivalence classes. [2025-03-04 11:31:03,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:31:03,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 11:31:03,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:03,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 11:31:03,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:03,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:03,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72153300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:03,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:03,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 54 [2025-03-04 11:31:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048663145] [2025-03-04 11:31:03,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:03,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 11:31:03,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:03,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 11:31:03,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=2260, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:31:03,731 INFO L87 Difference]: Start difference. First operand 241 states and 253 transitions. Second operand has 55 states, 51 states have (on average 3.019607843137255) internal successors, (154), 30 states have internal predecessors, (154), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:04,346 INFO L93 Difference]: Finished difference Result 274 states and 290 transitions. [2025-03-04 11:31:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-04 11:31:04,346 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 3.019607843137255) internal successors, (154), 30 states have internal predecessors, (154), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-04 11:31:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:04,349 INFO L225 Difference]: With dead ends: 274 [2025-03-04 11:31:04,349 INFO L226 Difference]: Without dead ends: 273 [2025-03-04 11:31:04,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1636, Invalid=4526, Unknown=0, NotChecked=0, Total=6162 [2025-03-04 11:31:04,350 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 690 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:04,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 628 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-04 11:31:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2025-03-04 11:31:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 211 states have (on average 1.033175355450237) internal successors, (218), 213 states have internal predecessors, (218), 26 states have call successors, (26), 25 states have call predecessors, (26), 25 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 11:31:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 270 transitions. [2025-03-04 11:31:04,373 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 270 transitions. Word has length 86 [2025-03-04 11:31:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:04,374 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 270 transitions. [2025-03-04 11:31:04,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 3.019607843137255) internal successors, (154), 30 states have internal predecessors, (154), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 270 transitions. [2025-03-04 11:31:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 11:31:04,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:04,378 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:04,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:04,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:04,579 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:31:04,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash -684334466, now seen corresponding path program 2 times [2025-03-04 11:31:04,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:04,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660653430] [2025-03-04 11:31:04,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:31:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:04,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 161 statements into 2 equivalence classes. [2025-03-04 11:31:04,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 11:31:04,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:31:04,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2025-03-04 11:31:04,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:04,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660653430] [2025-03-04 11:31:04,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660653430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:04,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:04,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:04,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733837748] [2025-03-04 11:31:04,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:04,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:04,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:04,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:04,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:04,658 INFO L87 Difference]: Start difference. First operand 265 states and 270 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:04,703 INFO L93 Difference]: Finished difference Result 271 states and 277 transitions. [2025-03-04 11:31:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:04,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-03-04 11:31:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:04,705 INFO L225 Difference]: With dead ends: 271 [2025-03-04 11:31:04,705 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 11:31:04,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:31:04,706 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:04,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 11:31:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2025-03-04 11:31:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.018957345971564) internal successors, (215), 212 states have internal predecessors, (215), 26 states have call successors, (26), 25 states have call predecessors, (26), 25 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 11:31:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 267 transitions. [2025-03-04 11:31:04,721 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 267 transitions. Word has length 161 [2025-03-04 11:31:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:04,721 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 267 transitions. [2025-03-04 11:31:04,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 267 transitions. [2025-03-04 11:31:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 11:31:04,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:04,723 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 1, 1, 1, 1] [2025-03-04 11:31:04,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:31:04,723 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:31:04,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash 58234941, now seen corresponding path program 4 times [2025-03-04 11:31:04,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:04,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349477825] [2025-03-04 11:31:04,724 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:31:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:04,729 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 177 statements into 2 equivalence classes. [2025-03-04 11:31:04,768 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 11:31:04,769 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:31:04,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:05,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:05,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349477825] [2025-03-04 11:31:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349477825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:05,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853125999] [2025-03-04 11:31:05,907 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:31:05,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:05,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:05,909 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:05,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:31:05,932 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 177 statements into 2 equivalence classes. [2025-03-04 11:31:05,963 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 11:31:05,963 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:31:05,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:05,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 11:31:05,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:06,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:07,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853125999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:07,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:07,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 106 [2025-03-04 11:31:07,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927421714] [2025-03-04 11:31:07,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:07,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2025-03-04 11:31:07,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:07,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2025-03-04 11:31:07,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2764, Invalid=8578, Unknown=0, NotChecked=0, Total=11342 [2025-03-04 11:31:07,694 INFO L87 Difference]: Start difference. First operand 264 states and 267 transitions. Second operand has 107 states, 103 states have (on average 3.0097087378640777) internal successors, (310), 56 states have internal predecessors, (310), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:09,592 INFO L93 Difference]: Finished difference Result 635 states and 690 transitions. [2025-03-04 11:31:09,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-03-04 11:31:09,593 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 103 states have (on average 3.0097087378640777) internal successors, (310), 56 states have internal predecessors, (310), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2025-03-04 11:31:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:09,596 INFO L225 Difference]: With dead ends: 635 [2025-03-04 11:31:09,596 INFO L226 Difference]: Without dead ends: 634 [2025-03-04 11:31:09,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5442 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6641, Invalid=17851, Unknown=0, NotChecked=0, Total=24492 [2025-03-04 11:31:09,601 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1766 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:09,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1768 Valid, 942 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:31:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-04 11:31:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 576. [2025-03-04 11:31:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 471 states have (on average 1.0636942675159236) internal successors, (501), 472 states have internal predecessors, (501), 52 states have call successors, (52), 51 states have call predecessors, (52), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 11:31:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 605 transitions. [2025-03-04 11:31:09,648 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 605 transitions. Word has length 177 [2025-03-04 11:31:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:09,649 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 605 transitions. [2025-03-04 11:31:09,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 103 states have (on average 3.0097087378640777) internal successors, (310), 56 states have internal predecessors, (310), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 605 transitions. [2025-03-04 11:31:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 11:31:09,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:09,654 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:09,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:31:09,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 11:31:09,854 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:31:09,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash 428071017, now seen corresponding path program 1 times [2025-03-04 11:31:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:09,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980990452] [2025-03-04 11:31:09,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:09,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 11:31:09,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 11:31:09,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:09,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2398 trivial. 0 not checked. [2025-03-04 11:31:09,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:09,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980990452] [2025-03-04 11:31:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980990452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:09,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:09,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:31:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146840211] [2025-03-04 11:31:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:09,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:31:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:09,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:31:09,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:31:09,939 INFO L87 Difference]: Start difference. First operand 576 states and 605 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-03-04 11:31:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:09,955 INFO L93 Difference]: Finished difference Result 576 states and 605 transitions. [2025-03-04 11:31:09,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:31:09,955 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 232 [2025-03-04 11:31:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:09,958 INFO L225 Difference]: With dead ends: 576 [2025-03-04 11:31:09,958 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 11:31:09,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:31:09,961 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-03-04 11:31:09,961 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-03-04 11:31:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 11:31:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 360. [2025-03-04 11:31:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 308 states have (on average 1.0032467532467533) internal successors, (309), 308 states have internal predecessors, (309), 51 states have call successors, (51), 51 states have call predecessors, (51), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2025-03-04 11:31:09,976 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 232 [2025-03-04 11:31:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:09,976 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2025-03-04 11:31:09,977 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-03-04 11:31:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2025-03-04 11:31:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-03-04 11:31:09,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:09,980 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 51, 51, 50, 50, 1, 1, 1, 1] [2025-03-04 11:31:09,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:31:09,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:31:09,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1762982787, now seen corresponding path program 5 times [2025-03-04 11:31:09,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:09,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672248796] [2025-03-04 11:31:09,982 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:31:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:10,003 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 359 statements into 51 equivalence classes. [2025-03-04 11:31:10,098 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) and asserted 359 of 359 statements. [2025-03-04 11:31:10,098 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2025-03-04 11:31:10,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8875 backedges. 8871 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:31:13,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:13,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672248796] [2025-03-04 11:31:13,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672248796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:13,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:13,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2025-03-04 11:31:13,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293922367] [2025-03-04 11:31:13,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:13,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2025-03-04 11:31:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:13,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2025-03-04 11:31:13,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2025-03-04 11:31:13,828 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand has 103 states, 102 states have (on average 2.9901960784313726) internal successors, (305), 53 states have internal predecessors, (305), 51 states have call successors, (51), 51 states have call predecessors, (51), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:14,433 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2025-03-04 11:31:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 11:31:14,435 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 102 states have (on average 2.9901960784313726) internal successors, (305), 53 states have internal predecessors, (305), 51 states have call successors, (51), 51 states have call predecessors, (51), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2025-03-04 11:31:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:14,436 INFO L225 Difference]: With dead ends: 360 [2025-03-04 11:31:14,436 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:31:14,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3732, Invalid=12780, Unknown=0, NotChecked=0, Total=16512 [2025-03-04 11:31:14,438 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 151 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:14,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 624 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:31:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:31:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:31:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:31:14,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 359 [2025-03-04 11:31:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:14,438 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:31:14,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 102 states have (on average 2.9901960784313726) internal successors, (305), 53 states have internal predecessors, (305), 51 states have call successors, (51), 51 states have call predecessors, (51), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:31:14,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:31:14,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 11:31:14,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 11:31:14,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 11:31:14,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 11:31:14,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 11:31:14,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 11:31:14,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 11:31:14,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 11:31:14,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:31:14,444 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:31:14,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:31:20,417 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:31:20,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:31:20 BoogieIcfgContainer [2025-03-04 11:31:20,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:31:20,421 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:31:20,421 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:31:20,421 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:31:20,422 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:30:55" (3/4) ... [2025-03-04 11:31:20,423 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:31:20,427 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sum [2025-03-04 11:31:20,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:31:20,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 11:31:20,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:31:20,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:31:20,482 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:31:20,483 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:31:20,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:31:20,483 INFO L158 Benchmark]: Toolchain (without parser) took 25495.31ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 112.4MB in the beginning and 766.7MB in the end (delta: -654.2MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2025-03-04 11:31:20,483 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:31:20,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.16ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 101.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:31:20,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.01ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 101.0MB in the end (delta: 903.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:31:20,485 INFO L158 Benchmark]: Boogie Preprocessor took 22.62ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 100.1MB in the end (delta: 946.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:31:20,485 INFO L158 Benchmark]: IcfgBuilder took 192.79ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 88.9MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:31:20,485 INFO L158 Benchmark]: TraceAbstraction took 25055.38ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 88.5MB in the beginning and 770.9MB in the end (delta: -682.4MB). Peak memory consumption was 482.8MB. Max. memory is 16.1GB. [2025-03-04 11:31:20,486 INFO L158 Benchmark]: Witness Printer took 61.28ms. Allocated memory is still 855.6MB. Free memory was 770.9MB in the beginning and 766.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:31:20,488 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.18ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.16ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 101.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.01ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 101.0MB in the end (delta: 903.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.62ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 100.1MB in the end (delta: 946.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 192.79ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 88.9MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25055.38ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 88.5MB in the beginning and 770.9MB in the end (delta: -682.4MB). Peak memory consumption was 482.8MB. Max. memory is 16.1GB. * Witness Printer took 61.28ms. Allocated memory is still 855.6MB. Free memory was 770.9MB in the beginning and 766.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 14, TraceHistogramMax: 51, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4328 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4312 mSDsluCounter, 4270 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3804 mSDsCounter, 458 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4759 IncrementalHoareTripleChecker+Invalid, 5217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 458 mSolverCounterUnsat, 466 mSDtfsCounter, 4759 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1342 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 623 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14762 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=576occurred in iteration=12, InterpolantAutomatonStates: 372, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 113 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1683 NumberOfCodeBlocks, 1683 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 2094 ConstructedInterpolants, 0 QuantifiedInterpolants, 5788 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1151 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 29 InterpolantComputations, 7 PerfectInterpolantSequences, 12950/21902 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-03-04 11:31:20,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE