./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.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 33d006375056e7e3c58d58b776bed0fedce081ec4ff9e691f038a741177fe7dd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 18:17:22,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 18:17:22,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-20 18:17:22,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 18:17:22,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 18:17:22,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 18:17:22,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 18:17:22,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 18:17:22,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 18:17:22,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 18:17:22,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 18:17:22,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 18:17:22,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 18:17:22,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 18:17:22,258 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 18:17:22,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 18:17:22,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 18:17:22,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 18:17:22,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 18:17:22,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 18:17:22,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 18:17:22,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 18:17:22,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 18:17:22,263 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 18:17:22,264 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 18:17:22,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 18:17:22,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 18:17:22,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 18:17:22,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 18:17:22,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 18:17:22,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 18:17:22,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 18:17:22,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 18:17:22,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 18:17:22,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 18:17:22,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 18:17:22,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 18:17:22,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 18:17:22,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 18:17:22,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 18:17:22,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 18:17:22,268 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 -> 33d006375056e7e3c58d58b776bed0fedce081ec4ff9e691f038a741177fe7dd [2024-11-20 18:17:22,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 18:17:22,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 18:17:22,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 18:17:22,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 18:17:22,599 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 18:17:22,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2024-11-20 18:17:24,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 18:17:24,315 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 18:17:24,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2024-11-20 18:17:24,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789faa9b0/f8afc4f3989040d799d9e9b2550e15a0/FLAGb39f4b9b3 [2024-11-20 18:17:24,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789faa9b0/f8afc4f3989040d799d9e9b2550e15a0 [2024-11-20 18:17:24,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 18:17:24,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 18:17:24,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 18:17:24,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 18:17:24,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 18:17:24,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aee94f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24, skipping insertion in model container [2024-11-20 18:17:24,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 18:17:24,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 18:17:24,563 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 18:17:24,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 18:17:24,597 INFO L204 MainTranslator]: Completed translation [2024-11-20 18:17:24,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24 WrapperNode [2024-11-20 18:17:24,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 18:17:24,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 18:17:24,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 18:17:24,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 18:17:24,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,630 INFO L138 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-11-20 18:17:24,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 18:17:24,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 18:17:24,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 18:17:24,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 18:17:24,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,664 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-20 18:17:24,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 18:17:24,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 18:17:24,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 18:17:24,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 18:17:24,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (1/1) ... [2024-11-20 18:17:24,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 18:17:24,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:17:24,723 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-20 18:17:24,727 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-20 18:17:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 18:17:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2024-11-20 18:17:24,778 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2024-11-20 18:17:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 18:17:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 18:17:24,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 18:17:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 18:17:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 18:17:24,835 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 18:17:24,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 18:17:24,954 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-20 18:17:24,955 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 18:17:24,969 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 18:17:24,969 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 18:17:24,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:17:24 BoogieIcfgContainer [2024-11-20 18:17:24,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 18:17:24,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 18:17:24,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 18:17:24,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 18:17:24,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:17:24" (1/3) ... [2024-11-20 18:17:24,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec1a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:17:24, skipping insertion in model container [2024-11-20 18:17:24,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:17:24" (2/3) ... [2024-11-20 18:17:24,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec1a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:17:24, skipping insertion in model container [2024-11-20 18:17:24,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:17:24" (3/3) ... [2024-11-20 18:17:24,984 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_malloc_ex3.i [2024-11-20 18:17:25,000 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 18:17:25,000 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-20 18:17:25,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 18:17:25,065 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;@7a67b543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 18:17:25,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-20 18:17:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 18 states have internal predecessors, (21), 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-20 18:17:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 18:17:25,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:17:25,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:17:25,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:17:25,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:17:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash -68895888, now seen corresponding path program 1 times [2024-11-20 18:17:25,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:17:25,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926329492] [2024-11-20 18:17:25,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:17:25,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:17:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:17:25,616 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-20 18:17:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:17:25,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926329492] [2024-11-20 18:17:25,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926329492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:17:25,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:17:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 18:17:25,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632833553] [2024-11-20 18:17:25,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:17:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 18:17:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:17:25,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 18:17:25,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 18:17:25,652 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 18 states have internal predecessors, (21), 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 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:17:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:17:25,691 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-20 18:17:25,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 18:17:25,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 18:17:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:17:25,701 INFO L225 Difference]: With dead ends: 25 [2024-11-20 18:17:25,701 INFO L226 Difference]: Without dead ends: 18 [2024-11-20 18:17:25,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 18:17:25,711 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 18:17:25,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 18:17:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-20 18:17:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-20 18:17:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 18:17:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-20 18:17:25,748 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 7 [2024-11-20 18:17:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:17:25,748 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-20 18:17:25,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:17:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-20 18:17:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 18:17:25,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:17:25,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:17:25,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 18:17:25,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:17:25,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:17:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2135772490, now seen corresponding path program 1 times [2024-11-20 18:17:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:17:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442684318] [2024-11-20 18:17:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:17:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:17:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:17:25,928 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-20 18:17:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:17:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442684318] [2024-11-20 18:17:25,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442684318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:17:25,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:17:25,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 18:17:25,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566793431] [2024-11-20 18:17:25,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:17:25,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 18:17:25,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:17:25,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 18:17:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 18:17:25,933 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:17:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:17:26,037 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-20 18:17:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 18:17:26,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-20 18:17:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:17:26,039 INFO L225 Difference]: With dead ends: 28 [2024-11-20 18:17:26,040 INFO L226 Difference]: Without dead ends: 27 [2024-11-20 18:17:26,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 18:17:26,043 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:17:26,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:17:26,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-20 18:17:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2024-11-20 18:17:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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-20 18:17:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-20 18:17:26,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 8 [2024-11-20 18:17:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:17:26,056 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-20 18:17:26,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:17:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-20 18:17:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 18:17:26,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:17:26,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:17:26,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 18:17:26,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:17:26,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:17:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash 516260624, now seen corresponding path program 1 times [2024-11-20 18:17:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:17:26,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941211863] [2024-11-20 18:17:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:17:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:17:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:17:26,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 18:17:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:17:26,138 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-20 18:17:26,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:17:26,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941211863] [2024-11-20 18:17:26,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941211863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:17:26,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:17:26,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 18:17:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947205436] [2024-11-20 18:17:26,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:17:26,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 18:17:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:17:26,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 18:17:26,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 18:17:26,142 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-20 18:17:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:17:26,186 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-11-20 18:17:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 18:17:26,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-11-20 18:17:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:17:26,189 INFO L225 Difference]: With dead ends: 17 [2024-11-20 18:17:26,189 INFO L226 Difference]: Without dead ends: 16 [2024-11-20 18:17:26,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 18:17:26,191 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 18:17:26,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 18:17:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-20 18:17:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-20 18:17:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-20 18:17:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-20 18:17:26,199 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2024-11-20 18:17:26,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:17:26,202 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-20 18:17:26,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-20 18:17:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-20 18:17:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 18:17:26,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:17:26,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:17:26,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 18:17:26,206 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:17:26,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:17:26,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1175789781, now seen corresponding path program 1 times [2024-11-20 18:17:26,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:17:26,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013895859] [2024-11-20 18:17:26,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:17:26,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:17:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:17:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 18:17:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:17:26,425 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-20 18:17:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:17:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013895859] [2024-11-20 18:17:26,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013895859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:17:26,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:17:26,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 18:17:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007402399] [2024-11-20 18:17:26,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:17:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 18:17:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:17:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 18:17:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 18:17:26,429 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-20 18:17:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:17:26,526 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-11-20 18:17:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 18:17:26,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-20 18:17:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:17:26,528 INFO L225 Difference]: With dead ends: 22 [2024-11-20 18:17:26,528 INFO L226 Difference]: Without dead ends: 21 [2024-11-20 18:17:26,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 18:17:26,529 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:17:26,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:17:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-20 18:17:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-20 18:17:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 18:17:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-20 18:17:26,542 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2024-11-20 18:17:26,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:17:26,543 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-20 18:17:26,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-20 18:17:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-20 18:17:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 18:17:26,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:17:26,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:17:26,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 18:17:26,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:17:26,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:17:26,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1847368419, now seen corresponding path program 1 times [2024-11-20 18:17:26,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:17:26,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725971320] [2024-11-20 18:17:26,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:17:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:17:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:17:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 18:17:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:17:26,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 18:17:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:17:26,779 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-20 18:17:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:17:26,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725971320] [2024-11-20 18:17:26,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725971320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:17:26,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:17:26,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 18:17:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119790711] [2024-11-20 18:17:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:17:26,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 18:17:26,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:17:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 18:17:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 18:17:26,782 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-20 18:17:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:17:26,882 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-20 18:17:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 18:17:26,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 19 [2024-11-20 18:17:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:17:26,883 INFO L225 Difference]: With dead ends: 21 [2024-11-20 18:17:26,883 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 18:17:26,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 18:17:26,885 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:17:26,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:17:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 18:17:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 18:17:26,890 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-20 18:17:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 18:17:26,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-11-20 18:17:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:17:26,890 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 18:17:26,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-20 18:17:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 18:17:26,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 18:17:26,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-20 18:17:26,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-20 18:17:26,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-20 18:17:26,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-20 18:17:26,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 18:17:26,901 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 18:17:26,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 18:17:26,970 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 18:17:26,999 WARN L156 FloydHoareUtils]: Requires clause for rec contained old-variable. Original clause: (and (= |#memory_int#0| |old(#memory_int#0)|) (<= (select (select |old(#memory_int#0)| |rec_#in~p.base|) |rec_#in~p.offset|) 2147483647) (= |old(#valid)| |#valid|)) Eliminated clause: (<= (select (select |#memory_int#0| |rec_#in~p.base|) |rec_#in~p.offset|) 2147483647) [2024-11-20 18:17:27,003 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-20 18:17:27,004 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-20 18:17:27,004 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-11-20 18:17:27,005 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-20 18:17:27,005 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]] [2024-11-20 18:17:27,005 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-20 18:17:27,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:17:27 BoogieIcfgContainer [2024-11-20 18:17:27,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 18:17:27,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 18:17:27,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 18:17:27,009 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 18:17:27,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:17:24" (3/4) ... [2024-11-20 18:17:27,012 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 18:17:27,015 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec [2024-11-20 18:17:27,018 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-20 18:17:27,018 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 18:17:27,018 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-20 18:17:27,018 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 18:17:27,099 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 18:17:27,099 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 18:17:27,099 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 18:17:27,100 INFO L158 Benchmark]: Toolchain (without parser) took 2759.58ms. Allocated memory is still 188.7MB. Free memory was 156.5MB in the beginning and 139.4MB in the end (delta: 17.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-20 18:17:27,100 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory was 92.9MB in the beginning and 92.7MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 18:17:27,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.27ms. Allocated memory is still 188.7MB. Free memory was 155.4MB in the beginning and 143.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 18:17:27,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.02ms. Allocated memory is still 188.7MB. Free memory was 143.9MB in the beginning and 142.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 18:17:27,101 INFO L158 Benchmark]: Boogie Preprocessor took 49.60ms. Allocated memory is still 188.7MB. Free memory was 142.8MB in the beginning and 140.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 18:17:27,102 INFO L158 Benchmark]: RCFGBuilder took 287.56ms. Allocated memory is still 188.7MB. Free memory was 140.7MB in the beginning and 129.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 18:17:27,102 INFO L158 Benchmark]: TraceAbstraction took 2033.35ms. Allocated memory is still 188.7MB. Free memory was 129.2MB in the beginning and 143.6MB in the end (delta: -14.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 18:17:27,102 INFO L158 Benchmark]: Witness Printer took 90.61ms. Allocated memory is still 188.7MB. Free memory was 143.6MB in the beginning and 139.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 18:17:27,103 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.17ms. Allocated memory is still 119.5MB. Free memory was 92.9MB in the beginning and 92.7MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.27ms. Allocated memory is still 188.7MB. Free memory was 155.4MB in the beginning and 143.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.02ms. Allocated memory is still 188.7MB. Free memory was 143.9MB in the beginning and 142.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.60ms. Allocated memory is still 188.7MB. Free memory was 142.8MB in the beginning and 140.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 287.56ms. Allocated memory is still 188.7MB. Free memory was 140.7MB in the beginning and 129.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2033.35ms. Allocated memory is still 188.7MB. Free memory was 129.2MB in the beginning and 143.6MB in the end (delta: -14.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 90.61ms. Allocated memory is still 188.7MB. Free memory was 143.6MB in the beginning and 139.4MB in the end (delta: 4.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: 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: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: 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, 22 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 61 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 185 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4/4 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: 20]: Loop Invariant Derived loop invariant: (i <= 2147483647) - ProcedureContractResult [Line: 8]: Procedure Contract for rec Derived contract for procedure rec. Ensures: (((long) \result + 1) <= 0) RESULT: Ultimate proved your program to be correct! [2024-11-20 18:17:27,123 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