./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/McCarthy91-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/McCarthy91-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 a7241ade69e14c61e98aa837796de568ecf31fbd07f5084e15c262d93cdb3376 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:44:19,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:44:19,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:44:19,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:44:19,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:44:19,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:44:19,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:44:19,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:44:19,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:44:19,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:44:19,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:44:19,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:44:19,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:44:19,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:44:19,941 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:44:19,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:44:19,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:44:19,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:44:19,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:44:19,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:44:19,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:44:19,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:44:19,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:44:19,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:44:19,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:44:19,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:44:19,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:44:19,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:44:19,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:44:19,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:44:19,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:44:19,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:44:19,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:44:19,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:44:19,943 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 -> a7241ade69e14c61e98aa837796de568ecf31fbd07f5084e15c262d93cdb3376 [2025-03-17 15:44:20,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:44:20,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:44:20,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:44:20,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:44:20,173 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:44:20,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/McCarthy91-1.c [2025-03-17 15:44:21,263 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2b40198/535606bb223d459cb692668cae3c3d52/FLAGb3e7756a4 [2025-03-17 15:44:21,445 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:44:21,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-1.c [2025-03-17 15:44:21,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2b40198/535606bb223d459cb692668cae3c3d52/FLAGb3e7756a4 [2025-03-17 15:44:21,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2b40198/535606bb223d459cb692668cae3c3d52 [2025-03-17 15:44:21,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:44:21,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:44:21,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:44:21,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:44:21,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:44:21,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5431a110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21, skipping insertion in model container [2025-03-17 15:44:21,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:44:21,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:44:21,935 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:44:21,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:44:21,956 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:44:21,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21 WrapperNode [2025-03-17 15:44:21,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:44:21,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:44:21,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:44:21,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:44:21,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,976 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2025-03-17 15:44:21,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:44:21,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:44:21,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:44:21,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:44:21,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,992 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-17 15:44:21,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:21,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:44:21,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:44:21,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:44:21,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:44:21,997 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (1/1) ... [2025-03-17 15:44:22,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:44:22,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:44:22,023 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-17 15:44:22,024 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-17 15:44:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:44:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:44:22,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:44:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:44:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2025-03-17 15:44:22,040 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2025-03-17 15:44:22,077 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:44:22,078 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:44:22,169 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: havoc #t~ret4;havoc #t~ret5; [2025-03-17 15:44:22,174 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 15:44:22,174 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:44:22,181 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:44:22,181 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:44:22,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:44:22 BoogieIcfgContainer [2025-03-17 15:44:22,181 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:44:22,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:44:22,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:44:22,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:44:22,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:44:21" (1/3) ... [2025-03-17 15:44:22,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570d47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:44:22, skipping insertion in model container [2025-03-17 15:44:22,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:44:21" (2/3) ... [2025-03-17 15:44:22,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570d47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:44:22, skipping insertion in model container [2025-03-17 15:44:22,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:44:22" (3/3) ... [2025-03-17 15:44:22,188 INFO L128 eAbstractionObserver]: Analyzing ICFG McCarthy91-1.c [2025-03-17 15:44:22,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:44:22,202 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG McCarthy91-1.c that has 2 procedures, 30 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-17 15:44:22,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:44:22,248 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;@206e4d1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:44:22,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 15:44:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:44:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:44:22,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:22,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:44:22,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:22,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 43526562, now seen corresponding path program 1 times [2025-03-17 15:44:22,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:22,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762191657] [2025-03-17 15:44:22,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:44:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:22,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:44:22,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:44:22,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:22,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:22,374 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-17 15:44:22,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:22,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762191657] [2025-03-17 15:44:22,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762191657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:44:22,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:44:22,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:44:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776130069] [2025-03-17 15:44:22,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:44:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:44:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:22,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:44:22,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:44:22,397 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 15:44:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:22,432 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-17 15:44:22,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:44:22,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-03-17 15:44:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:22,438 INFO L225 Difference]: With dead ends: 33 [2025-03-17 15:44:22,438 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 15:44:22,440 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-17 15:44:22,443 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:22,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:44:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 15:44:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 15:44:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:44:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-17 15:44:22,472 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 5 [2025-03-17 15:44:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:22,472 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-17 15:44:22,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 15:44:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-17 15:44:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:44:22,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:22,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:44:22,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:44:22,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:22,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:22,474 INFO L85 PathProgramCache]: Analyzing trace with hash 43526602, now seen corresponding path program 1 times [2025-03-17 15:44:22,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:22,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96634040] [2025-03-17 15:44:22,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:44:22,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:22,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:44:22,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:44:22,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:22,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:22,538 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-17 15:44:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96634040] [2025-03-17 15:44:22,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96634040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:44:22,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:44:22,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:44:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253230472] [2025-03-17 15:44:22,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:44:22,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:44:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:22,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:44:22,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:44:22,540 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-17 15:44:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:22,642 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-03-17 15:44:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:44:22,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-03-17 15:44:22,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:22,644 INFO L225 Difference]: With dead ends: 41 [2025-03-17 15:44:22,644 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 15:44:22,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-17 15:44:22,645 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:22,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:44:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 15:44:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2025-03-17 15:44:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:44:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-17 15:44:22,651 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 5 [2025-03-17 15:44:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:22,651 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-17 15:44:22,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-17 15:44:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-17 15:44:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:44:22,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:22,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:44:22,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:44:22,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:22,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1349323409, now seen corresponding path program 1 times [2025-03-17 15:44:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:22,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769017360] [2025-03-17 15:44:22,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:44:22,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:22,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:44:22,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:44:22,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:22,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:22,690 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-17 15:44:22,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:22,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769017360] [2025-03-17 15:44:22,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769017360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:44:22,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:44:22,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:44:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228772727] [2025-03-17 15:44:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:44:22,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:44:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:22,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:44:22,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:44:22,691 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-17 15:44:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:22,753 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2025-03-17 15:44:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:44:22,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-17 15:44:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:22,754 INFO L225 Difference]: With dead ends: 56 [2025-03-17 15:44:22,754 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 15:44:22,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-17 15:44:22,755 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:22,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:44:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 15:44:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2025-03-17 15:44:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.28125) internal successors, (41), 35 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:44:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-03-17 15:44:22,764 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 6 [2025-03-17 15:44:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:22,765 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-03-17 15:44:22,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-17 15:44:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2025-03-17 15:44:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:44:22,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:22,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:44:22,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:44:22,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:22,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:22,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1349324658, now seen corresponding path program 1 times [2025-03-17 15:44:22,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:22,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143246744] [2025-03-17 15:44:22,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:44:22,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:22,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:44:22,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:44:22,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:22,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:22,795 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-17 15:44:22,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:22,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143246744] [2025-03-17 15:44:22,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143246744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:44:22,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:44:22,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:44:22,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866258487] [2025-03-17 15:44:22,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:44:22,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:44:22,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:22,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:44:22,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:44:22,796 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-17 15:44:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:22,810 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2025-03-17 15:44:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:44:22,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-17 15:44:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:22,813 INFO L225 Difference]: With dead ends: 52 [2025-03-17 15:44:22,813 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 15:44:22,813 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-17 15:44:22,813 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:22,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:44:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 15:44:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-03-17 15:44:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:44:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-03-17 15:44:22,827 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 6 [2025-03-17 15:44:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:22,828 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-03-17 15:44:22,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-17 15:44:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-03-17 15:44:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 15:44:22,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:22,828 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:44:22,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:44:22,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:22,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:22,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1197370162, now seen corresponding path program 1 times [2025-03-17 15:44:22,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:22,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081092609] [2025-03-17 15:44:22,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:44:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:22,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 15:44:22,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 15:44:22,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:22,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:44:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081092609] [2025-03-17 15:44:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081092609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:44:22,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:44:22,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:44:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240077208] [2025-03-17 15:44:22,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:44:22,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:44:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:22,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:44:22,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:44:22,898 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-17 15:44:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:22,953 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2025-03-17 15:44:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:44:22,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2025-03-17 15:44:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:22,954 INFO L225 Difference]: With dead ends: 67 [2025-03-17 15:44:22,954 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 15:44:22,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:44:22,955 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:22,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 72 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:44:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 15:44:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2025-03-17 15:44:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:44:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2025-03-17 15:44:22,976 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 11 [2025-03-17 15:44:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:22,976 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2025-03-17 15:44:22,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-17 15:44:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2025-03-17 15:44:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 15:44:22,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:22,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:44:22,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:44:22,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:22,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2067655441, now seen corresponding path program 1 times [2025-03-17 15:44:22,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:22,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194042212] [2025-03-17 15:44:22,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:44:22,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:22,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 15:44:22,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 15:44:22,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:22,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:23,028 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-17 15:44:23,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194042212] [2025-03-17 15:44:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194042212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:44:23,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:44:23,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:44:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328161935] [2025-03-17 15:44:23,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:44:23,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:44:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:23,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:44:23,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:44:23,029 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:44:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:23,043 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-03-17 15:44:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:44:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-17 15:44:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:23,044 INFO L225 Difference]: With dead ends: 57 [2025-03-17 15:44:23,044 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 15:44:23,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:44:23,045 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:23,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:44:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 15:44:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 15:44:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:44:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-17 15:44:23,051 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 12 [2025-03-17 15:44:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:23,051 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-17 15:44:23,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:44:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-17 15:44:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 15:44:23,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:23,052 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:44:23,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:44:23,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:23,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1750760635, now seen corresponding path program 1 times [2025-03-17 15:44:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:23,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930155752] [2025-03-17 15:44:23,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:44:23,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:23,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 15:44:23,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 15:44:23,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:23,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:44:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:23,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930155752] [2025-03-17 15:44:23,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930155752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:44:23,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:44:23,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:44:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644534438] [2025-03-17 15:44:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:44:23,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:44:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:23,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:44:23,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:44:23,120 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:44:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:23,221 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2025-03-17 15:44:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:44:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-17 15:44:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:23,223 INFO L225 Difference]: With dead ends: 100 [2025-03-17 15:44:23,223 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 15:44:23,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:44:23,224 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:23,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:44:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 15:44:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-03-17 15:44:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.15) internal successors, (69), 65 states have internal predecessors, (69), 19 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-17 15:44:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2025-03-17 15:44:23,242 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 18 [2025-03-17 15:44:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:23,242 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2025-03-17 15:44:23,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:44:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2025-03-17 15:44:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:44:23,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:23,243 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:44:23,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:44:23,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:23,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1560996416, now seen corresponding path program 1 times [2025-03-17 15:44:23,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:23,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925153580] [2025-03-17 15:44:23,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:44:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:23,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:44:23,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:44:23,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:23,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:44:23,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:23,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925153580] [2025-03-17 15:44:23,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925153580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:44:23,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957383131] [2025-03-17 15:44:23,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:44:23,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:44:23,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:44:23,332 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-17 15:44:23,334 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-17 15:44:23,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:44:23,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:44:23,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:23,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:23,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:44:23,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:44:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:44:23,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:44:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:44:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957383131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:44:23,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:44:23,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2025-03-17 15:44:23,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742400943] [2025-03-17 15:44:23,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:44:23,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 15:44:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:23,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 15:44:23,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:44:23,650 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:44:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:24,086 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2025-03-17 15:44:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 15:44:24,088 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2025-03-17 15:44:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:24,089 INFO L225 Difference]: With dead ends: 99 [2025-03-17 15:44:24,089 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 15:44:24,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=462, Invalid=1344, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 15:44:24,091 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 75 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:24,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:44:24,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 15:44:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2025-03-17 15:44:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 64 states have internal predecessors, (67), 19 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-17 15:44:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2025-03-17 15:44:24,107 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 19 [2025-03-17 15:44:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:24,107 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2025-03-17 15:44:24,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:44:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2025-03-17 15:44:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 15:44:24,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:24,110 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:44:24,117 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-17 15:44:24,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:44:24,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:24,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash -657401448, now seen corresponding path program 1 times [2025-03-17 15:44:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:24,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110660274] [2025-03-17 15:44:24,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:44:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:24,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:44:24,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:44:24,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:24,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 15:44:24,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:24,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110660274] [2025-03-17 15:44:24,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110660274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:44:24,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:44:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:44:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369549367] [2025-03-17 15:44:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:44:24,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:44:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:24,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:44:24,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:44:24,385 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:44:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:24,484 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2025-03-17 15:44:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:44:24,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-03-17 15:44:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:24,484 INFO L225 Difference]: With dead ends: 92 [2025-03-17 15:44:24,484 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:44:24,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:44:24,485 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:24,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 65 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:44:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:44:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:44:24,486 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-17 15:44:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:44:24,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2025-03-17 15:44:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:24,486 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:44:24,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:44:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:44:24,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 15:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 15:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 15:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 15:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 15:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 15:44:24,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:44:24,490 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:44:24,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:44:24,867 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:44:24,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:44:24 BoogieIcfgContainer [2025-03-17 15:44:24,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:44:24,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:44:24,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:44:24,872 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:44:24,873 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:44:22" (3/4) ... [2025-03-17 15:44:24,874 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:44:24,878 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f91 [2025-03-17 15:44:24,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 15:44:24,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:44:24,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:44:24,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:44:24,926 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:44:24,926 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:44:24,926 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:44:24,927 INFO L158 Benchmark]: Toolchain (without parser) took 3105.84ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 67.7MB in the end (delta: 45.4MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2025-03-17 15:44:24,927 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:44:24,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.00ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.8MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:44:24,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.89ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.8MB in the end (delta: 930.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:44:24,927 INFO L158 Benchmark]: Boogie Preprocessor took 19.12ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:44:24,927 INFO L158 Benchmark]: IcfgBuilder took 184.70ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 88.5MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:44:24,928 INFO L158 Benchmark]: TraceAbstraction took 2688.75ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 73.9MB in the end (delta: 14.1MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2025-03-17 15:44:24,928 INFO L158 Benchmark]: Witness Printer took 53.75ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 67.7MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:44:24,929 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.00ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.8MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.89ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.8MB in the end (delta: 930.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.12ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 184.70ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 88.5MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2688.75ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 73.9MB in the end (delta: 14.1MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Witness Printer took 53.75ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 67.7MB in the end (delta: 6.2MB). 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: 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, 30 locations, 38 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 311 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 175 mSDtfsCounter, 634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=7, InterpolantAutomatonStates: 78, 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, 9 MinimizatonAttempts, 46 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 362 SizeOfPredicates, 3 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 54/68 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 15:44:24,940 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