./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/sum_15x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_15x0-1.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 b32326f1b997cecaa031e8ab338eea5ffa634c465fc73ccabccfc7d02b1e5cc1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:43:16,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:43:16,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:43:16,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:43:16,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:43:16,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:43:16,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:43:16,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:43:16,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:43:16,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:43:16,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:43:16,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:43:16,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:43:16,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:43:16,849 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:43:16,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:43:16,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:43:16,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:43:16,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:43:16,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:43:16,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:43:16,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:43:16,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:43:16,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:43:16,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:43:16,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:43:16,851 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 -> b32326f1b997cecaa031e8ab338eea5ffa634c465fc73ccabccfc7d02b1e5cc1 [2025-03-09 02:43:17,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:43:17,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:43:17,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:43:17,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:43:17,062 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:43:17,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_15x0-1.c [2025-03-09 02:43:18,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7904fa32/5bf96363785e47a0984b7b843894b8d2/FLAGf6a4cc81e [2025-03-09 02:43:18,403 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:43:18,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-1.c [2025-03-09 02:43:18,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7904fa32/5bf96363785e47a0984b7b843894b8d2/FLAGf6a4cc81e [2025-03-09 02:43:18,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7904fa32/5bf96363785e47a0984b7b843894b8d2 [2025-03-09 02:43:18,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:43:18,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:43:18,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:43:18,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:43:18,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:43:18,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d18f36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18, skipping insertion in model container [2025-03-09 02:43:18,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:43:18,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:43:18,861 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:43:18,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:43:18,879 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:43:18,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18 WrapperNode [2025-03-09 02:43:18,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:43:18,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:43:18,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:43:18,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:43:18,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,899 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2025-03-09 02:43:18,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:43:18,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:43:18,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:43:18,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:43:18,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,914 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:43:18,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:43:18,923 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:43:18,923 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:43:18,923 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:43:18,924 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (1/1) ... [2025-03-09 02:43:18,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:43:18,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:18,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:43:18,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:43:18,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:43:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:43:18,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:43:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-03-09 02:43:18,973 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-03-09 02:43:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:43:19,012 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:43:19,013 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:43:19,090 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc #t~ret4; [2025-03-09 02:43:19,095 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-09 02:43:19,095 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:43:19,101 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:43:19,102 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:43:19,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:43:19 BoogieIcfgContainer [2025-03-09 02:43:19,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:43:19,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:43:19,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:43:19,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:43:19,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:43:18" (1/3) ... [2025-03-09 02:43:19,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bedd511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:43:19, skipping insertion in model container [2025-03-09 02:43:19,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:18" (2/3) ... [2025-03-09 02:43:19,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bedd511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:43:19, skipping insertion in model container [2025-03-09 02:43:19,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:43:19" (3/3) ... [2025-03-09 02:43:19,111 INFO L128 eAbstractionObserver]: Analyzing ICFG sum_15x0-1.c [2025-03-09 02:43:19,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:43:19,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum_15x0-1.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-09 02:43:19,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:43:19,174 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;@dcccc5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:43:19,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 02:43:19,177 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-09 02:43:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:43:19,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:19,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:43:19,181 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-09 02:43:19,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1242226034, now seen corresponding path program 1 times [2025-03-09 02:43:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:19,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403144853] [2025-03-09 02:43:19,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:19,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:19,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:43:19,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:43:19,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:19,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:19,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:19,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403144853] [2025-03-09 02:43:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403144853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:19,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:43:19,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:43:19,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552485706] [2025-03-09 02:43:19,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:19,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:43:19,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:19,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:43:19,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:43:19,384 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-09 02:43:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:19,484 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-03-09 02:43:19,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:43:19,485 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-09 02:43:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:19,489 INFO L225 Difference]: With dead ends: 62 [2025-03-09 02:43:19,489 INFO L226 Difference]: Without dead ends: 39 [2025-03-09 02:43:19,491 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-09 02:43:19,492 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:19,493 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-09 02:43:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-09 02:43:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-03-09 02:43:19,513 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-09 02:43:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-09 02:43:19,517 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 6 [2025-03-09 02:43:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:19,517 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-09 02:43:19,518 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-09 02:43:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-03-09 02:43:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:43:19,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:19,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:19,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:43:19,519 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-09 02:43:19,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash -145697313, now seen corresponding path program 1 times [2025-03-09 02:43:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826621182] [2025-03-09 02:43:19,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:19,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:43:19,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:43:19,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:19,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:19,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826621182] [2025-03-09 02:43:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826621182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:19,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:43:19,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:43:19,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190728060] [2025-03-09 02:43:19,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:19,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:43:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:19,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:43:19,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:43:19,582 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-09 02:43:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:19,641 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-09 02:43:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:43:19,642 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-09 02:43:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:19,643 INFO L225 Difference]: With dead ends: 38 [2025-03-09 02:43:19,644 INFO L226 Difference]: Without dead ends: 37 [2025-03-09 02:43:19,644 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-09 02:43:19,646 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-09 02:43:19,646 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-09 02:43:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-09 02:43:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-09 02:43:19,652 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-09 02:43:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-09 02:43:19,653 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 7 [2025-03-09 02:43:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:19,653 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-09 02:43:19,654 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-09 02:43:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-03-09 02:43:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:43:19,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:19,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:19,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:43:19,654 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-09 02:43:19,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash -221649414, now seen corresponding path program 1 times [2025-03-09 02:43:19,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:19,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318112930] [2025-03-09 02:43:19,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:19,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:19,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:43:19,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:43:19,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:19,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318112930] [2025-03-09 02:43:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318112930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:19,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:43:19,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:43:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660906518] [2025-03-09 02:43:19,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:19,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:43:19,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:19,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:43:19,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:43:19,713 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-09 02:43:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:19,760 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-09 02:43:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:43:19,761 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-09 02:43:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:19,761 INFO L225 Difference]: With dead ends: 37 [2025-03-09 02:43:19,761 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 02:43:19,761 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-09 02:43:19,765 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-09 02:43:19,766 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-09 02:43:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 02:43:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 02:43:19,770 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-09 02:43:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-09 02:43:19,772 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2025-03-09 02:43:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:19,773 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-09 02:43:19,773 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-09 02:43:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-09 02:43:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 02:43:19,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:19,773 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:19,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:43:19,773 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-09 02:43:19,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash -759415764, now seen corresponding path program 1 times [2025-03-09 02:43:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:19,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725464736] [2025-03-09 02:43:19,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:19,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:43:19,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:43:19,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:19,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:19,871 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-09 02:43:19,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:19,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725464736] [2025-03-09 02:43:19,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725464736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:19,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407539450] [2025-03-09 02:43:19,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:19,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:19,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:19,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:43:19,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:43:19,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:43:19,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:43:19,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:19,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:19,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:43:19,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:19,947 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-09 02:43:19,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:19,995 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-09 02:43:19,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407539450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:19,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:19,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-09 02:43:19,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470030546] [2025-03-09 02:43:19,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:19,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:43:19,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:19,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:43:19,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:43:19,996 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-09 02:43:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:20,135 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-03-09 02:43:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:43:20,136 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-09 02:43:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:20,136 INFO L225 Difference]: With dead ends: 88 [2025-03-09 02:43:20,136 INFO L226 Difference]: Without dead ends: 72 [2025-03-09 02:43:20,137 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-09 02:43:20,137 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-09 02:43:20,137 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-09 02:43:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-09 02:43:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2025-03-09 02:43:20,142 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-09 02:43:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2025-03-09 02:43:20,143 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 13 [2025-03-09 02:43:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:20,143 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2025-03-09 02:43:20,144 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-09 02:43:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2025-03-09 02:43:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:43:20,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:20,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:20,150 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-09 02:43:20,345 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-09 02:43:20,345 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-09 02:43:20,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:20,345 INFO L85 PathProgramCache]: Analyzing trace with hash 345931316, now seen corresponding path program 1 times [2025-03-09 02:43:20,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:20,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343616393] [2025-03-09 02:43:20,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:20,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:20,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:43:20,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:43:20,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:20,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:20,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:20,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343616393] [2025-03-09 02:43:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343616393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:20,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631306471] [2025-03-09 02:43:20,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:20,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:20,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:20,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:43:20,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:43:20,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:43:20,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:43:20,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:20,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:20,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:43:20,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:20,505 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-09 02:43:20,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:43:20,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631306471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:20,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:43:20,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-09 02:43:20,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949354974] [2025-03-09 02:43:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:20,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:43:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:20,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:43:20,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:43:20,507 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-09 02:43:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:20,578 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-03-09 02:43:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:43:20,579 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-09 02:43:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:20,580 INFO L225 Difference]: With dead ends: 66 [2025-03-09 02:43:20,580 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 02:43:20,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:43:20,581 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-09 02:43:20,581 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-09 02:43:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 02:43:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-03-09 02:43:20,591 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-09 02:43:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-03-09 02:43:20,593 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2025-03-09 02:43:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:20,594 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-03-09 02:43:20,594 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-09 02:43:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-03-09 02:43:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:43:20,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:20,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:20,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:43:20,798 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-09 02:43:20,798 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-09 02:43:20,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2133936195, now seen corresponding path program 1 times [2025-03-09 02:43:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:20,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766208188] [2025-03-09 02:43:20,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:20,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:20,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:43:20,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:43:20,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:20,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:20,862 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-09 02:43:20,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766208188] [2025-03-09 02:43:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766208188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001573943] [2025-03-09 02:43:20,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:20,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:20,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:20,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:43:20,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:43:20,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:43:20,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:43:20,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:20,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:20,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:43:20,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:20,929 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-09 02:43:20,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:20,976 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-09 02:43:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001573943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:20,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:20,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 02:43:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461099315] [2025-03-09 02:43:20,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:20,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 02:43:20,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:20,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 02:43:20,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:43:20,978 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-09 02:43:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:21,074 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2025-03-09 02:43:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:43:21,075 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-09 02:43:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:21,076 INFO L225 Difference]: With dead ends: 66 [2025-03-09 02:43:21,076 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 02:43:21,076 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-09 02:43:21,077 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-09 02:43:21,077 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-09 02:43:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 02:43:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-03-09 02:43:21,084 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-09 02:43:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2025-03-09 02:43:21,085 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 16 [2025-03-09 02:43:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:21,085 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2025-03-09 02:43:21,085 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-09 02:43:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2025-03-09 02:43:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 02:43:21,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:21,085 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-09 02:43:21,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:43:21,286 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-09 02:43:21,286 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-09 02:43:21,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:21,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1442921742, now seen corresponding path program 2 times [2025-03-09 02:43:21,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:21,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916304082] [2025-03-09 02:43:21,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:43:21,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:21,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-09 02:43:21,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:43:21,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:43:21,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:21,468 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-09 02:43:21,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:21,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916304082] [2025-03-09 02:43:21,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916304082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:21,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818299455] [2025-03-09 02:43:21,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:43:21,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:21,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:21,471 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-09 02:43:21,472 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-09 02:43:21,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-09 02:43:21,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:43:21,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:43:21,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:21,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:43:21,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:21,672 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-09 02:43:21,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:21,909 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-09 02:43:21,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818299455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:21,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:21,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-03-09 02:43:21,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740498956] [2025-03-09 02:43:21,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:21,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 02:43:21,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:21,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 02:43:21,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 02:43:21,911 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-09 02:43:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:22,707 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2025-03-09 02:43:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 02:43:22,707 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-09 02:43:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:22,708 INFO L225 Difference]: With dead ends: 153 [2025-03-09 02:43:22,708 INFO L226 Difference]: Without dead ends: 129 [2025-03-09 02:43:22,709 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-09 02:43:22,710 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-09 02:43:22,710 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-09 02:43:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-09 02:43:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2025-03-09 02:43:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.0947368421052632) internal successors, (104), 97 states have internal predecessors, (104), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 02:43:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2025-03-09 02:43:22,722 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 34 [2025-03-09 02:43:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:22,722 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2025-03-09 02:43:22,722 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-09 02:43:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2025-03-09 02:43:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 02:43:22,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:22,723 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2025-03-09 02:43:22,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:43:22,923 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-09 02:43:22,924 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-09 02:43:22,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2047671363, now seen corresponding path program 2 times [2025-03-09 02:43:22,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:22,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8074792] [2025-03-09 02:43:22,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:43:22,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:22,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 02:43:22,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:43:22,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:43:22,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:23,047 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-09 02:43:23,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:23,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8074792] [2025-03-09 02:43:23,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8074792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:23,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553374802] [2025-03-09 02:43:23,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:43:23,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:23,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:23,050 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-09 02:43:23,052 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-09 02:43:23,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 02:43:23,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:43:23,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:43:23,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:23,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:43:23,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:23,152 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-09 02:43:23,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:23,299 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-09 02:43:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553374802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:23,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:23,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-09 02:43:23,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229168749] [2025-03-09 02:43:23,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:23,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 02:43:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:23,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 02:43:23,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2025-03-09 02:43:23,300 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-09 02:43:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:23,517 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2025-03-09 02:43:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:43:23,517 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-09 02:43:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:23,518 INFO L225 Difference]: With dead ends: 124 [2025-03-09 02:43:23,518 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 02:43:23,519 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-09 02:43:23,519 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-09 02:43:23,519 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-09 02:43:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 02:43:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2025-03-09 02:43:23,527 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-09 02:43:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2025-03-09 02:43:23,527 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 37 [2025-03-09 02:43:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:23,528 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2025-03-09 02:43:23,528 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-09 02:43:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2025-03-09 02:43:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 02:43:23,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:23,529 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:23,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:43:23,729 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-09 02:43:23,730 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-09 02:43:23,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2108646142, now seen corresponding path program 1 times [2025-03-09 02:43:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:23,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189452514] [2025-03-09 02:43:23,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:23,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:23,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:43:23,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:43:23,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:23,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:24,106 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-09 02:43:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189452514] [2025-03-09 02:43:24,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189452514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332270490] [2025-03-09 02:43:24,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:24,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:24,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:24,109 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-09 02:43:24,110 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-09 02:43:24,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:43:24,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:43:24,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:24,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:24,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 02:43:24,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:24,629 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-09 02:43:24,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:25,134 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-09 02:43:25,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332270490] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:25,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:25,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 58 [2025-03-09 02:43:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088711989] [2025-03-09 02:43:25,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:25,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-09 02:43:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:25,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-09 02:43:25,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=2872, Unknown=0, NotChecked=0, Total=3306 [2025-03-09 02:43:25,137 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 58 states, 55 states have (on average 2.8545454545454545) internal successors, (157), 32 states have internal predecessors, (157), 27 states have call successors, (27), 26 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:25,856 INFO L93 Difference]: Finished difference Result 218 states and 228 transitions. [2025-03-09 02:43:25,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-09 02:43:25,856 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 2.8545454545454545) internal successors, (157), 32 states have internal predecessors, (157), 27 states have call successors, (27), 26 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-09 02:43:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:25,857 INFO L225 Difference]: With dead ends: 218 [2025-03-09 02:43:25,857 INFO L226 Difference]: Without dead ends: 177 [2025-03-09 02:43:25,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 107 SyntacticMatches, 14 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1265, Invalid=5875, Unknown=0, NotChecked=0, Total=7140 [2025-03-09 02:43:25,861 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 533 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:25,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 571 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:43:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-09 02:43:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2025-03-09 02:43:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 135 states have (on average 1.0518518518518518) internal successors, (142), 137 states have internal predecessors, (142), 17 states have call successors, (17), 16 states have call predecessors, (17), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 02:43:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 176 transitions. [2025-03-09 02:43:25,881 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 176 transitions. Word has length 77 [2025-03-09 02:43:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:25,882 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 176 transitions. [2025-03-09 02:43:25,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 2.8545454545454545) internal successors, (157), 32 states have internal predecessors, (157), 27 states have call successors, (27), 26 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:25,883 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 176 transitions. [2025-03-09 02:43:25,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:43:25,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:25,886 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1] [2025-03-09 02:43:25,892 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-09 02:43:26,086 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-09 02:43:26,087 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-09 02:43:26,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 930299395, now seen corresponding path program 3 times [2025-03-09 02:43:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:26,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229429548] [2025-03-09 02:43:26,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:43:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:26,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 12 equivalence classes. [2025-03-09 02:43:26,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:43:26,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 02:43:26,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:26,539 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-09 02:43:26,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:26,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229429548] [2025-03-09 02:43:26,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229429548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:26,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463343690] [2025-03-09 02:43:26,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:43:26,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:26,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:26,541 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-09 02:43:26,542 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-09 02:43:26,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 12 equivalence classes. [2025-03-09 02:43:26,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:43:26,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 02:43:26,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:26,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 02:43:26,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:26,710 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-09 02:43:26,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:27,228 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-09 02:43:27,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463343690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:27,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:27,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 54 [2025-03-09 02:43:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802442334] [2025-03-09 02:43:27,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:27,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-09 02:43:27,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:27,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-09 02:43:27,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=2260, Unknown=0, NotChecked=0, Total=2970 [2025-03-09 02:43:27,231 INFO L87 Difference]: Start difference. First operand 171 states and 176 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-09 02:43:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:27,875 INFO L93 Difference]: Finished difference Result 309 states and 332 transitions. [2025-03-09 02:43:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-09 02:43:27,876 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-09 02:43:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:27,877 INFO L225 Difference]: With dead ends: 309 [2025-03-09 02:43:27,877 INFO L226 Difference]: Without dead ends: 308 [2025-03-09 02:43:27,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1636, Invalid=4526, Unknown=0, NotChecked=0, Total=6162 [2025-03-09 02:43:27,879 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 755 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:27,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 500 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:43:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-09 02:43:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 279. [2025-03-09 02:43:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 225 states have (on average 1.0933333333333333) internal successors, (246), 227 states have internal predecessors, (246), 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-09 02:43:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 298 transitions. [2025-03-09 02:43:27,899 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 298 transitions. Word has length 86 [2025-03-09 02:43:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:27,899 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 298 transitions. [2025-03-09 02:43:27,899 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-09 02:43:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 298 transitions. [2025-03-09 02:43:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 02:43:27,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:27,900 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:27,906 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-09 02:43:28,101 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-09 02:43:28,102 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-09 02:43:28,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:28,102 INFO L85 PathProgramCache]: Analyzing trace with hash 639104132, now seen corresponding path program 2 times [2025-03-09 02:43:28,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:28,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613289740] [2025-03-09 02:43:28,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:43:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:28,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-09 02:43:28,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 02:43:28,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:43:28,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-09 02:43:28,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613289740] [2025-03-09 02:43:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613289740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:28,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:43:28,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:43:28,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671977084] [2025-03-09 02:43:28,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:28,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:43:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:28,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:43:28,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:43:28,195 INFO L87 Difference]: Start difference. First operand 279 states and 298 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-09 02:43:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:28,258 INFO L93 Difference]: Finished difference Result 299 states and 319 transitions. [2025-03-09 02:43:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:43:28,258 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 112 [2025-03-09 02:43:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:28,260 INFO L225 Difference]: With dead ends: 299 [2025-03-09 02:43:28,260 INFO L226 Difference]: Without dead ends: 298 [2025-03-09 02:43:28,260 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-09 02:43:28,261 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:28,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 62 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:43:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-09 02:43:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 278. [2025-03-09 02:43:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 225 states have (on average 1.048888888888889) internal successors, (236), 226 states have internal predecessors, (236), 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-09 02:43:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 288 transitions. [2025-03-09 02:43:28,273 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 288 transitions. Word has length 112 [2025-03-09 02:43:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:28,274 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 288 transitions. [2025-03-09 02:43:28,274 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-09 02:43:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 288 transitions. [2025-03-09 02:43:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-09 02:43:28,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:28,275 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:28,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:43:28,276 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:43:28,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:28,276 INFO L85 PathProgramCache]: Analyzing trace with hash 684641626, now seen corresponding path program 1 times [2025-03-09 02:43:28,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:28,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013703933] [2025-03-09 02:43:28,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:28,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:28,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-09 02:43:28,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-09 02:43:28,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:28,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2025-03-09 02:43:28,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:28,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013703933] [2025-03-09 02:43:28,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013703933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:28,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:43:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:43:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604803171] [2025-03-09 02:43:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:28,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:43:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:28,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:43:28,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:43:28,348 INFO L87 Difference]: Start difference. First operand 278 states and 288 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-09 02:43:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:28,357 INFO L93 Difference]: Finished difference Result 278 states and 288 transitions. [2025-03-09 02:43:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:43:28,357 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 162 [2025-03-09 02:43:28,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:28,358 INFO L225 Difference]: With dead ends: 278 [2025-03-09 02:43:28,358 INFO L226 Difference]: Without dead ends: 179 [2025-03-09 02:43:28,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:43:28,359 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-09 02:43:28,359 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-09 02:43:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-09 02:43:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2025-03-09 02:43:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 152 states have (on average 1.006578947368421) internal successors, (153), 152 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2025-03-09 02:43:28,365 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 162 [2025-03-09 02:43:28,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:28,367 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2025-03-09 02:43:28,367 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-09 02:43:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2025-03-09 02:43:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-09 02:43:28,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:28,369 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 1, 1, 1, 1] [2025-03-09 02:43:28,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:43:28,370 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:43:28,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:28,370 INFO L85 PathProgramCache]: Analyzing trace with hash 58234941, now seen corresponding path program 4 times [2025-03-09 02:43:28,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:28,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481664542] [2025-03-09 02:43:28,370 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:43:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:28,377 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 177 statements into 2 equivalence classes. [2025-03-09 02:43:28,406 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 177 of 177 statements. [2025-03-09 02:43:28,407 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:43:28,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 1913 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:29,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481664542] [2025-03-09 02:43:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481664542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903694677] [2025-03-09 02:43:29,689 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:43:29,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:29,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:29,691 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-09 02:43:29,692 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-09 02:43:29,720 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 177 statements into 2 equivalence classes. [2025-03-09 02:43:29,754 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 177 of 177 statements. [2025-03-09 02:43:29,755 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:43:29,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:29,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-09 02:43:29,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 2076 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:30,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:43:30,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903694677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:30,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:43:30,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [53] total 56 [2025-03-09 02:43:30,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48577841] [2025-03-09 02:43:30,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:30,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-09 02:43:30,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:30,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-09 02:43:30,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=712, Invalid=2368, Unknown=0, NotChecked=0, Total=3080 [2025-03-09 02:43:30,019 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand has 53 states, 52 states have (on average 2.923076923076923) internal successors, (152), 28 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:30,395 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2025-03-09 02:43:30,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 02:43:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.923076923076923) internal successors, (152), 28 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2025-03-09 02:43:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:30,396 INFO L225 Difference]: With dead ends: 178 [2025-03-09 02:43:30,396 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:43:30,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1136, Invalid=3976, Unknown=0, NotChecked=0, Total=5112 [2025-03-09 02:43:30,398 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 91 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:30,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 285 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:43:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:43:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:43:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:43:30,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2025-03-09 02:43:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:30,399 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:43:30,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.923076923076923) internal successors, (152), 28 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:43:30,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:43:30,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 02:43:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 02:43:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 02:43:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 02:43:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 02:43:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 02:43:30,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 02:43:30,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 02:43:30,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:43:30,604 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,SelfDestructingSolverStorable12 [2025-03-09 02:43:30,606 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:43:30,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:43:32,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:43:32,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:43:32 BoogieIcfgContainer [2025-03-09 02:43:32,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:43:32,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:43:32,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:43:32,871 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:43:32,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:43:19" (3/4) ... [2025-03-09 02:43:32,873 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:43:32,877 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sum [2025-03-09 02:43:32,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:43:32,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 02:43:32,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:43:32,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:43:32,937 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:43:32,937 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:43:32,937 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:43:32,938 INFO L158 Benchmark]: Toolchain (without parser) took 14193.89ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 111.8MB in the beginning and 181.7MB in the end (delta: -69.9MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2025-03-09 02:43:32,938 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:43:32,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.73ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 101.7MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:43:32,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.91ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 986.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:43:32,939 INFO L158 Benchmark]: Boogie Preprocessor took 21.90ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:43:32,939 INFO L158 Benchmark]: IcfgBuilder took 179.86ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 88.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:43:32,939 INFO L158 Benchmark]: TraceAbstraction took 13765.81ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 87.8MB in the beginning and 189.8MB in the end (delta: -102.0MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. [2025-03-09 02:43:32,940 INFO L158 Benchmark]: Witness Printer took 66.72ms. Allocated memory is still 352.3MB. Free memory was 189.8MB in the beginning and 181.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:43:32,941 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.16ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.73ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 101.7MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.91ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 986.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.90ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 179.86ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 88.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13765.81ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 87.8MB in the beginning and 189.8MB in the end (delta: -102.0MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. * Witness Printer took 66.72ms. Allocated memory is still 352.3MB. Free memory was 189.8MB in the beginning and 181.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 36 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 13, TraceHistogramMax: 25, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2412 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2398 mSDsluCounter, 2589 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2236 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2914 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 353 mSDtfsCounter, 2914 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 997 GetRequests, 593 SyntacticMatches, 14 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5830 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=10, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 83 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1441 ConstructedInterpolants, 0 QuantifiedInterpolants, 3983 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1151 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 27 InterpolantComputations, 7 PerfectInterpolantSequences, 5880/8767 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-09 02:43:32,960 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