./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 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/recursified_loop-simple/recursified_nested_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 20:43:11,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:43:11,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 20:43:11,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:43:11,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:43:11,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:43:11,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:43:11,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:43:11,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:43:11,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:43:11,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:43:11,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:43:11,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:43:11,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:43:11,809 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:43:11,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:43:11,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:43:11,813 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:43:11,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 20:43:11,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:43:11,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:43:11,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:43:11,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:43:11,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:43:11,815 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:43:11,815 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:43:11,815 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:43:11,819 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:43:11,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:43:11,820 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:43:11,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:43:11,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:43:11,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:43:11,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:43:11,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:43:11,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:43:11,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:43:11,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:43:11,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 20:43:11,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 20:43:11,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:43:11,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:43:11,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:43:11,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:43:11,824 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2024-10-24 20:43:12,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:43:12,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:43:12,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:43:12,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:43:12,099 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:43:12,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-10-24 20:43:13,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:43:13,776 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:43:13,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-10-24 20:43:13,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3199c8ac5/61c2d5f98f9547f8819c1af3c799de79/FLAG9948ab093 [2024-10-24 20:43:14,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3199c8ac5/61c2d5f98f9547f8819c1af3c799de79 [2024-10-24 20:43:14,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:43:14,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:43:14,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:43:14,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:43:14,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:43:14,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a171d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14, skipping insertion in model container [2024-10-24 20:43:14,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:43:14,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:43:14,372 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:43:14,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:43:14,403 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:43:14,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14 WrapperNode [2024-10-24 20:43:14,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:43:14,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:43:14,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:43:14,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:43:14,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,435 INFO L138 Inliner]: procedures = 13, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-10-24 20:43:14,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:43:14,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:43:14,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:43:14,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:43:14,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,458 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2024-10-24 20:43:14,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:43:14,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:43:14,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:43:14,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:43:14,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (1/1) ... [2024-10-24 20:43:14,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:43:14,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:43:14,516 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-10-24 20:43:14,520 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-10-24 20:43:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:43:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 20:43:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 20:43:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 20:43:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 20:43:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 20:43:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 20:43:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 20:43:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-10-24 20:43:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-10-24 20:43:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:43:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:43:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 20:43:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 20:43:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 20:43:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-10-24 20:43:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-10-24 20:43:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 20:43:14,649 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:43:14,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 20:43:14,787 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 20:43:14,788 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 20:43:14,819 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 20:43:14,819 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 20:43:14,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:43:14 BoogieIcfgContainer [2024-10-24 20:43:14,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 20:43:14,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 20:43:14,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 20:43:14,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 20:43:14,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:43:14" (1/3) ... [2024-10-24 20:43:14,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2222f090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:43:14, skipping insertion in model container [2024-10-24 20:43:14,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:43:14" (2/3) ... [2024-10-24 20:43:14,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2222f090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:43:14, skipping insertion in model container [2024-10-24 20:43:14,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:43:14" (3/3) ... [2024-10-24 20:43:14,831 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-10-24 20:43:14,847 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 20:43:14,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-24 20:43:14,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 20:43:14,913 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;@5cc18053, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 20:43:14,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 20:43:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.5) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 20:43:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 20:43:14,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:43:14,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:43:14,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-24 20:43:14,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:43:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash -488469868, now seen corresponding path program 1 times [2024-10-24 20:43:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:43:14,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297332005] [2024-10-24 20:43:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:43:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:43:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:43:15,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:43:15,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297332005] [2024-10-24 20:43:15,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297332005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:43:15,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:43:15,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 20:43:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595837581] [2024-10-24 20:43:15,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:43:15,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:43:15,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:43:15,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:43:15,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 20:43:15,473 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.5) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:43:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:43:15,591 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2024-10-24 20:43:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:43:15,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-24 20:43:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:43:15,602 INFO L225 Difference]: With dead ends: 57 [2024-10-24 20:43:15,602 INFO L226 Difference]: Without dead ends: 25 [2024-10-24 20:43:15,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:43:15,609 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:43:15,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:43:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-24 20:43:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-10-24 20:43:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:43:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-10-24 20:43:15,647 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 8 [2024-10-24 20:43:15,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:43:15,647 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-10-24 20:43:15,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:43:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-10-24 20:43:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 20:43:15,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:43:15,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:43:15,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 20:43:15,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-24 20:43:15,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:43:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2037303351, now seen corresponding path program 1 times [2024-10-24 20:43:15,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:43:15,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175968272] [2024-10-24 20:43:15,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:43:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:43:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:43:15,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:43:15,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175968272] [2024-10-24 20:43:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175968272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:43:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:43:15,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:43:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699708767] [2024-10-24 20:43:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:43:15,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:43:15,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:43:15,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:43:15,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:43:15,807 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:43:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:43:15,836 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-10-24 20:43:15,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:43:15,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 20:43:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:43:15,838 INFO L225 Difference]: With dead ends: 23 [2024-10-24 20:43:15,839 INFO L226 Difference]: Without dead ends: 22 [2024-10-24 20:43:15,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-24 20:43:15,841 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:43:15,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:43:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-24 20:43:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-24 20:43:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:43:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-24 20:43:15,847 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2024-10-24 20:43:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:43:15,848 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-24 20:43:15,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:43:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-24 20:43:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 20:43:15,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:43:15,849 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:43:15,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 20:43:15,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-24 20:43:15,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:43:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 402286886, now seen corresponding path program 1 times [2024-10-24 20:43:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:43:15,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006052513] [2024-10-24 20:43:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:43:15,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:43:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:43:16,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:43:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006052513] [2024-10-24 20:43:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006052513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:43:16,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:43:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 20:43:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352957510] [2024-10-24 20:43:16,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:43:16,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:43:16,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:43:16,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:43:16,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:43:16,114 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:43:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:43:16,229 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-10-24 20:43:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 20:43:16,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 20:43:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:43:16,233 INFO L225 Difference]: With dead ends: 28 [2024-10-24 20:43:16,234 INFO L226 Difference]: Without dead ends: 27 [2024-10-24 20:43:16,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:43:16,236 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:43:16,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:43:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-24 20:43:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2024-10-24 20:43:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:43:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-24 20:43:16,252 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2024-10-24 20:43:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:43:16,252 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-24 20:43:16,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:43:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-24 20:43:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 20:43:16,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:43:16,254 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:43:16,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 20:43:16,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-24 20:43:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:43:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash -986541066, now seen corresponding path program 1 times [2024-10-24 20:43:16,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:43:16,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042133828] [2024-10-24 20:43:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:43:16,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:43:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:16,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 20:43:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:16,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 20:43:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:43:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:43:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042133828] [2024-10-24 20:43:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042133828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:43:16,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:43:16,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 20:43:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076873279] [2024-10-24 20:43:16,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:43:16,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:43:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:43:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:43:16,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:43:16,415 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:43:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:43:16,536 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-10-24 20:43:16,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 20:43:16,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-24 20:43:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:43:16,538 INFO L225 Difference]: With dead ends: 30 [2024-10-24 20:43:16,538 INFO L226 Difference]: Without dead ends: 28 [2024-10-24 20:43:16,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:43:16,539 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:43:16,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:43:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-24 20:43:16,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-24 20:43:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 20:43:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-24 20:43:16,551 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2024-10-24 20:43:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:43:16,552 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-24 20:43:16,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:43:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-24 20:43:16,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 20:43:16,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:43:16,554 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-24 20:43:16,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 20:43:16,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-24 20:43:16,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:43:16,556 INFO L85 PathProgramCache]: Analyzing trace with hash -739348388, now seen corresponding path program 1 times [2024-10-24 20:43:16,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:43:16,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728493229] [2024-10-24 20:43:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:43:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:43:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:16,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 20:43:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 20:43:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:16,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 20:43:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:16,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 20:43:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-24 20:43:16,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:43:16,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728493229] [2024-10-24 20:43:16,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728493229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:43:16,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65773222] [2024-10-24 20:43:16,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:43:16,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:43:16,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:43:16,983 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-10-24 20:43:16,986 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-10-24 20:43:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:17,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 20:43:17,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:43:17,162 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-10-24 20:43:17,321 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 17 treesize of output 9 [2024-10-24 20:43:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:43:17,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:43:17,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65773222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:43:17,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:43:17,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2024-10-24 20:43:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596466360] [2024-10-24 20:43:17,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:43:17,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:43:17,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:43:17,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:43:17,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-24 20:43:17,348 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 20:43:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:43:17,468 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-10-24 20:43:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 20:43:17,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-10-24 20:43:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:43:17,469 INFO L225 Difference]: With dead ends: 29 [2024-10-24 20:43:17,469 INFO L226 Difference]: Without dead ends: 28 [2024-10-24 20:43:17,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-10-24 20:43:17,470 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 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-10-24 20:43:17,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:43:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-24 20:43:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-24 20:43:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 20:43:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-10-24 20:43:17,481 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 36 [2024-10-24 20:43:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:43:17,482 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-10-24 20:43:17,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 20:43:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-10-24 20:43:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 20:43:17,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:43:17,485 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-24 20:43:17,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 20:43:17,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:43:17,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-24 20:43:17,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:43:17,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1444963509, now seen corresponding path program 1 times [2024-10-24 20:43:17,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:43:17,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050176976] [2024-10-24 20:43:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:43:17,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:43:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:17,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 20:43:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 20:43:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 20:43:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 20:43:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-24 20:43:18,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:43:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050176976] [2024-10-24 20:43:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050176976] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:43:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870833847] [2024-10-24 20:43:18,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:43:18,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:43:18,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:43:18,019 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-10-24 20:43:18,020 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-10-24 20:43:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:43:18,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:43:18,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:43:18,246 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-10-24 20:43:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 20:43:18,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:43:18,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870833847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:43:18,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:43:18,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-10-24 20:43:18,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21490026] [2024-10-24 20:43:18,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:43:18,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:43:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:43:18,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:43:18,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-24 20:43:18,267 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 20:43:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:43:18,342 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-10-24 20:43:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 20:43:18,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-10-24 20:43:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:43:18,344 INFO L225 Difference]: With dead ends: 27 [2024-10-24 20:43:18,344 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 20:43:18,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-24 20:43:18,345 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:43:18,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:43:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 20:43:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 20:43:18,346 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-10-24 20:43:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 20:43:18,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2024-10-24 20:43:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:43:18,347 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 20:43:18,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 20:43:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 20:43:18,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 20:43:18,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-24 20:43:18,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-24 20:43:18,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-24 20:43:18,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-24 20:43:18,367 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-10-24 20:43:18,551 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,SelfDestructingSolverStorable5 [2024-10-24 20:43:18,554 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 20:43:18,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 20:43:18,877 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 20:43:18,889 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_21_0 contained old-variable. Original clause: (let ((.cse1 (select (select |old(#memory_int#1)| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|)) (.cse0 (select (select |#memory_int#1| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|))) (and (<= 0 (+ .cse0 2147483648)) (= |#memory_int#2| |old(#memory_int#2)|) (<= 0 (+ .cse1 2147483648)) (or (not (= .cse1 0)) (= .cse0 0)))) Eliminated clause: (let ((.cse0 (select (select |#memory_int#1| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|))) (and (<= 0 (+ .cse0 2147483648)) (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |old(#memory_int#1)| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|))) (and (<= 0 (+ .cse1 2147483648)) (or (not (= .cse1 0)) (= .cse0 0))))))) [2024-10-24 20:43:18,900 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-24 20:43:18,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-24 20:43:18,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-10-24 20:43:18,902 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:43:18,902 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-24 20:43:18,902 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-10-24 20:43:18,902 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-10-24 20:43:18,908 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_21_0 contained old-variable. Original clause: (and (exists ((v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_2 Int)) (<= 0 (+ 2147483648 (select (select |#memory_int#1| v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_2)))) (<= 0 (+ (select (select |old(#memory_int#2)| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|) 2147483648)) (= |#memory_int#2| |old(#memory_int#2)|) (exists ((v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_3 Int)) (<= (select (select |#memory_int#1| v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_3) 5))) Eliminated clause: (and (exists ((v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_2 Int)) (<= 0 (+ 2147483648 (select (select |#memory_int#1| v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_2)))) (<= 0 (+ (select (select |#memory_int#2| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|) 2147483648)) (exists ((v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_3 Int)) (<= (select (select |#memory_int#1| v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_3) 5))) [2024-10-24 20:43:18,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:43:18,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-24 20:43:18,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-24 20:43:18,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-24 20:43:18,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:43:18,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:43:18,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-24 20:43:18,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-10-24 20:43:18,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-10-24 20:43:18,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:43:18,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:43:18 BoogieIcfgContainer [2024-10-24 20:43:18,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 20:43:18,916 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 20:43:18,916 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 20:43:18,916 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 20:43:18,917 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:43:14" (3/4) ... [2024-10-24 20:43:18,919 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 20:43:18,922 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2024-10-24 20:43:18,923 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2024-10-24 20:43:18,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-24 20:43:18,928 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-24 20:43:18,929 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 20:43:18,929 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 20:43:19,019 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 20:43:19,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 20:43:19,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 20:43:19,021 INFO L158 Benchmark]: Toolchain (without parser) took 4855.89ms. Allocated memory was 180.4MB in the beginning and 260.0MB in the end (delta: 79.7MB). Free memory was 123.6MB in the beginning and 203.5MB in the end (delta: -79.9MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2024-10-24 20:43:19,021 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 180.4MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:43:19,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.95ms. Allocated memory is still 180.4MB. Free memory was 123.2MB in the beginning and 111.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 20:43:19,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.70ms. Allocated memory is still 180.4MB. Free memory was 111.5MB in the beginning and 110.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 20:43:19,022 INFO L158 Benchmark]: Boogie Preprocessor took 38.09ms. Allocated memory is still 180.4MB. Free memory was 110.2MB in the beginning and 108.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 20:43:19,022 INFO L158 Benchmark]: RCFGBuilder took 345.52ms. Allocated memory is still 180.4MB. Free memory was 108.1MB in the beginning and 94.2MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 20:43:19,022 INFO L158 Benchmark]: TraceAbstraction took 4092.61ms. Allocated memory was 180.4MB in the beginning and 260.0MB in the end (delta: 79.7MB). Free memory was 93.4MB in the beginning and 208.8MB in the end (delta: -115.4MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. [2024-10-24 20:43:19,025 INFO L158 Benchmark]: Witness Printer took 104.16ms. Allocated memory is still 260.0MB. Free memory was 208.8MB in the beginning and 203.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:43:19,026 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 180.4MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.95ms. Allocated memory is still 180.4MB. Free memory was 123.2MB in the beginning and 111.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.70ms. Allocated memory is still 180.4MB. Free memory was 111.5MB in the beginning and 110.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.09ms. Allocated memory is still 180.4MB. Free memory was 110.2MB in the beginning and 108.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.52ms. Allocated memory is still 180.4MB. Free memory was 108.1MB in the beginning and 94.2MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4092.61ms. Allocated memory was 180.4MB in the beginning and 260.0MB in the end (delta: 79.7MB). Free memory was 93.4MB in the beginning and 208.8MB in the end (delta: -115.4MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. * Witness Printer took 104.16ms. Allocated memory is still 260.0MB. Free memory was 208.8MB in the beginning and 203.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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!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#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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 3 procedures, 27 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245 IncrementalHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 95 mSDtfsCounter, 245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=4, InterpolantAutomatonStates: 41, 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, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 186 ConstructedInterpolants, 22 QuantifiedInterpolants, 688 SizeOfPredicates, 9 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 126/137 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 RESULT: Ultimate proved your program to be correct! [2024-10-24 20:43:19,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE