./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/termination-recursive-malloc/rec_malloc_ex2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash b91dcc12f43fdd03af0529f07bf7885945925554291ddde3b9ca40d8f32b93c1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:50:56,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:50:56,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 18:50:56,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:50:56,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:50:56,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:50:56,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:50:56,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:50:56,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:50:56,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:50:56,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:50:56,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:50:56,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:50:56,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:50:56,463 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:50:56,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:50:56,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:50:56,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:50:56,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:50:56,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:50:56,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:50:56,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:50:56,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:50:56,468 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:50:56,469 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:50:56,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:50:56,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:50:56,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:50:56,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:50:56,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:50:56,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:50:56,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:50:56,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:50:56,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:50:56,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:50:56,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:50:56,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:50:56,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:50:56,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:50:56,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:50:56,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:50:56,474 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b91dcc12f43fdd03af0529f07bf7885945925554291ddde3b9ca40d8f32b93c1 [2024-11-10 18:50:56,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:50:56,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:50:56,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:50:56,735 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:50:56,736 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:50:56,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2024-11-10 18:50:58,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:50:58,411 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:50:58,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2024-11-10 18:50:58,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41f6fe76/35b89e2f95504b3e852a7ea34f06c9b1/FLAG169d01066 [2024-11-10 18:50:58,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41f6fe76/35b89e2f95504b3e852a7ea34f06c9b1 [2024-11-10 18:50:58,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:50:58,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:50:58,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:50:58,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:50:58,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:50:58,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7599d8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58, skipping insertion in model container [2024-11-10 18:50:58,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:50:58,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:50:58,656 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:50:58,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:50:58,689 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:50:58,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58 WrapperNode [2024-11-10 18:50:58,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:50:58,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:50:58,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:50:58,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:50:58,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,720 INFO L138 Inliner]: procedures = 11, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2024-11-10 18:50:58,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:50:58,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:50:58,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:50:58,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:50:58,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,747 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [5, 5]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-11-10 18:50:58,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,756 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:50:58,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:50:58,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:50:58,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:50:58,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (1/1) ... [2024-11-10 18:50:58,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:50:58,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:50:58,801 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) [2024-11-10 18:50:58,804 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 [2024-11-10 18:50:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:50:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:50:58,853 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2024-11-10 18:50:58,853 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2024-11-10 18:50:58,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:50:58,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:50:58,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:50:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:50:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:50:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:50:58,972 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:50:58,974 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:50:59,108 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: havoc #t~ret6; [2024-11-10 18:50:59,112 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc ~pv~0; [2024-11-10 18:50:59,190 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 18:50:59,192 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:50:59,206 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:50:59,207 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:50:59,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:50:59 BoogieIcfgContainer [2024-11-10 18:50:59,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:50:59,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:50:59,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:50:59,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:50:59,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:50:58" (1/3) ... [2024-11-10 18:50:59,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40475490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:50:59, skipping insertion in model container [2024-11-10 18:50:59,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:50:58" (2/3) ... [2024-11-10 18:50:59,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40475490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:50:59, skipping insertion in model container [2024-11-10 18:50:59,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:50:59" (3/3) ... [2024-11-10 18:50:59,217 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_malloc_ex2.i [2024-11-10 18:50:59,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:50:59,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 18:50:59,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:50:59,305 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;@41c32251, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:50:59,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 18:50:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:50:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 18:50:59,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:50:59,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:50:59,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:50:59,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:50:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1467171040, now seen corresponding path program 1 times [2024-11-10 18:50:59,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:50:59,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388119382] [2024-11-10 18:50:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:50:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:50:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:50:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:50:59,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:50:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388119382] [2024-11-10 18:50:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388119382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:50:59,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:50:59,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:50:59,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130359843] [2024-11-10 18:50:59,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:50:59,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:50:59,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:50:59,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:50:59,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:50:59,742 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2024-11-10 18:50:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:50:59,814 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-10 18:50:59,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:50:59,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 9 [2024-11-10 18:50:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:50:59,822 INFO L225 Difference]: With dead ends: 29 [2024-11-10 18:50:59,822 INFO L226 Difference]: Without dead ends: 22 [2024-11-10 18:50:59,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:50:59,827 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:50:59,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:50:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-10 18:50:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-10 18:50:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:50:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-10 18:50:59,858 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2024-11-10 18:50:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:50:59,859 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-10 18:50:59,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2024-11-10 18:50:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-10 18:50:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 18:50:59,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:50:59,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:50:59,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:50:59,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:50:59,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:50:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1762337990, now seen corresponding path program 1 times [2024-11-10 18:50:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:50:59,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357890042] [2024-11-10 18:50:59,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:50:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:50:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:51:00,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:00,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357890042] [2024-11-10 18:51:00,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357890042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:00,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:00,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:51:00,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881603042] [2024-11-10 18:51:00,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:00,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:51:00,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:00,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:51:00,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:51:00,256 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2024-11-10 18:51:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:00,528 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2024-11-10 18:51:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:51:00,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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 10 [2024-11-10 18:51:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:00,531 INFO L225 Difference]: With dead ends: 50 [2024-11-10 18:51:00,532 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 18:51:00,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:51:00,535 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:00,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 95 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:51:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 18:51:00,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2024-11-10 18:51:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 31 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 18:51:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-10 18:51:00,550 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 10 [2024-11-10 18:51:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:00,550 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-10 18:51:00,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2024-11-10 18:51:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-10 18:51:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 18:51:00,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:00,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:00,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:51:00,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:51:00,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1202844332, now seen corresponding path program 1 times [2024-11-10 18:51:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453453618] [2024-11-10 18:51:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:51:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:51:00,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:00,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453453618] [2024-11-10 18:51:00,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453453618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:00,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:00,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:51:00,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985693503] [2024-11-10 18:51:00,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:00,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:51:00,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:00,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:51:00,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:51:00,714 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) [2024-11-10 18:51:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:00,772 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-11-10 18:51:00,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:51:00,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-10 18:51:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:00,775 INFO L225 Difference]: With dead ends: 37 [2024-11-10 18:51:00,777 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 18:51:00,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:51:00,778 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:00,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 18:51:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 18:51:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 18:51:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-10 18:51:00,791 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 11 [2024-11-10 18:51:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:00,791 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-10 18:51:00,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) [2024-11-10 18:51:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-10 18:51:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 18:51:00,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:00,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:00,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:51:00,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:51:00,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1366531358, now seen corresponding path program 1 times [2024-11-10 18:51:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:00,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051244515] [2024-11-10 18:51:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:00,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:51:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:51:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051244515] [2024-11-10 18:51:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051244515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:00,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:51:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965341919] [2024-11-10 18:51:00,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:00,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:51:00,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:00,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:51:00,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:51:00,977 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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) [2024-11-10 18:51:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:01,102 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-10 18:51:01,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:51:01,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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 [2024-11-10 18:51:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:01,104 INFO L225 Difference]: With dead ends: 51 [2024-11-10 18:51:01,105 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 18:51:01,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:51:01,107 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:01,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 18:51:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-11-10 18:51:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-10 18:51:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-11-10 18:51:01,124 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 12 [2024-11-10 18:51:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:01,124 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-11-10 18:51:01,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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) [2024-11-10 18:51:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-11-10 18:51:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 18:51:01,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:01,126 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:01,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:51:01,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:51:01,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:01,128 INFO L85 PathProgramCache]: Analyzing trace with hash -151399944, now seen corresponding path program 1 times [2024-11-10 18:51:01,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:01,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141967538] [2024-11-10 18:51:01,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:01,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:01,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:51:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:01,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:51:01,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:01,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141967538] [2024-11-10 18:51:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141967538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:01,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:01,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:51:01,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803011620] [2024-11-10 18:51:01,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:01,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:51:01,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:01,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:51:01,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:51:01,435 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:51:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:01,513 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2024-11-10 18:51:01,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:51:01,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-10 18:51:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:01,515 INFO L225 Difference]: With dead ends: 66 [2024-11-10 18:51:01,515 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 18:51:01,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:51:01,516 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:01,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 18:51:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 18:51:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 32 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 18:51:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-10 18:51:01,531 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 21 [2024-11-10 18:51:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:01,535 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-10 18:51:01,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:51:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-10 18:51:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 18:51:01,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:01,537 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:01,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:51:01,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:51:01,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1793055183, now seen corresponding path program 1 times [2024-11-10 18:51:01,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:01,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776495214] [2024-11-10 18:51:01,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:01,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:01,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:51:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 18:51:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 18:51:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:01,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776495214] [2024-11-10 18:51:01,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776495214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:01,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:51:01,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215834866] [2024-11-10 18:51:01,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:01,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:51:01,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:01,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:51:01,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:51:01,785 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:51:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:01,878 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-10 18:51:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:51:01,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-10 18:51:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:01,879 INFO L225 Difference]: With dead ends: 38 [2024-11-10 18:51:01,880 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 18:51:01,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:51:01,881 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:01,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 73 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 18:51:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-10 18:51:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 31 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 18:51:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-10 18:51:01,887 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 22 [2024-11-10 18:51:01,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:01,888 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-10 18:51:01,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:51:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-10 18:51:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 18:51:01,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:01,889 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:01,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:51:01,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:51:01,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash -732410777, now seen corresponding path program 1 times [2024-11-10 18:51:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:01,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104451420] [2024-11-10 18:51:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:01,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:02,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:51:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:02,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 18:51:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:51:02,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:02,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104451420] [2024-11-10 18:51:02,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104451420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:02,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136443570] [2024-11-10 18:51:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:02,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:02,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:02,440 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) [2024-11-10 18:51:02,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:51:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:02,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 18:51:02,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:02,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 18:51:02,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 18:51:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 18:51:02,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:51:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136443570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:03,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:03,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 24 [2024-11-10 18:51:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525504850] [2024-11-10 18:51:03,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:03,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 18:51:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:03,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 18:51:03,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2024-11-10 18:51:03,315 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 18:51:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:03,498 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2024-11-10 18:51:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 18:51:03,498 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2024-11-10 18:51:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:03,499 INFO L225 Difference]: With dead ends: 60 [2024-11-10 18:51:03,499 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 18:51:03,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2024-11-10 18:51:03,501 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:03,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 127 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 18:51:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-10 18:51:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1) internal successors, (33), 33 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 18:51:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-10 18:51:03,507 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 31 [2024-11-10 18:51:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:03,507 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-10 18:51:03,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 18:51:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-10 18:51:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 18:51:03,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:03,509 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:03,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:51:03,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:03,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:51:03,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash 152304216, now seen corresponding path program 2 times [2024-11-10 18:51:03,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:03,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178457945] [2024-11-10 18:51:03,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:04,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:51:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 18:51:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:04,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 18:51:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 18:51:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:04,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178457945] [2024-11-10 18:51:04,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178457945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:04,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709456059] [2024-11-10 18:51:04,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:51:04,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:04,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:04,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:51:04,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:51:04,660 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:51:04,660 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:51:04,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 18:51:04,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:04,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 18:51:05,126 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-10 18:51:05,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 47 [2024-11-10 18:51:05,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-10 18:51:05,269 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-10 18:51:05,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2024-11-10 18:51:05,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 18:51:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 18:51:05,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:05,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 18:51:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 18:51:05,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709456059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:05,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:05,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 35 [2024-11-10 18:51:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668684090] [2024-11-10 18:51:05,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:05,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-10 18:51:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:05,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-10 18:51:06,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1084, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 18:51:06,000 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 35 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-10 18:51:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:07,393 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-10 18:51:07,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-10 18:51:07,393 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 41 [2024-11-10 18:51:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:07,394 INFO L225 Difference]: With dead ends: 75 [2024-11-10 18:51:07,394 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:51:07,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=431, Invalid=3729, Unknown=0, NotChecked=0, Total=4160 [2024-11-10 18:51:07,396 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 54 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:07,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 136 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 746 Invalid, 2 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 18:51:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:51:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:51:07,398 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) [2024-11-10 18:51:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:51:07,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-11-10 18:51:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:07,398 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:51:07,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-10 18:51:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:51:07,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:51:07,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-10 18:51:07,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-10 18:51:07,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-10 18:51:07,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-10 18:51:07,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:51:07,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-10 18:51:07,606 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:07,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:51:27,960 WARN L286 SmtUtils]: Spent 20.31s on a formula simplification. DAG size of input: 105 DAG size of output: 58 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-10 18:51:36,097 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 64 DAG size of output: 40 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-10 18:51:36,102 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:51:36,115 WARN L156 FloydHoareUtils]: Requires clause for rec contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |#memory_int#0| |old(#memory_int#0)|) (exists ((|v_ULTIMATE.start_main_~ip~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~ip~0#1.offset_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int#1| |v_ULTIMATE.start_main_~ip~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~ip~0#1.offset_BEFORE_CALL_1|) 2147483647)) (<= (select (select |old(#memory_int#0)| |rec_#in~p.base|) |rec_#in~p.offset|) 2147483647) (= |old(#valid)| |#valid|)) Eliminated clause: (and (<= (select (select |#memory_int#0| |rec_#in~p.base|) |rec_#in~p.offset|) 2147483647) (exists ((|v_ULTIMATE.start_main_~ip~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~ip~0#1.offset_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int#1| |v_ULTIMATE.start_main_~ip~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~ip~0#1.offset_BEFORE_CALL_1|) 2147483647))) [2024-11-10 18:51:36,131 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 18:51:36,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 18:51:36,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-11-10 18:51:36,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 18:51:36,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 18:51:36,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 18:51:36,135 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]] [2024-11-10 18:51:36,135 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-11-10 18:51:36,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:51:36 BoogieIcfgContainer [2024-11-10 18:51:36,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:51:36,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:51:36,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:51:36,140 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:51:36,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:50:59" (3/4) ... [2024-11-10 18:51:36,143 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:51:36,148 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure rec [2024-11-10 18:51:36,153 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-10 18:51:36,153 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 18:51:36,153 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-10 18:51:36,154 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:51:36,225 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:51:36,226 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:51:36,226 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:51:36,227 INFO L158 Benchmark]: Toolchain (without parser) took 37793.33ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 85.8MB in the beginning and 70.5MB in the end (delta: 15.3MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-11-10 18:51:36,227 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 123.7MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:51:36,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.25ms. Allocated memory is still 157.3MB. Free memory was 85.4MB in the beginning and 73.9MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 18:51:36,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.92ms. Allocated memory is still 157.3MB. Free memory was 73.9MB in the beginning and 72.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:51:36,228 INFO L158 Benchmark]: Boogie Preprocessor took 41.09ms. Allocated memory is still 157.3MB. Free memory was 72.5MB in the beginning and 70.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:51:36,228 INFO L158 Benchmark]: IcfgBuilder took 444.36ms. Allocated memory is still 157.3MB. Free memory was 70.8MB in the beginning and 120.3MB in the end (delta: -49.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 18:51:36,228 INFO L158 Benchmark]: TraceAbstraction took 36928.77ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 119.5MB in the beginning and 75.8MB in the end (delta: 43.8MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2024-11-10 18:51:36,228 INFO L158 Benchmark]: Witness Printer took 86.46ms. Allocated memory is still 209.7MB. Free memory was 75.8MB in the beginning and 70.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:51:36,230 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.24ms. Allocated memory is still 123.7MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.25ms. Allocated memory is still 157.3MB. Free memory was 85.4MB in the beginning and 73.9MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.92ms. Allocated memory is still 157.3MB. Free memory was 73.9MB in the beginning and 72.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.09ms. Allocated memory is still 157.3MB. Free memory was 72.5MB in the beginning and 70.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 444.36ms. Allocated memory is still 157.3MB. Free memory was 70.8MB in the beginning and 120.3MB in the end (delta: -49.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 36928.77ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 119.5MB in the beginning and 75.8MB in the end (delta: 43.8MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. * Witness Printer took 86.46ms. Allocated memory is still 209.7MB. Free memory was 75.8MB in the beginning and 70.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]],[IdentifierExpression[#in~p!base,]]] * 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: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: 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, 26 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 729 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 617 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1269 IncrementalHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 112 mSDtfsCounter, 1269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 91, 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, 8 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 289 ConstructedInterpolants, 30 QuantifiedInterpolants, 2135 SizeOfPredicates, 19 NumberOfNonLiveVariables, 468 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 119/150 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-10 18:51:36,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE