./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9c9c032ca120503dfa93615a57a0bb47775014248f579f3a3fd38a4985b2298b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:02:35,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:02:35,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:02:35,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:02:35,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:02:35,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:02:35,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:02:35,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:02:35,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:02:35,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:02:35,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:02:35,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:02:35,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:02:35,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:02:35,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:02:35,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:02:35,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:02:35,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:02:35,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:02:35,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:02:35,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:02:35,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:02:35,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:02:35,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:02:35,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:02:35,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:02:35,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:02:35,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:02:35,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:02:35,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:02:35,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:02:35,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:02:35,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:02:35,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:02:35,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:02:35,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:02:35,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:02:35,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:02:35,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:02:35,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:02:35,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:02:35,763 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:02:35,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:02:35,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:02:35,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:02:35,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:02:35,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:02:35,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:02:35,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:02:35,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:02:35,788 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:02:35,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:02:35,789 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:02:35,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:02:35,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:02:35,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:02:35,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:02:35,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:02:35,790 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:02:35,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:02:35,790 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:02:35,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:02:35,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:02:35,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:02:35,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:02:35,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:35,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:02:35,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:02:35,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:02:35,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:02:35,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:02:35,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:02:35,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c9c032ca120503dfa93615a57a0bb47775014248f579f3a3fd38a4985b2298b [2022-02-21 03:02:35,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:02:36,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:02:36,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:02:36,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:02:36,015 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:02:36,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2022-02-21 03:02:36,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d27ad6d2/c4f483eb089f46d3b8a5f5747309e52d/FLAG481910b84 [2022-02-21 03:02:36,446 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:02:36,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2022-02-21 03:02:36,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d27ad6d2/c4f483eb089f46d3b8a5f5747309e52d/FLAG481910b84 [2022-02-21 03:02:36,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d27ad6d2/c4f483eb089f46d3b8a5f5747309e52d [2022-02-21 03:02:36,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:02:36,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:02:36,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:36,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:02:36,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:02:36,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78386ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36, skipping insertion in model container [2022-02-21 03:02:36,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:02:36,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:02:36,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:36,590 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:02:36,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:36,606 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:02:36,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36 WrapperNode [2022-02-21 03:02:36,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:36,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:36,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:02:36,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:02:36,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,628 INFO L137 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 8 [2022-02-21 03:02:36,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:36,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:02:36,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:02:36,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:02:36,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:02:36,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:02:36,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:02:36,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:02:36,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (1/1) ... [2022-02-21 03:02:36,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:36,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:36,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:02:36,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:02:36,701 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2022-02-21 03:02:36,702 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2022-02-21 03:02:36,702 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2022-02-21 03:02:36,702 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2022-02-21 03:02:36,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:02:36,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:02:36,734 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:02:36,735 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:02:36,916 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:02:36,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:02:36,922 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:02:36,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:36 BoogieIcfgContainer [2022-02-21 03:02:36,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:02:36,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:02:36,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:02:36,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:02:36,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:02:36" (1/3) ... [2022-02-21 03:02:36,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a497dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:36, skipping insertion in model container [2022-02-21 03:02:36,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:36" (2/3) ... [2022-02-21 03:02:36,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a497dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:36, skipping insertion in model container [2022-02-21 03:02:36,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:36" (3/3) ... [2022-02-21 03:02:36,931 INFO L111 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2022-02-21 03:02:36,934 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:02:36,934 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-21 03:02:36,975 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:02:36,982 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:02:36,982 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-21 03:02:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:02:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:02:37,004 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:37,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:37,004 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:37,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:37,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1295673562, now seen corresponding path program 1 times [2022-02-21 03:02:37,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:37,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24246100] [2022-02-21 03:02:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:37,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#true} assume { :begin_inline_ULTIMATE.init } true; {48#true} is VALID [2022-02-21 03:02:37,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {50#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:02:37,196 INFO L272 TraceCheckUtils]: 2: Hoare triple {50#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} call main_#t~ret6#1 := rec2(main_~x~0#1); {51#(<= |rec2_#in~j| 2147483647)} is VALID [2022-02-21 03:02:37,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#(<= |rec2_#in~j| 2147483647)} ~j := #in~j; {52#(<= rec2_~j 2147483647)} is VALID [2022-02-21 03:02:37,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {52#(<= rec2_~j 2147483647)} assume !(~j <= 0); {52#(<= rec2_~j 2147483647)} is VALID [2022-02-21 03:02:37,199 INFO L272 TraceCheckUtils]: 5: Hoare triple {52#(<= rec2_~j 2147483647)} call #t~ret3 := rec1(~j); {53#(<= |rec1_#in~i| 2147483647)} is VALID [2022-02-21 03:02:37,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {53#(<= |rec1_#in~i| 2147483647)} ~i := #in~i; {54#(<= rec1_~i 2147483647)} is VALID [2022-02-21 03:02:37,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {54#(<= rec1_~i 2147483647)} assume !(~i <= 0); {54#(<= rec1_~i 2147483647)} is VALID [2022-02-21 03:02:37,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {54#(<= rec1_~i 2147483647)} assume !(~i - 2 <= 2147483647); {49#false} is VALID [2022-02-21 03:02:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:37,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:37,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24246100] [2022-02-21 03:02:37,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24246100] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:37,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:37,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:02:37,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217128003] [2022-02-21 03:02:37,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:37,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 9 [2022-02-21 03:02:37,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:37,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 03:02:37,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:37,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 03:02:37,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:37,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:02:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:02:37,250 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 03:02:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:37,689 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-02-21 03:02:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:02:37,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 9 [2022-02-21 03:02:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 03:02:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2022-02-21 03:02:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 03:02:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2022-02-21 03:02:37,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 103 transitions. [2022-02-21 03:02:37,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:37,802 INFO L225 Difference]: With dead ends: 87 [2022-02-21 03:02:37,802 INFO L226 Difference]: Without dead ends: 80 [2022-02-21 03:02:37,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:02:37,807 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 65 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:37,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 232 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:02:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-21 03:02:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2022-02-21 03:02:37,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:37,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 67 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 52 states have internal predecessors, (64), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:37,843 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 67 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 52 states have internal predecessors, (64), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:37,844 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 67 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 52 states have internal predecessors, (64), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:37,849 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-02-21 03:02:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-02-21 03:02:37,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:37,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:37,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 52 states have internal predecessors, (64), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-02-21 03:02:37,851 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 52 states have internal predecessors, (64), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-02-21 03:02:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:37,855 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-02-21 03:02:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-02-21 03:02:37,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:37,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:37,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:37,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 52 states have internal predecessors, (64), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-02-21 03:02:37,867 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 9 [2022-02-21 03:02:37,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:37,868 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-02-21 03:02:37,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 03:02:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-02-21 03:02:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:02:37,868 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:37,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:37,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:02:37,869 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1511174720, now seen corresponding path program 1 times [2022-02-21 03:02:37,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:37,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952168007] [2022-02-21 03:02:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:37,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:37,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#true} assume { :begin_inline_ULTIMATE.init } true; {405#true} is VALID [2022-02-21 03:02:37,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {405#true} is VALID [2022-02-21 03:02:37,888 INFO L272 TraceCheckUtils]: 2: Hoare triple {405#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {405#true} is VALID [2022-02-21 03:02:37,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#true} ~j := #in~j; {405#true} is VALID [2022-02-21 03:02:37,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {405#true} assume !(~j <= 0); {405#true} is VALID [2022-02-21 03:02:37,888 INFO L272 TraceCheckUtils]: 5: Hoare triple {405#true} call #t~ret3 := rec1(~j); {405#true} is VALID [2022-02-21 03:02:37,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#true} ~i := #in~i; {405#true} is VALID [2022-02-21 03:02:37,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#true} assume !(~i <= 0); {407#(<= 1 rec1_~i)} is VALID [2022-02-21 03:02:37,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {407#(<= 1 rec1_~i)} assume ~i - 2 <= 2147483647; {407#(<= 1 rec1_~i)} is VALID [2022-02-21 03:02:37,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {407#(<= 1 rec1_~i)} assume !(~i - 2 >= -2147483648); {406#false} is VALID [2022-02-21 03:02:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:37,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:37,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952168007] [2022-02-21 03:02:37,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952168007] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:37,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:37,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:37,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368846086] [2022-02-21 03:02:37,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:37,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2022-02-21 03:02:37,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:37,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-02-21 03:02:37,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:37,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:37,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:37,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:37,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:37,899 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-02-21 03:02:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:37,954 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-02-21 03:02:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:37,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2022-02-21 03:02:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-02-21 03:02:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-02-21 03:02:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-02-21 03:02:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-02-21 03:02:37,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-02-21 03:02:37,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:37,998 INFO L225 Difference]: With dead ends: 71 [2022-02-21 03:02:37,998 INFO L226 Difference]: Without dead ends: 70 [2022-02-21 03:02:37,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:37,999 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:38,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-21 03:02:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2022-02-21 03:02:38,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:38,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 66 states, 43 states have (on average 1.441860465116279) internal successors, (62), 51 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:38,019 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 66 states, 43 states have (on average 1.441860465116279) internal successors, (62), 51 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:38,019 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 66 states, 43 states have (on average 1.441860465116279) internal successors, (62), 51 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,022 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2022-02-21 03:02:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2022-02-21 03:02:38,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 43 states have (on average 1.441860465116279) internal successors, (62), 51 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-02-21 03:02:38,026 INFO L87 Difference]: Start difference. First operand has 66 states, 43 states have (on average 1.441860465116279) internal successors, (62), 51 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-02-21 03:02:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,028 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2022-02-21 03:02:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2022-02-21 03:02:38,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:38,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.441860465116279) internal successors, (62), 51 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2022-02-21 03:02:38,031 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 10 [2022-02-21 03:02:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:38,031 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2022-02-21 03:02:38,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-02-21 03:02:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2022-02-21 03:02:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:02:38,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:38,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:38,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:02:38,032 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:38,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash -540327935, now seen corresponding path program 1 times [2022-02-21 03:02:38,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:38,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018992026] [2022-02-21 03:02:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:02:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {717#true} ~i := #in~i; {717#true} is VALID [2022-02-21 03:02:38,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {717#true} assume ~i <= 0;#res := 0; {717#true} is VALID [2022-02-21 03:02:38,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {717#true} assume true; {717#true} is VALID [2022-02-21 03:02:38,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {717#true} {717#true} #57#return; {717#true} is VALID [2022-02-21 03:02:38,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {717#true} assume { :begin_inline_ULTIMATE.init } true; {717#true} is VALID [2022-02-21 03:02:38,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {717#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {717#true} is VALID [2022-02-21 03:02:38,099 INFO L272 TraceCheckUtils]: 2: Hoare triple {717#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {717#true} is VALID [2022-02-21 03:02:38,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {717#true} ~j := #in~j; {717#true} is VALID [2022-02-21 03:02:38,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {717#true} assume !(~j <= 0); {717#true} is VALID [2022-02-21 03:02:38,100 INFO L272 TraceCheckUtils]: 5: Hoare triple {717#true} call #t~ret3 := rec1(~j); {717#true} is VALID [2022-02-21 03:02:38,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {717#true} ~i := #in~i; {717#true} is VALID [2022-02-21 03:02:38,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#true} assume ~i <= 0;#res := 0; {717#true} is VALID [2022-02-21 03:02:38,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {717#true} assume true; {717#true} is VALID [2022-02-21 03:02:38,100 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {717#true} {717#true} #57#return; {717#true} is VALID [2022-02-21 03:02:38,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {723#(<= |rec2_#t~ret3| 2147483647)} is VALID [2022-02-21 03:02:38,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {723#(<= |rec2_#t~ret3| 2147483647)} assume !(#t~ret3 - 1 <= 2147483647); {718#false} is VALID [2022-02-21 03:02:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:38,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:38,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018992026] [2022-02-21 03:02:38,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018992026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:38,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:38,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:38,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172883852] [2022-02-21 03:02:38,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:38,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-21 03:02:38,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:38,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:38,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:38,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:38,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:38,110 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,158 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2022-02-21 03:02:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:38,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-21 03:02:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-21 03:02:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-21 03:02:38,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-02-21 03:02:38,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,192 INFO L225 Difference]: With dead ends: 66 [2022-02-21 03:02:38,192 INFO L226 Difference]: Without dead ends: 65 [2022-02-21 03:02:38,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:38,193 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:38,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-21 03:02:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-02-21 03:02:38,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:38,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:38,218 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:38,218 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,227 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2022-02-21 03:02:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2022-02-21 03:02:38,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 65 states. [2022-02-21 03:02:38,228 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 65 states. [2022-02-21 03:02:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,243 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2022-02-21 03:02:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2022-02-21 03:02:38,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:38,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2022-02-21 03:02:38,246 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 12 [2022-02-21 03:02:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:38,246 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-02-21 03:02:38,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2022-02-21 03:02:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:02:38,246 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:38,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:38,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:02:38,247 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:38,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:38,247 INFO L85 PathProgramCache]: Analyzing trace with hash 429703263, now seen corresponding path program 1 times [2022-02-21 03:02:38,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:38,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209131435] [2022-02-21 03:02:38,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:02:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {1017#true} ~i := #in~i; {1017#true} is VALID [2022-02-21 03:02:38,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1017#true} assume ~i <= 0;#res := 0; {1024#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {1024#(<= 0 |rec1_#res|)} assume true; {1024#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1024#(<= 0 |rec1_#res|)} {1017#true} #57#return; {1023#(<= 0 |rec2_#t~ret3|)} is VALID [2022-02-21 03:02:38,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {1017#true} assume { :begin_inline_ULTIMATE.init } true; {1017#true} is VALID [2022-02-21 03:02:38,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {1017#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1017#true} is VALID [2022-02-21 03:02:38,312 INFO L272 TraceCheckUtils]: 2: Hoare triple {1017#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {1017#true} is VALID [2022-02-21 03:02:38,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {1017#true} ~j := #in~j; {1017#true} is VALID [2022-02-21 03:02:38,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {1017#true} assume !(~j <= 0); {1017#true} is VALID [2022-02-21 03:02:38,313 INFO L272 TraceCheckUtils]: 5: Hoare triple {1017#true} call #t~ret3 := rec1(~j); {1017#true} is VALID [2022-02-21 03:02:38,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {1017#true} ~i := #in~i; {1017#true} is VALID [2022-02-21 03:02:38,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#true} assume ~i <= 0;#res := 0; {1024#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#(<= 0 |rec1_#res|)} assume true; {1024#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,314 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1024#(<= 0 |rec1_#res|)} {1017#true} #57#return; {1023#(<= 0 |rec2_#t~ret3|)} is VALID [2022-02-21 03:02:38,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {1023#(<= 0 |rec2_#t~ret3|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1023#(<= 0 |rec2_#t~ret3|)} is VALID [2022-02-21 03:02:38,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {1023#(<= 0 |rec2_#t~ret3|)} assume #t~ret3 - 1 <= 2147483647; {1023#(<= 0 |rec2_#t~ret3|)} is VALID [2022-02-21 03:02:38,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {1023#(<= 0 |rec2_#t~ret3|)} assume !(#t~ret3 - 1 >= -2147483648); {1018#false} is VALID [2022-02-21 03:02:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:38,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:38,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209131435] [2022-02-21 03:02:38,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209131435] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:38,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:38,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:02:38,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52626374] [2022-02-21 03:02:38,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:38,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-21 03:02:38,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:38,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:02:38,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:02:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:38,330 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,406 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-02-21 03:02:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:02:38,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-21 03:02:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-02-21 03:02:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-02-21 03:02:38,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2022-02-21 03:02:38,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,452 INFO L225 Difference]: With dead ends: 86 [2022-02-21 03:02:38,452 INFO L226 Difference]: Without dead ends: 85 [2022-02-21 03:02:38,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:38,460 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:38,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 121 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-21 03:02:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2022-02-21 03:02:38,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:38,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 75 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 58 states have internal predecessors, (68), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,489 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 75 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 58 states have internal predecessors, (68), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,490 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 75 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 58 states have internal predecessors, (68), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,494 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2022-02-21 03:02:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2022-02-21 03:02:38,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 58 states have internal predecessors, (68), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Second operand 85 states. [2022-02-21 03:02:38,498 INFO L87 Difference]: Start difference. First operand has 75 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 58 states have internal predecessors, (68), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Second operand 85 states. [2022-02-21 03:02:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,501 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2022-02-21 03:02:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2022-02-21 03:02:38,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:38,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 58 states have internal predecessors, (68), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2022-02-21 03:02:38,506 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 13 [2022-02-21 03:02:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:38,506 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2022-02-21 03:02:38,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2022-02-21 03:02:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:02:38,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:38,507 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:38,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:02:38,507 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:38,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1511918191, now seen corresponding path program 1 times [2022-02-21 03:02:38,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:38,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559169636] [2022-02-21 03:02:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {1390#true} ~i := #in~i; {1390#true} is VALID [2022-02-21 03:02:38,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#true} assume ~i <= 0;#res := 0; {1390#true} is VALID [2022-02-21 03:02:38,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-02-21 03:02:38,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #51#return; {1390#true} is VALID [2022-02-21 03:02:38,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {1390#true} assume { :begin_inline_ULTIMATE.init } true; {1390#true} is VALID [2022-02-21 03:02:38,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1390#true} is VALID [2022-02-21 03:02:38,541 INFO L272 TraceCheckUtils]: 2: Hoare triple {1390#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {1390#true} is VALID [2022-02-21 03:02:38,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {1390#true} ~j := #in~j; {1390#true} is VALID [2022-02-21 03:02:38,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {1390#true} assume !(~j <= 0); {1390#true} is VALID [2022-02-21 03:02:38,541 INFO L272 TraceCheckUtils]: 5: Hoare triple {1390#true} call #t~ret3 := rec1(~j); {1390#true} is VALID [2022-02-21 03:02:38,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {1390#true} ~i := #in~i; {1390#true} is VALID [2022-02-21 03:02:38,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {1390#true} assume !(~i <= 0); {1390#true} is VALID [2022-02-21 03:02:38,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {1390#true} assume ~i - 2 <= 2147483647; {1390#true} is VALID [2022-02-21 03:02:38,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} assume ~i - 2 >= -2147483648; {1390#true} is VALID [2022-02-21 03:02:38,542 INFO L272 TraceCheckUtils]: 10: Hoare triple {1390#true} call #t~ret0 := rec1(~i - 2); {1390#true} is VALID [2022-02-21 03:02:38,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} ~i := #in~i; {1390#true} is VALID [2022-02-21 03:02:38,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {1390#true} assume ~i <= 0;#res := 0; {1390#true} is VALID [2022-02-21 03:02:38,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-02-21 03:02:38,543 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1390#true} {1390#true} #51#return; {1390#true} is VALID [2022-02-21 03:02:38,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1396#(<= |rec1_#t~ret0| 2147483647)} is VALID [2022-02-21 03:02:38,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {1396#(<= |rec1_#t~ret0| 2147483647)} assume !(#t~ret0 - 1 <= 2147483647); {1391#false} is VALID [2022-02-21 03:02:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:38,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:38,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559169636] [2022-02-21 03:02:38,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559169636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:38,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:38,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:38,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150467620] [2022-02-21 03:02:38,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:38,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-21 03:02:38,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:38,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:38,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:38,554 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,617 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2022-02-21 03:02:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:38,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-21 03:02:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-21 03:02:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-21 03:02:38,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2022-02-21 03:02:38,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,646 INFO L225 Difference]: With dead ends: 75 [2022-02-21 03:02:38,646 INFO L226 Difference]: Without dead ends: 74 [2022-02-21 03:02:38,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:38,647 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:38,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 71 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-21 03:02:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-02-21 03:02:38,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:38,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,664 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,665 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,667 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2022-02-21 03:02:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2022-02-21 03:02:38,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Second operand 74 states. [2022-02-21 03:02:38,669 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Second operand 74 states. [2022-02-21 03:02:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,671 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2022-02-21 03:02:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2022-02-21 03:02:38,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:38,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2022-02-21 03:02:38,674 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 17 [2022-02-21 03:02:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:38,674 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2022-02-21 03:02:38,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2022-02-21 03:02:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:02:38,675 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:38,676 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:38,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:02:38,676 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:38,676 INFO L85 PathProgramCache]: Analyzing trace with hash 375176379, now seen corresponding path program 1 times [2022-02-21 03:02:38,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:38,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086630147] [2022-02-21 03:02:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:38,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {1726#true} ~i := #in~i; {1726#true} is VALID [2022-02-21 03:02:38,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {1726#true} assume ~i <= 0;#res := 0; {1733#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {1733#(<= 0 |rec1_#res|)} assume true; {1733#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1733#(<= 0 |rec1_#res|)} {1726#true} #51#return; {1732#(<= 0 |rec1_#t~ret0|)} is VALID [2022-02-21 03:02:38,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {1726#true} assume { :begin_inline_ULTIMATE.init } true; {1726#true} is VALID [2022-02-21 03:02:38,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {1726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1726#true} is VALID [2022-02-21 03:02:38,705 INFO L272 TraceCheckUtils]: 2: Hoare triple {1726#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {1726#true} is VALID [2022-02-21 03:02:38,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {1726#true} ~j := #in~j; {1726#true} is VALID [2022-02-21 03:02:38,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {1726#true} assume !(~j <= 0); {1726#true} is VALID [2022-02-21 03:02:38,706 INFO L272 TraceCheckUtils]: 5: Hoare triple {1726#true} call #t~ret3 := rec1(~j); {1726#true} is VALID [2022-02-21 03:02:38,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {1726#true} ~i := #in~i; {1726#true} is VALID [2022-02-21 03:02:38,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {1726#true} assume !(~i <= 0); {1726#true} is VALID [2022-02-21 03:02:38,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {1726#true} assume ~i - 2 <= 2147483647; {1726#true} is VALID [2022-02-21 03:02:38,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {1726#true} assume ~i - 2 >= -2147483648; {1726#true} is VALID [2022-02-21 03:02:38,707 INFO L272 TraceCheckUtils]: 10: Hoare triple {1726#true} call #t~ret0 := rec1(~i - 2); {1726#true} is VALID [2022-02-21 03:02:38,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {1726#true} ~i := #in~i; {1726#true} is VALID [2022-02-21 03:02:38,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {1726#true} assume ~i <= 0;#res := 0; {1733#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {1733#(<= 0 |rec1_#res|)} assume true; {1733#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:38,709 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1733#(<= 0 |rec1_#res|)} {1726#true} #51#return; {1732#(<= 0 |rec1_#t~ret0|)} is VALID [2022-02-21 03:02:38,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {1732#(<= 0 |rec1_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1732#(<= 0 |rec1_#t~ret0|)} is VALID [2022-02-21 03:02:38,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {1732#(<= 0 |rec1_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {1732#(<= 0 |rec1_#t~ret0|)} is VALID [2022-02-21 03:02:38,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {1732#(<= 0 |rec1_#t~ret0|)} assume !(#t~ret0 - 1 >= -2147483648); {1727#false} is VALID [2022-02-21 03:02:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:38,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:38,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086630147] [2022-02-21 03:02:38,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086630147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:38,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:38,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:02:38,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539747617] [2022-02-21 03:02:38,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-21 03:02:38,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:38,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:02:38,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:38,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:02:38,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:38,727 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,802 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2022-02-21 03:02:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:02:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-21 03:02:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-02-21 03:02:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-02-21 03:02:38,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-02-21 03:02:38,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,842 INFO L225 Difference]: With dead ends: 95 [2022-02-21 03:02:38,842 INFO L226 Difference]: Without dead ends: 94 [2022-02-21 03:02:38,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:38,843 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:38,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 120 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:38,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-21 03:02:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2022-02-21 03:02:38,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:38,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,865 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,866 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,869 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2022-02-21 03:02:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2022-02-21 03:02:38,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) Second operand 94 states. [2022-02-21 03:02:38,870 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) Second operand 94 states. [2022-02-21 03:02:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,873 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2022-02-21 03:02:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2022-02-21 03:02:38,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:38,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:02:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2022-02-21 03:02:38,876 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 18 [2022-02-21 03:02:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:38,877 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2022-02-21 03:02:38,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2022-02-21 03:02:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 03:02:38,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:38,877 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:38,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:02:38,878 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash 465426087, now seen corresponding path program 1 times [2022-02-21 03:02:38,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:38,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831844133] [2022-02-21 03:02:38,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:38,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:02:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {2133#true} ~i := #in~i; {2140#(= |rec1_#in~i| rec1_~i)} is VALID [2022-02-21 03:02:38,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {2140#(= |rec1_#in~i| rec1_~i)} assume ~i <= 0;#res := 0; {2141#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:02:38,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {2141#(<= |rec1_#in~i| 0)} assume true; {2141#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:02:38,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2141#(<= |rec1_#in~i| 0)} {2135#(<= 1 rec2_~j)} #57#return; {2134#false} is VALID [2022-02-21 03:02:38,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {2133#true} assume { :begin_inline_ULTIMATE.init } true; {2133#true} is VALID [2022-02-21 03:02:38,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {2133#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2133#true} is VALID [2022-02-21 03:02:38,928 INFO L272 TraceCheckUtils]: 2: Hoare triple {2133#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {2133#true} is VALID [2022-02-21 03:02:38,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {2133#true} ~j := #in~j; {2133#true} is VALID [2022-02-21 03:02:38,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {2133#true} assume !(~j <= 0); {2135#(<= 1 rec2_~j)} is VALID [2022-02-21 03:02:38,929 INFO L272 TraceCheckUtils]: 5: Hoare triple {2135#(<= 1 rec2_~j)} call #t~ret3 := rec1(~j); {2133#true} is VALID [2022-02-21 03:02:38,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#true} ~i := #in~i; {2140#(= |rec1_#in~i| rec1_~i)} is VALID [2022-02-21 03:02:38,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {2140#(= |rec1_#in~i| rec1_~i)} assume ~i <= 0;#res := 0; {2141#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:02:38,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {2141#(<= |rec1_#in~i| 0)} assume true; {2141#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:02:38,930 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2141#(<= |rec1_#in~i| 0)} {2135#(<= 1 rec2_~j)} #57#return; {2134#false} is VALID [2022-02-21 03:02:38,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {2134#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2134#false} is VALID [2022-02-21 03:02:38,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {2134#false} assume #t~ret3 - 1 <= 2147483647; {2134#false} is VALID [2022-02-21 03:02:38,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {2134#false} assume #t~ret3 - 1 >= -2147483648; {2134#false} is VALID [2022-02-21 03:02:38,931 INFO L272 TraceCheckUtils]: 13: Hoare triple {2134#false} call #t~ret4 := rec2(#t~ret3 - 1); {2134#false} is VALID [2022-02-21 03:02:38,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {2134#false} ~j := #in~j; {2134#false} is VALID [2022-02-21 03:02:38,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {2134#false} assume !(~j <= 0); {2134#false} is VALID [2022-02-21 03:02:38,931 INFO L272 TraceCheckUtils]: 16: Hoare triple {2134#false} call #t~ret3 := rec1(~j); {2134#false} is VALID [2022-02-21 03:02:38,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {2134#false} ~i := #in~i; {2134#false} is VALID [2022-02-21 03:02:38,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {2134#false} assume !(~i <= 0); {2134#false} is VALID [2022-02-21 03:02:38,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {2134#false} assume !(~i - 2 <= 2147483647); {2134#false} is VALID [2022-02-21 03:02:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:38,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:38,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831844133] [2022-02-21 03:02:38,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831844133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:38,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:38,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:02:38,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607624550] [2022-02-21 03:02:38,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:38,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-21 03:02:38,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:38,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:38,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:38,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:38,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:38,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:38,945 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,062 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2022-02-21 03:02:39,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:02:39,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-21 03:02:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-02-21 03:02:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-02-21 03:02:39,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 91 transitions. [2022-02-21 03:02:39,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:39,127 INFO L225 Difference]: With dead ends: 126 [2022-02-21 03:02:39,127 INFO L226 Difference]: Without dead ends: 76 [2022-02-21 03:02:39,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:39,128 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:39,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-21 03:02:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-02-21 03:02:39,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:39,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 03:02:39,161 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 03:02:39,162 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 03:02:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,168 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-02-21 03:02:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-02-21 03:02:39,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:39,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) Second operand 76 states. [2022-02-21 03:02:39,169 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) Second operand 76 states. [2022-02-21 03:02:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,176 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-02-21 03:02:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-02-21 03:02:39,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:39,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:39,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 03:02:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-02-21 03:02:39,187 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 20 [2022-02-21 03:02:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:39,188 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-02-21 03:02:39,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-02-21 03:02:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 03:02:39,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:39,189 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:39,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:02:39,190 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:39,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash -334519671, now seen corresponding path program 1 times [2022-02-21 03:02:39,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:39,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566327019] [2022-02-21 03:02:39,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:39,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {2536#true} ~i := #in~i; {2536#true} is VALID [2022-02-21 03:02:39,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#true} assume ~i <= 0;#res := 0; {2545#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:39,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {2545#(<= |rec1_#res| 0)} assume true; {2545#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:39,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2545#(<= |rec1_#res| 0)} {2536#true} #51#return; {2542#(<= |rec1_#t~ret0| 0)} is VALID [2022-02-21 03:02:39,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {2536#true} assume { :begin_inline_ULTIMATE.init } true; {2536#true} is VALID [2022-02-21 03:02:39,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2536#true} is VALID [2022-02-21 03:02:39,255 INFO L272 TraceCheckUtils]: 2: Hoare triple {2536#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {2536#true} is VALID [2022-02-21 03:02:39,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {2536#true} ~j := #in~j; {2536#true} is VALID [2022-02-21 03:02:39,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {2536#true} assume !(~j <= 0); {2536#true} is VALID [2022-02-21 03:02:39,256 INFO L272 TraceCheckUtils]: 5: Hoare triple {2536#true} call #t~ret3 := rec1(~j); {2536#true} is VALID [2022-02-21 03:02:39,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {2536#true} ~i := #in~i; {2536#true} is VALID [2022-02-21 03:02:39,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} assume !(~i <= 0); {2536#true} is VALID [2022-02-21 03:02:39,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume ~i - 2 <= 2147483647; {2536#true} is VALID [2022-02-21 03:02:39,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume ~i - 2 >= -2147483648; {2536#true} is VALID [2022-02-21 03:02:39,256 INFO L272 TraceCheckUtils]: 10: Hoare triple {2536#true} call #t~ret0 := rec1(~i - 2); {2536#true} is VALID [2022-02-21 03:02:39,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~i := #in~i; {2536#true} is VALID [2022-02-21 03:02:39,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {2536#true} assume ~i <= 0;#res := 0; {2545#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:39,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {2545#(<= |rec1_#res| 0)} assume true; {2545#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:39,258 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2545#(<= |rec1_#res| 0)} {2536#true} #51#return; {2542#(<= |rec1_#t~ret0| 0)} is VALID [2022-02-21 03:02:39,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {2542#(<= |rec1_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2542#(<= |rec1_#t~ret0| 0)} is VALID [2022-02-21 03:02:39,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {2542#(<= |rec1_#t~ret0| 0)} assume #t~ret0 - 1 <= 2147483647; {2542#(<= |rec1_#t~ret0| 0)} is VALID [2022-02-21 03:02:39,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {2542#(<= |rec1_#t~ret0| 0)} assume #t~ret0 - 1 >= -2147483648; {2542#(<= |rec1_#t~ret0| 0)} is VALID [2022-02-21 03:02:39,260 INFO L272 TraceCheckUtils]: 18: Hoare triple {2542#(<= |rec1_#t~ret0| 0)} call #t~ret1 := rec1(#t~ret0 - 1); {2543#(<= (+ |rec1_#in~i| 1) 0)} is VALID [2022-02-21 03:02:39,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {2543#(<= (+ |rec1_#in~i| 1) 0)} ~i := #in~i; {2544#(<= (+ rec1_~i 1) 0)} is VALID [2022-02-21 03:02:39,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {2544#(<= (+ rec1_~i 1) 0)} assume !(~i <= 0); {2544#(<= (+ rec1_~i 1) 0)} is VALID [2022-02-21 03:02:39,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {2544#(<= (+ rec1_~i 1) 0)} assume !(~i - 2 <= 2147483647); {2537#false} is VALID [2022-02-21 03:02:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:39,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:39,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566327019] [2022-02-21 03:02:39,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566327019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:39,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:39,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:02:39,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131363662] [2022-02-21 03:02:39,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-21 03:02:39,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:39,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:39,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:39,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:39,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:39,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:39,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:39,277 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,462 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2022-02-21 03:02:39,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:02:39,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-21 03:02:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2022-02-21 03:02:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2022-02-21 03:02:39,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 112 transitions. [2022-02-21 03:02:39,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:39,529 INFO L225 Difference]: With dead ends: 150 [2022-02-21 03:02:39,529 INFO L226 Difference]: Without dead ends: 92 [2022-02-21 03:02:39,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:02:39,532 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:39,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 191 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-21 03:02:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-02-21 03:02:39,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:39,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 80 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 62 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2022-02-21 03:02:39,559 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 80 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 62 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2022-02-21 03:02:39,563 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 80 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 62 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2022-02-21 03:02:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,567 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2022-02-21 03:02:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2022-02-21 03:02:39,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:39,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 62 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) Second operand 92 states. [2022-02-21 03:02:39,569 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 62 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) Second operand 92 states. [2022-02-21 03:02:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,572 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2022-02-21 03:02:39,572 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2022-02-21 03:02:39,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:39,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:39,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 62 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2022-02-21 03:02:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2022-02-21 03:02:39,575 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 22 [2022-02-21 03:02:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:39,576 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2022-02-21 03:02:39,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2022-02-21 03:02:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 03:02:39,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:39,577 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:39,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 03:02:39,577 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:39,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash 289256194, now seen corresponding path program 1 times [2022-02-21 03:02:39,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:39,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443012536] [2022-02-21 03:02:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {3014#true} ~i := #in~i; {3014#true} is VALID [2022-02-21 03:02:39,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {3014#true} assume ~i <= 0;#res := 0; {3014#true} is VALID [2022-02-21 03:02:39,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {3014#true} assume true; {3014#true} is VALID [2022-02-21 03:02:39,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3014#true} {3014#true} #51#return; {3014#true} is VALID [2022-02-21 03:02:39,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {3014#true} ~i := #in~i; {3014#true} is VALID [2022-02-21 03:02:39,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {3014#true} assume ~i <= 0;#res := 0; {3027#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:39,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {3027#(<= |rec1_#res| 0)} assume true; {3027#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:39,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3027#(<= |rec1_#res| 0)} {3014#true} #53#return; {3024#(<= |rec1_#t~ret1| 0)} is VALID [2022-02-21 03:02:39,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {3014#true} assume { :begin_inline_ULTIMATE.init } true; {3014#true} is VALID [2022-02-21 03:02:39,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {3014#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3014#true} is VALID [2022-02-21 03:02:39,660 INFO L272 TraceCheckUtils]: 2: Hoare triple {3014#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {3014#true} is VALID [2022-02-21 03:02:39,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {3014#true} ~j := #in~j; {3014#true} is VALID [2022-02-21 03:02:39,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {3014#true} assume !(~j <= 0); {3014#true} is VALID [2022-02-21 03:02:39,661 INFO L272 TraceCheckUtils]: 5: Hoare triple {3014#true} call #t~ret3 := rec1(~j); {3014#true} is VALID [2022-02-21 03:02:39,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {3014#true} ~i := #in~i; {3014#true} is VALID [2022-02-21 03:02:39,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {3014#true} assume !(~i <= 0); {3014#true} is VALID [2022-02-21 03:02:39,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {3014#true} assume ~i - 2 <= 2147483647; {3014#true} is VALID [2022-02-21 03:02:39,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {3014#true} assume ~i - 2 >= -2147483648; {3014#true} is VALID [2022-02-21 03:02:39,661 INFO L272 TraceCheckUtils]: 10: Hoare triple {3014#true} call #t~ret0 := rec1(~i - 2); {3014#true} is VALID [2022-02-21 03:02:39,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {3014#true} ~i := #in~i; {3014#true} is VALID [2022-02-21 03:02:39,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {3014#true} assume ~i <= 0;#res := 0; {3014#true} is VALID [2022-02-21 03:02:39,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {3014#true} assume true; {3014#true} is VALID [2022-02-21 03:02:39,662 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3014#true} {3014#true} #51#return; {3014#true} is VALID [2022-02-21 03:02:39,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {3014#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3014#true} is VALID [2022-02-21 03:02:39,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {3014#true} assume #t~ret0 - 1 <= 2147483647; {3014#true} is VALID [2022-02-21 03:02:39,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {3014#true} assume #t~ret0 - 1 >= -2147483648; {3014#true} is VALID [2022-02-21 03:02:39,662 INFO L272 TraceCheckUtils]: 18: Hoare triple {3014#true} call #t~ret1 := rec1(#t~ret0 - 1); {3014#true} is VALID [2022-02-21 03:02:39,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {3014#true} ~i := #in~i; {3014#true} is VALID [2022-02-21 03:02:39,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {3014#true} assume ~i <= 0;#res := 0; {3027#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:39,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {3027#(<= |rec1_#res| 0)} assume true; {3027#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:39,664 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3027#(<= |rec1_#res| 0)} {3014#true} #53#return; {3024#(<= |rec1_#t~ret1| 0)} is VALID [2022-02-21 03:02:39,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {3024#(<= |rec1_#t~ret1| 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3024#(<= |rec1_#t~ret1| 0)} is VALID [2022-02-21 03:02:39,665 INFO L272 TraceCheckUtils]: 24: Hoare triple {3024#(<= |rec1_#t~ret1| 0)} call #t~ret2 := rec1(#t~ret1); {3025#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:02:39,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {3025#(<= |rec1_#in~i| 0)} ~i := #in~i; {3026#(<= rec1_~i 0)} is VALID [2022-02-21 03:02:39,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {3026#(<= rec1_~i 0)} assume !(~i <= 0); {3026#(<= rec1_~i 0)} is VALID [2022-02-21 03:02:39,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {3026#(<= rec1_~i 0)} assume !(~i - 2 <= 2147483647); {3015#false} is VALID [2022-02-21 03:02:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 03:02:39,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:39,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443012536] [2022-02-21 03:02:39,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443012536] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:39,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:39,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:02:39,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739042716] [2022-02-21 03:02:39,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:39,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-21 03:02:39,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:39,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:39,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:39,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:39,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:39,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:39,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:39,681 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,848 INFO L93 Difference]: Finished difference Result 159 states and 211 transitions. [2022-02-21 03:02:39,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:02:39,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-21 03:02:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-02-21 03:02:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-02-21 03:02:39,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2022-02-21 03:02:39,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:39,929 INFO L225 Difference]: With dead ends: 159 [2022-02-21 03:02:39,929 INFO L226 Difference]: Without dead ends: 96 [2022-02-21 03:02:39,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:02:39,930 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:39,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 198 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-21 03:02:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2022-02-21 03:02:39,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:39,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 88 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:39,962 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 88 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:39,962 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 88 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,964 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-02-21 03:02:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-02-21 03:02:39,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:39,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Second operand 96 states. [2022-02-21 03:02:39,965 INFO L87 Difference]: Start difference. First operand has 88 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Second operand 96 states. [2022-02-21 03:02:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,967 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-02-21 03:02:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-02-21 03:02:39,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:39,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:39,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-02-21 03:02:39,969 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 28 [2022-02-21 03:02:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:39,969 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-02-21 03:02:39,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-02-21 03:02:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-21 03:02:39,970 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:39,970 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:39,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 03:02:39,970 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:39,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:39,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1526545827, now seen corresponding path program 1 times [2022-02-21 03:02:39,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:39,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896092812] [2022-02-21 03:02:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:39,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {3529#true} ~i := #in~i; {3529#true} is VALID [2022-02-21 03:02:39,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {3529#true} assume ~i <= 0;#res := 0; {3529#true} is VALID [2022-02-21 03:02:39,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-21 03:02:39,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3529#true} {3529#true} #51#return; {3529#true} is VALID [2022-02-21 03:02:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {3529#true} ~i := #in~i; {3529#true} is VALID [2022-02-21 03:02:39,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {3529#true} assume ~i <= 0;#res := 0; {3529#true} is VALID [2022-02-21 03:02:39,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-21 03:02:39,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3529#true} {3529#true} #53#return; {3529#true} is VALID [2022-02-21 03:02:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-21 03:02:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {3529#true} ~i := #in~i; {3529#true} is VALID [2022-02-21 03:02:40,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {3529#true} assume ~i <= 0;#res := 0; {3544#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:40,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {3544#(<= |rec1_#res| 0)} assume true; {3544#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:40,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3544#(<= |rec1_#res| 0)} {3529#true} #55#return; {3543#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:40,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {3529#true} assume { :begin_inline_ULTIMATE.init } true; {3529#true} is VALID [2022-02-21 03:02:40,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {3529#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3529#true} is VALID [2022-02-21 03:02:40,005 INFO L272 TraceCheckUtils]: 2: Hoare triple {3529#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {3529#true} ~j := #in~j; {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {3529#true} assume !(~j <= 0); {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L272 TraceCheckUtils]: 5: Hoare triple {3529#true} call #t~ret3 := rec1(~j); {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {3529#true} ~i := #in~i; {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {3529#true} assume !(~i <= 0); {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {3529#true} assume ~i - 2 <= 2147483647; {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {3529#true} assume ~i - 2 >= -2147483648; {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L272 TraceCheckUtils]: 10: Hoare triple {3529#true} call #t~ret0 := rec1(~i - 2); {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {3529#true} ~i := #in~i; {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {3529#true} assume ~i <= 0;#res := 0; {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3529#true} {3529#true} #51#return; {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {3529#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {3529#true} assume #t~ret0 - 1 <= 2147483647; {3529#true} is VALID [2022-02-21 03:02:40,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {3529#true} assume #t~ret0 - 1 >= -2147483648; {3529#true} is VALID [2022-02-21 03:02:40,007 INFO L272 TraceCheckUtils]: 18: Hoare triple {3529#true} call #t~ret1 := rec1(#t~ret0 - 1); {3529#true} is VALID [2022-02-21 03:02:40,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {3529#true} ~i := #in~i; {3529#true} is VALID [2022-02-21 03:02:40,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {3529#true} assume ~i <= 0;#res := 0; {3529#true} is VALID [2022-02-21 03:02:40,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-21 03:02:40,007 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3529#true} {3529#true} #53#return; {3529#true} is VALID [2022-02-21 03:02:40,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {3529#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3529#true} is VALID [2022-02-21 03:02:40,007 INFO L272 TraceCheckUtils]: 24: Hoare triple {3529#true} call #t~ret2 := rec1(#t~ret1); {3529#true} is VALID [2022-02-21 03:02:40,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {3529#true} ~i := #in~i; {3529#true} is VALID [2022-02-21 03:02:40,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {3529#true} assume ~i <= 0;#res := 0; {3544#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:40,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {3544#(<= |rec1_#res| 0)} assume true; {3544#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:40,008 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3544#(<= |rec1_#res| 0)} {3529#true} #55#return; {3543#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:40,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {3543#(<= |rec1_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3543#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:40,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {3543#(<= |rec1_#t~ret2| 0)} assume !(1 + #t~ret2 <= 2147483647); {3530#false} is VALID [2022-02-21 03:02:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:02:40,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:40,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896092812] [2022-02-21 03:02:40,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896092812] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:40,009 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:40,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:02:40,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440102077] [2022-02-21 03:02:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:40,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-21 03:02:40,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:40,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:40,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:02:40,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:40,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:02:40,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:40,023 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,104 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2022-02-21 03:02:40,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:02:40,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-21 03:02:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-21 03:02:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-21 03:02:40,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-02-21 03:02:40,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,152 INFO L225 Difference]: With dead ends: 95 [2022-02-21 03:02:40,152 INFO L226 Difference]: Without dead ends: 94 [2022-02-21 03:02:40,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:40,153 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:40,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-21 03:02:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-02-21 03:02:40,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:40,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 92 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 69 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,189 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 92 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 69 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,189 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 92 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 69 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,191 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-02-21 03:02:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-02-21 03:02:40,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 69 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) Second operand 94 states. [2022-02-21 03:02:40,192 INFO L87 Difference]: Start difference. First operand has 92 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 69 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) Second operand 94 states. [2022-02-21 03:02:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,195 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-02-21 03:02:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-02-21 03:02:40,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:40,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 69 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2022-02-21 03:02:40,198 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 31 [2022-02-21 03:02:40,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:40,198 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2022-02-21 03:02:40,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2022-02-21 03:02:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:02:40,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:40,200 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:40,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 03:02:40,200 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:40,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:40,200 INFO L85 PathProgramCache]: Analyzing trace with hash 78280433, now seen corresponding path program 1 times [2022-02-21 03:02:40,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:40,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859232248] [2022-02-21 03:02:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {3964#true} ~i := #in~i; {3964#true} is VALID [2022-02-21 03:02:40,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {3964#true} assume ~i <= 0;#res := 0; {3964#true} is VALID [2022-02-21 03:02:40,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {3964#true} assume true; {3964#true} is VALID [2022-02-21 03:02:40,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3964#true} {3964#true} #51#return; {3964#true} is VALID [2022-02-21 03:02:40,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {3964#true} ~i := #in~i; {3964#true} is VALID [2022-02-21 03:02:40,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {3964#true} assume ~i <= 0;#res := 0; {3964#true} is VALID [2022-02-21 03:02:40,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {3964#true} assume true; {3964#true} is VALID [2022-02-21 03:02:40,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3964#true} {3964#true} #53#return; {3964#true} is VALID [2022-02-21 03:02:40,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-21 03:02:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {3964#true} ~i := #in~i; {3964#true} is VALID [2022-02-21 03:02:40,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {3964#true} assume ~i <= 0;#res := 0; {3964#true} is VALID [2022-02-21 03:02:40,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {3964#true} assume true; {3964#true} is VALID [2022-02-21 03:02:40,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3964#true} {3964#true} #55#return; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {3964#true} assume { :begin_inline_ULTIMATE.init } true; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {3964#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L272 TraceCheckUtils]: 2: Hoare triple {3964#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {3964#true} ~j := #in~j; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {3964#true} assume !(~j <= 0); {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L272 TraceCheckUtils]: 5: Hoare triple {3964#true} call #t~ret3 := rec1(~j); {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {3964#true} ~i := #in~i; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {3964#true} assume !(~i <= 0); {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {3964#true} assume ~i - 2 <= 2147483647; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {3964#true} assume ~i - 2 >= -2147483648; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L272 TraceCheckUtils]: 10: Hoare triple {3964#true} call #t~ret0 := rec1(~i - 2); {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {3964#true} ~i := #in~i; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {3964#true} assume ~i <= 0;#res := 0; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {3964#true} assume true; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3964#true} {3964#true} #51#return; {3964#true} is VALID [2022-02-21 03:02:40,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {3964#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {3964#true} assume #t~ret0 - 1 <= 2147483647; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {3964#true} assume #t~ret0 - 1 >= -2147483648; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L272 TraceCheckUtils]: 18: Hoare triple {3964#true} call #t~ret1 := rec1(#t~ret0 - 1); {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {3964#true} ~i := #in~i; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {3964#true} assume ~i <= 0;#res := 0; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {3964#true} assume true; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3964#true} {3964#true} #53#return; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {3964#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L272 TraceCheckUtils]: 24: Hoare triple {3964#true} call #t~ret2 := rec1(#t~ret1); {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {3964#true} ~i := #in~i; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {3964#true} assume ~i <= 0;#res := 0; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {3964#true} assume true; {3964#true} is VALID [2022-02-21 03:02:40,244 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3964#true} {3964#true} #55#return; {3964#true} is VALID [2022-02-21 03:02:40,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {3964#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3978#(<= 0 (+ |rec1_#t~ret2| 2147483648))} is VALID [2022-02-21 03:02:40,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {3978#(<= 0 (+ |rec1_#t~ret2| 2147483648))} assume 1 + #t~ret2 <= 2147483647; {3978#(<= 0 (+ |rec1_#t~ret2| 2147483648))} is VALID [2022-02-21 03:02:40,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {3978#(<= 0 (+ |rec1_#t~ret2| 2147483648))} assume !(1 + #t~ret2 >= -2147483648); {3965#false} is VALID [2022-02-21 03:02:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 03:02:40,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:40,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859232248] [2022-02-21 03:02:40,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859232248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:40,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:40,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:40,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243474107] [2022-02-21 03:02:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:40,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-02-21 03:02:40,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:40,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:40,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:40,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:40,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:40,266 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,339 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2022-02-21 03:02:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-02-21 03:02:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-02-21 03:02:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-02-21 03:02:40,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-02-21 03:02:40,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,369 INFO L225 Difference]: With dead ends: 92 [2022-02-21 03:02:40,369 INFO L226 Difference]: Without dead ends: 91 [2022-02-21 03:02:40,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:40,370 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:40,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-21 03:02:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-21 03:02:40,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:40,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 68 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,414 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 68 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,414 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 68 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,416 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-02-21 03:02:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-02-21 03:02:40,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 68 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) Second operand 91 states. [2022-02-21 03:02:40,417 INFO L87 Difference]: Start difference. First operand has 91 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 68 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) Second operand 91 states. [2022-02-21 03:02:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,418 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-02-21 03:02:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-02-21 03:02:40,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:40,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 68 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-02-21 03:02:40,420 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 32 [2022-02-21 03:02:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:40,420 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-02-21 03:02:40,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-02-21 03:02:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 03:02:40,421 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:40,421 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:40,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 03:02:40,421 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:40,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1338149547, now seen corresponding path program 1 times [2022-02-21 03:02:40,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:40,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108841177] [2022-02-21 03:02:40,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:40,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:02:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {4388#true} assume ~i <= 0;#res := 0; {4388#true} is VALID [2022-02-21 03:02:40,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {4388#true} assume true; {4388#true} is VALID [2022-02-21 03:02:40,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4388#true} {4388#true} #51#return; {4388#true} is VALID [2022-02-21 03:02:40,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {4388#true} assume ~i <= 0;#res := 0; {4388#true} is VALID [2022-02-21 03:02:40,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {4388#true} assume true; {4388#true} is VALID [2022-02-21 03:02:40,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4388#true} {4388#true} #53#return; {4388#true} is VALID [2022-02-21 03:02:40,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {4388#true} assume ~i <= 0;#res := 0; {4433#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {4433#(<= 0 |rec1_#res|)} assume true; {4433#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4433#(<= 0 |rec1_#res|)} {4388#true} #55#return; {4431#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {4388#true} assume !(~i <= 0); {4388#true} is VALID [2022-02-21 03:02:40,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {4388#true} assume ~i - 2 <= 2147483647; {4388#true} is VALID [2022-02-21 03:02:40,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {4388#true} assume ~i - 2 >= -2147483648; {4388#true} is VALID [2022-02-21 03:02:40,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {4388#true} call #t~ret0 := rec1(~i - 2); {4388#true} is VALID [2022-02-21 03:02:40,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {4388#true} assume ~i <= 0;#res := 0; {4388#true} is VALID [2022-02-21 03:02:40,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {4388#true} assume true; {4388#true} is VALID [2022-02-21 03:02:40,482 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {4388#true} {4388#true} #51#return; {4388#true} is VALID [2022-02-21 03:02:40,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {4388#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4388#true} is VALID [2022-02-21 03:02:40,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {4388#true} assume #t~ret0 - 1 <= 2147483647; {4388#true} is VALID [2022-02-21 03:02:40,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {4388#true} assume #t~ret0 - 1 >= -2147483648; {4388#true} is VALID [2022-02-21 03:02:40,483 INFO L272 TraceCheckUtils]: 12: Hoare triple {4388#true} call #t~ret1 := rec1(#t~ret0 - 1); {4388#true} is VALID [2022-02-21 03:02:40,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {4388#true} assume ~i <= 0;#res := 0; {4388#true} is VALID [2022-02-21 03:02:40,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {4388#true} assume true; {4388#true} is VALID [2022-02-21 03:02:40,483 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4388#true} {4388#true} #53#return; {4388#true} is VALID [2022-02-21 03:02:40,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {4388#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4388#true} is VALID [2022-02-21 03:02:40,483 INFO L272 TraceCheckUtils]: 18: Hoare triple {4388#true} call #t~ret2 := rec1(#t~ret1); {4388#true} is VALID [2022-02-21 03:02:40,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {4388#true} assume ~i <= 0;#res := 0; {4433#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {4433#(<= 0 |rec1_#res|)} assume true; {4433#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,484 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4433#(<= 0 |rec1_#res|)} {4388#true} #55#return; {4431#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {4431#(<= 0 |rec1_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4431#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {4431#(<= 0 |rec1_#t~ret2|)} assume 1 + #t~ret2 <= 2147483647; {4431#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {4431#(<= 0 |rec1_#t~ret2|)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {4432#(<= 1 |rec1_#res|)} is VALID [2022-02-21 03:02:40,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {4432#(<= 1 |rec1_#res|)} assume true; {4432#(<= 1 |rec1_#res|)} is VALID [2022-02-21 03:02:40,486 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4432#(<= 1 |rec1_#res|)} {4388#true} #57#return; {4418#(<= 1 |rec2_#t~ret3|)} is VALID [2022-02-21 03:02:40,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {4388#true} assume { :begin_inline_ULTIMATE.init } true; {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {4388#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L272 TraceCheckUtils]: 2: Hoare triple {4388#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {4388#true} ~j := #in~j; {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L290 TraceCheckUtils]: 4: Hoare triple {4388#true} assume !(~j <= 0); {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L272 TraceCheckUtils]: 5: Hoare triple {4388#true} call #t~ret3 := rec1(~j); {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {4388#true} assume !(~i <= 0); {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {4388#true} assume ~i - 2 <= 2147483647; {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {4388#true} assume ~i - 2 >= -2147483648; {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L272 TraceCheckUtils]: 10: Hoare triple {4388#true} call #t~ret0 := rec1(~i - 2); {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {4388#true} assume ~i <= 0;#res := 0; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {4388#true} assume true; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4388#true} {4388#true} #51#return; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {4388#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {4388#true} assume #t~ret0 - 1 <= 2147483647; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {4388#true} assume #t~ret0 - 1 >= -2147483648; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L272 TraceCheckUtils]: 18: Hoare triple {4388#true} call #t~ret1 := rec1(#t~ret0 - 1); {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {4388#true} assume ~i <= 0;#res := 0; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {4388#true} assume true; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4388#true} {4388#true} #53#return; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {4388#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L272 TraceCheckUtils]: 24: Hoare triple {4388#true} call #t~ret2 := rec1(#t~ret1); {4388#true} is VALID [2022-02-21 03:02:40,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {4388#true} ~i := #in~i; {4388#true} is VALID [2022-02-21 03:02:40,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {4388#true} assume ~i <= 0;#res := 0; {4433#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {4433#(<= 0 |rec1_#res|)} assume true; {4433#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,488 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4433#(<= 0 |rec1_#res|)} {4388#true} #55#return; {4431#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {4431#(<= 0 |rec1_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4431#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {4431#(<= 0 |rec1_#t~ret2|)} assume 1 + #t~ret2 <= 2147483647; {4431#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {4431#(<= 0 |rec1_#t~ret2|)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {4432#(<= 1 |rec1_#res|)} is VALID [2022-02-21 03:02:40,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {4432#(<= 1 |rec1_#res|)} assume true; {4432#(<= 1 |rec1_#res|)} is VALID [2022-02-21 03:02:40,490 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4432#(<= 1 |rec1_#res|)} {4388#true} #57#return; {4418#(<= 1 |rec2_#t~ret3|)} is VALID [2022-02-21 03:02:40,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {4418#(<= 1 |rec2_#t~ret3|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4418#(<= 1 |rec2_#t~ret3|)} is VALID [2022-02-21 03:02:40,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {4418#(<= 1 |rec2_#t~ret3|)} assume #t~ret3 - 1 <= 2147483647; {4418#(<= 1 |rec2_#t~ret3|)} is VALID [2022-02-21 03:02:40,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {4418#(<= 1 |rec2_#t~ret3|)} assume !(#t~ret3 - 1 >= -2147483648); {4389#false} is VALID [2022-02-21 03:02:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:02:40,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:40,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108841177] [2022-02-21 03:02:40,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108841177] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:40,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:40,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:02:40,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199601719] [2022-02-21 03:02:40,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:40,492 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-02-21 03:02:40,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:40,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:40,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:40,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:40,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:40,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:40,509 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,633 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-02-21 03:02:40,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:40,633 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-02-21 03:02:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-02-21 03:02:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-02-21 03:02:40,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-02-21 03:02:40,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,667 INFO L225 Difference]: With dead ends: 91 [2022-02-21 03:02:40,667 INFO L226 Difference]: Without dead ends: 90 [2022-02-21 03:02:40,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:40,667 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:40,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 176 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-21 03:02:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-02-21 03:02:40,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:40,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 90 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,696 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 90 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,696 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 90 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,698 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-02-21 03:02:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-02-21 03:02:40,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) Second operand 90 states. [2022-02-21 03:02:40,698 INFO L87 Difference]: Start difference. First operand has 90 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) Second operand 90 states. [2022-02-21 03:02:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,700 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-02-21 03:02:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-02-21 03:02:40,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:40,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-02-21 03:02:40,702 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 37 [2022-02-21 03:02:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:40,702 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-02-21 03:02:40,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-02-21 03:02:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-21 03:02:40,703 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:40,703 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:40,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 03:02:40,703 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:40,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1908591901, now seen corresponding path program 1 times [2022-02-21 03:02:40,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:40,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849616367] [2022-02-21 03:02:40,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:02:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {4839#true} assume ~i <= 0;#res := 0; {4839#true} is VALID [2022-02-21 03:02:40,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {4839#true} assume true; {4839#true} is VALID [2022-02-21 03:02:40,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4839#true} {4839#true} #51#return; {4839#true} is VALID [2022-02-21 03:02:40,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {4839#true} assume ~i <= 0;#res := 0; {4839#true} is VALID [2022-02-21 03:02:40,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {4839#true} assume true; {4839#true} is VALID [2022-02-21 03:02:40,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4839#true} {4839#true} #53#return; {4839#true} is VALID [2022-02-21 03:02:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {4839#true} assume ~i <= 0;#res := 0; {4884#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {4884#(<= 0 |rec1_#res|)} assume true; {4884#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4884#(<= 0 |rec1_#res|)} {4839#true} #55#return; {4882#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {4839#true} assume !(~i <= 0); {4839#true} is VALID [2022-02-21 03:02:40,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {4839#true} assume ~i - 2 <= 2147483647; {4839#true} is VALID [2022-02-21 03:02:40,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {4839#true} assume ~i - 2 >= -2147483648; {4839#true} is VALID [2022-02-21 03:02:40,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {4839#true} call #t~ret0 := rec1(~i - 2); {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {4839#true} assume ~i <= 0;#res := 0; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {4839#true} assume true; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {4839#true} {4839#true} #51#return; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {4839#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {4839#true} assume #t~ret0 - 1 <= 2147483647; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {4839#true} assume #t~ret0 - 1 >= -2147483648; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L272 TraceCheckUtils]: 12: Hoare triple {4839#true} call #t~ret1 := rec1(#t~ret0 - 1); {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {4839#true} assume ~i <= 0;#res := 0; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {4839#true} assume true; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4839#true} {4839#true} #53#return; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {4839#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L272 TraceCheckUtils]: 18: Hoare triple {4839#true} call #t~ret2 := rec1(#t~ret1); {4839#true} is VALID [2022-02-21 03:02:40,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {4839#true} assume ~i <= 0;#res := 0; {4884#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {4884#(<= 0 |rec1_#res|)} assume true; {4884#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,785 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4884#(<= 0 |rec1_#res|)} {4839#true} #55#return; {4882#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {4882#(<= 0 |rec1_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4882#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {4882#(<= 0 |rec1_#t~ret2|)} assume 1 + #t~ret2 <= 2147483647; {4882#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {4882#(<= 0 |rec1_#t~ret2|)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {4883#(<= 1 |rec1_#res|)} is VALID [2022-02-21 03:02:40,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {4883#(<= 1 |rec1_#res|)} assume true; {4883#(<= 1 |rec1_#res|)} is VALID [2022-02-21 03:02:40,787 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4883#(<= 1 |rec1_#res|)} {4839#true} #51#return; {4869#(<= 1 |rec1_#t~ret0|)} is VALID [2022-02-21 03:02:40,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {4839#true} assume { :begin_inline_ULTIMATE.init } true; {4839#true} is VALID [2022-02-21 03:02:40,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {4839#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {4839#true} is VALID [2022-02-21 03:02:40,787 INFO L272 TraceCheckUtils]: 2: Hoare triple {4839#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {4839#true} is VALID [2022-02-21 03:02:40,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {4839#true} ~j := #in~j; {4839#true} is VALID [2022-02-21 03:02:40,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {4839#true} assume !(~j <= 0); {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L272 TraceCheckUtils]: 5: Hoare triple {4839#true} call #t~ret3 := rec1(~j); {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {4839#true} assume !(~i <= 0); {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {4839#true} assume ~i - 2 <= 2147483647; {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {4839#true} assume ~i - 2 >= -2147483648; {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L272 TraceCheckUtils]: 10: Hoare triple {4839#true} call #t~ret0 := rec1(~i - 2); {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {4839#true} assume !(~i <= 0); {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {4839#true} assume ~i - 2 <= 2147483647; {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {4839#true} assume ~i - 2 >= -2147483648; {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L272 TraceCheckUtils]: 15: Hoare triple {4839#true} call #t~ret0 := rec1(~i - 2); {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {4839#true} assume !(~i <= 0); {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {4839#true} assume ~i - 2 <= 2147483647; {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {4839#true} assume ~i - 2 >= -2147483648; {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L272 TraceCheckUtils]: 20: Hoare triple {4839#true} call #t~ret0 := rec1(~i - 2); {4839#true} is VALID [2022-02-21 03:02:40,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {4839#true} assume ~i <= 0;#res := 0; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {4839#true} assume true; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4839#true} {4839#true} #51#return; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {4839#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {4839#true} assume #t~ret0 - 1 <= 2147483647; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {4839#true} assume #t~ret0 - 1 >= -2147483648; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L272 TraceCheckUtils]: 28: Hoare triple {4839#true} call #t~ret1 := rec1(#t~ret0 - 1); {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {4839#true} assume ~i <= 0;#res := 0; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {4839#true} assume true; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4839#true} {4839#true} #53#return; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {4839#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L272 TraceCheckUtils]: 34: Hoare triple {4839#true} call #t~ret2 := rec1(#t~ret1); {4839#true} is VALID [2022-02-21 03:02:40,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {4839#true} ~i := #in~i; {4839#true} is VALID [2022-02-21 03:02:40,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {4839#true} assume ~i <= 0;#res := 0; {4884#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {4884#(<= 0 |rec1_#res|)} assume true; {4884#(<= 0 |rec1_#res|)} is VALID [2022-02-21 03:02:40,790 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4884#(<= 0 |rec1_#res|)} {4839#true} #55#return; {4882#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {4882#(<= 0 |rec1_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4882#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {4882#(<= 0 |rec1_#t~ret2|)} assume 1 + #t~ret2 <= 2147483647; {4882#(<= 0 |rec1_#t~ret2|)} is VALID [2022-02-21 03:02:40,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {4882#(<= 0 |rec1_#t~ret2|)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {4883#(<= 1 |rec1_#res|)} is VALID [2022-02-21 03:02:40,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {4883#(<= 1 |rec1_#res|)} assume true; {4883#(<= 1 |rec1_#res|)} is VALID [2022-02-21 03:02:40,792 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4883#(<= 1 |rec1_#res|)} {4839#true} #51#return; {4869#(<= 1 |rec1_#t~ret0|)} is VALID [2022-02-21 03:02:40,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {4869#(<= 1 |rec1_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4869#(<= 1 |rec1_#t~ret0|)} is VALID [2022-02-21 03:02:40,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {4869#(<= 1 |rec1_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {4869#(<= 1 |rec1_#t~ret0|)} is VALID [2022-02-21 03:02:40,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {4869#(<= 1 |rec1_#t~ret0|)} assume !(#t~ret0 - 1 >= -2147483648); {4840#false} is VALID [2022-02-21 03:02:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-02-21 03:02:40,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:40,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849616367] [2022-02-21 03:02:40,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849616367] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:40,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:40,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:02:40,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990852736] [2022-02-21 03:02:40,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:40,794 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-02-21 03:02:40,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:40,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:40,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:40,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:40,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:40,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:40,811 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,989 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2022-02-21 03:02:40,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:02:40,989 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-02-21 03:02:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-02-21 03:02:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-02-21 03:02:40,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2022-02-21 03:02:41,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:41,029 INFO L225 Difference]: With dead ends: 100 [2022-02-21 03:02:41,029 INFO L226 Difference]: Without dead ends: 99 [2022-02-21 03:02:41,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:02:41,029 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:41,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-21 03:02:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2022-02-21 03:02:41,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:41,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 89 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:41,061 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 89 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:41,061 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 89 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,063 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2022-02-21 03:02:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2022-02-21 03:02:41,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:41,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:41,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) Second operand 99 states. [2022-02-21 03:02:41,064 INFO L87 Difference]: Start difference. First operand has 89 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) Second operand 99 states. [2022-02-21 03:02:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,066 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2022-02-21 03:02:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2022-02-21 03:02:41,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:41,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:41,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:41,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2022-02-21 03:02:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2022-02-21 03:02:41,069 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 47 [2022-02-21 03:02:41,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:41,069 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2022-02-21 03:02:41,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2022-02-21 03:02:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-21 03:02:41,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:41,070 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:41,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 03:02:41,070 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:41,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:41,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1653667627, now seen corresponding path program 1 times [2022-02-21 03:02:41,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:41,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11717974] [2022-02-21 03:02:41,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:41,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5320#true} is VALID [2022-02-21 03:02:41,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {5320#true} assume true; {5320#true} is VALID [2022-02-21 03:02:41,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5320#true} {5320#true} #51#return; {5320#true} is VALID [2022-02-21 03:02:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5320#true} is VALID [2022-02-21 03:02:41,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {5320#true} assume true; {5320#true} is VALID [2022-02-21 03:02:41,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5320#true} {5320#true} #53#return; {5320#true} is VALID [2022-02-21 03:02:41,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5367#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:41,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {5367#(<= |rec1_#res| 0)} assume true; {5367#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:41,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5367#(<= |rec1_#res| 0)} {5320#true} #55#return; {5365#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:41,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {5320#true} assume !(~i <= 0); {5320#true} is VALID [2022-02-21 03:02:41,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {5320#true} assume ~i - 2 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {5320#true} assume ~i - 2 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {5320#true} call #t~ret0 := rec1(~i - 2); {5320#true} is VALID [2022-02-21 03:02:41,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5320#true} is VALID [2022-02-21 03:02:41,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {5320#true} assume true; {5320#true} is VALID [2022-02-21 03:02:41,167 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5320#true} {5320#true} #51#return; {5320#true} is VALID [2022-02-21 03:02:41,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {5320#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {5320#true} assume #t~ret0 - 1 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {5320#true} assume #t~ret0 - 1 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,168 INFO L272 TraceCheckUtils]: 12: Hoare triple {5320#true} call #t~ret1 := rec1(#t~ret0 - 1); {5320#true} is VALID [2022-02-21 03:02:41,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5320#true} is VALID [2022-02-21 03:02:41,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {5320#true} assume true; {5320#true} is VALID [2022-02-21 03:02:41,168 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5320#true} {5320#true} #53#return; {5320#true} is VALID [2022-02-21 03:02:41,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {5320#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,169 INFO L272 TraceCheckUtils]: 18: Hoare triple {5320#true} call #t~ret2 := rec1(#t~ret1); {5320#true} is VALID [2022-02-21 03:02:41,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5367#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:41,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {5367#(<= |rec1_#res| 0)} assume true; {5367#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:41,170 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5367#(<= |rec1_#res| 0)} {5320#true} #55#return; {5365#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:41,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {5365#(<= |rec1_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {5365#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:41,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {5365#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 <= 2147483647; {5365#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:41,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {5365#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {5366#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:41,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {5366#(<= |rec1_#res| 1)} assume true; {5366#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:41,171 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5366#(<= |rec1_#res| 1)} {5320#true} #51#return; {5350#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {5320#true} assume { :begin_inline_ULTIMATE.init } true; {5320#true} is VALID [2022-02-21 03:02:41,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {5320#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {5320#true} is VALID [2022-02-21 03:02:41,172 INFO L272 TraceCheckUtils]: 2: Hoare triple {5320#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {5320#true} is VALID [2022-02-21 03:02:41,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {5320#true} ~j := #in~j; {5320#true} is VALID [2022-02-21 03:02:41,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {5320#true} assume !(~j <= 0); {5320#true} is VALID [2022-02-21 03:02:41,173 INFO L272 TraceCheckUtils]: 5: Hoare triple {5320#true} call #t~ret3 := rec1(~j); {5320#true} is VALID [2022-02-21 03:02:41,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {5320#true} assume !(~i <= 0); {5320#true} is VALID [2022-02-21 03:02:41,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {5320#true} assume ~i - 2 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {5320#true} assume ~i - 2 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,173 INFO L272 TraceCheckUtils]: 10: Hoare triple {5320#true} call #t~ret0 := rec1(~i - 2); {5320#true} is VALID [2022-02-21 03:02:41,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {5320#true} assume !(~i <= 0); {5320#true} is VALID [2022-02-21 03:02:41,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {5320#true} assume ~i - 2 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {5320#true} assume ~i - 2 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,174 INFO L272 TraceCheckUtils]: 15: Hoare triple {5320#true} call #t~ret0 := rec1(~i - 2); {5320#true} is VALID [2022-02-21 03:02:41,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5320#true} is VALID [2022-02-21 03:02:41,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {5320#true} assume true; {5320#true} is VALID [2022-02-21 03:02:41,174 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5320#true} {5320#true} #51#return; {5320#true} is VALID [2022-02-21 03:02:41,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {5320#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {5320#true} assume #t~ret0 - 1 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {5320#true} assume #t~ret0 - 1 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,175 INFO L272 TraceCheckUtils]: 23: Hoare triple {5320#true} call #t~ret1 := rec1(#t~ret0 - 1); {5320#true} is VALID [2022-02-21 03:02:41,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5320#true} is VALID [2022-02-21 03:02:41,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {5320#true} assume true; {5320#true} is VALID [2022-02-21 03:02:41,175 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5320#true} {5320#true} #53#return; {5320#true} is VALID [2022-02-21 03:02:41,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {5320#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,175 INFO L272 TraceCheckUtils]: 29: Hoare triple {5320#true} call #t~ret2 := rec1(#t~ret1); {5320#true} is VALID [2022-02-21 03:02:41,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5367#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:41,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {5367#(<= |rec1_#res| 0)} assume true; {5367#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:41,178 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5367#(<= |rec1_#res| 0)} {5320#true} #55#return; {5365#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:41,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {5365#(<= |rec1_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {5365#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:41,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {5365#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 <= 2147483647; {5365#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:41,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {5365#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {5366#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:41,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {5366#(<= |rec1_#res| 1)} assume true; {5366#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:41,182 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5366#(<= |rec1_#res| 1)} {5320#true} #51#return; {5350#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,182 INFO L290 TraceCheckUtils]: 39: Hoare triple {5350#(<= |rec1_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5350#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,182 INFO L290 TraceCheckUtils]: 40: Hoare triple {5350#(<= |rec1_#t~ret0| 1)} assume #t~ret0 - 1 <= 2147483647; {5350#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {5350#(<= |rec1_#t~ret0| 1)} assume #t~ret0 - 1 >= -2147483648; {5350#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,183 INFO L272 TraceCheckUtils]: 42: Hoare triple {5350#(<= |rec1_#t~ret0| 1)} call #t~ret1 := rec1(#t~ret0 - 1); {5351#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:02:41,183 INFO L290 TraceCheckUtils]: 43: Hoare triple {5351#(<= |rec1_#in~i| 0)} ~i := #in~i; {5352#(<= rec1_~i 0)} is VALID [2022-02-21 03:02:41,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {5352#(<= rec1_~i 0)} assume !(~i <= 0); {5352#(<= rec1_~i 0)} is VALID [2022-02-21 03:02:41,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {5352#(<= rec1_~i 0)} assume !(~i - 2 <= 2147483647); {5321#false} is VALID [2022-02-21 03:02:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-21 03:02:41,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:41,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11717974] [2022-02-21 03:02:41,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11717974] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:41,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904512028] [2022-02-21 03:02:41,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:41,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:41,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:41,186 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) [2022-02-21 03:02:41,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:02:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:02:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:41,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {5320#true} assume { :begin_inline_ULTIMATE.init } true; {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {5320#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L272 TraceCheckUtils]: 2: Hoare triple {5320#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {5320#true} ~j := #in~j; {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {5320#true} assume !(~j <= 0); {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L272 TraceCheckUtils]: 5: Hoare triple {5320#true} call #t~ret3 := rec1(~j); {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {5320#true} assume !(~i <= 0); {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {5320#true} assume ~i - 2 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {5320#true} assume ~i - 2 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L272 TraceCheckUtils]: 10: Hoare triple {5320#true} call #t~ret0 := rec1(~i - 2); {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {5320#true} assume !(~i <= 0); {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {5320#true} assume ~i - 2 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {5320#true} assume ~i - 2 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L272 TraceCheckUtils]: 15: Hoare triple {5320#true} call #t~ret0 := rec1(~i - 2); {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {5320#true} assume true; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5320#true} {5320#true} #51#return; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {5320#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {5320#true} assume #t~ret0 - 1 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {5320#true} assume #t~ret0 - 1 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L272 TraceCheckUtils]: 23: Hoare triple {5320#true} call #t~ret1 := rec1(#t~ret0 - 1); {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {5320#true} assume true; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5320#true} {5320#true} #53#return; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {5320#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L272 TraceCheckUtils]: 29: Hoare triple {5320#true} call #t~ret2 := rec1(#t~ret1); {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5367#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:41,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {5367#(<= |rec1_#res| 0)} assume true; {5367#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:41,498 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5367#(<= |rec1_#res| 0)} {5320#true} #55#return; {5365#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:41,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {5365#(<= |rec1_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {5365#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:41,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {5365#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 <= 2147483647; {5365#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:41,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {5365#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {5366#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:41,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {5366#(<= |rec1_#res| 1)} assume true; {5366#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:41,500 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5366#(<= |rec1_#res| 1)} {5320#true} #51#return; {5350#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {5350#(<= |rec1_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5350#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {5350#(<= |rec1_#t~ret0| 1)} assume #t~ret0 - 1 <= 2147483647; {5350#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {5350#(<= |rec1_#t~ret0| 1)} assume #t~ret0 - 1 >= -2147483648; {5350#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,501 INFO L272 TraceCheckUtils]: 42: Hoare triple {5350#(<= |rec1_#t~ret0| 1)} call #t~ret1 := rec1(#t~ret0 - 1); {5351#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:02:41,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {5351#(<= |rec1_#in~i| 0)} ~i := #in~i; {5352#(<= rec1_~i 0)} is VALID [2022-02-21 03:02:41,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {5352#(<= rec1_~i 0)} assume !(~i <= 0); {5352#(<= rec1_~i 0)} is VALID [2022-02-21 03:02:41,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {5352#(<= rec1_~i 0)} assume !(~i - 2 <= 2147483647); {5321#false} is VALID [2022-02-21 03:02:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-21 03:02:41,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:41,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {5506#(<= rec1_~i 2147483649)} assume !(~i - 2 <= 2147483647); {5321#false} is VALID [2022-02-21 03:02:41,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {5506#(<= rec1_~i 2147483649)} assume !(~i <= 0); {5506#(<= rec1_~i 2147483649)} is VALID [2022-02-21 03:02:41,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {5513#(<= |rec1_#in~i| 2147483649)} ~i := #in~i; {5506#(<= rec1_~i 2147483649)} is VALID [2022-02-21 03:02:41,923 INFO L272 TraceCheckUtils]: 42: Hoare triple {5517#(<= |rec1_#t~ret0| 2147483650)} call #t~ret1 := rec1(#t~ret0 - 1); {5513#(<= |rec1_#in~i| 2147483649)} is VALID [2022-02-21 03:02:41,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {5517#(<= |rec1_#t~ret0| 2147483650)} assume #t~ret0 - 1 >= -2147483648; {5517#(<= |rec1_#t~ret0| 2147483650)} is VALID [2022-02-21 03:02:41,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {5517#(<= |rec1_#t~ret0| 2147483650)} assume #t~ret0 - 1 <= 2147483647; {5517#(<= |rec1_#t~ret0| 2147483650)} is VALID [2022-02-21 03:02:41,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {5517#(<= |rec1_#t~ret0| 2147483650)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5517#(<= |rec1_#t~ret0| 2147483650)} is VALID [2022-02-21 03:02:41,925 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5533#(<= |rec1_#res| 2147483650)} {5320#true} #51#return; {5517#(<= |rec1_#t~ret0| 2147483650)} is VALID [2022-02-21 03:02:41,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {5533#(<= |rec1_#res| 2147483650)} assume true; {5533#(<= |rec1_#res| 2147483650)} is VALID [2022-02-21 03:02:41,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {5540#(<= |rec1_#t~ret2| 2147483649)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {5533#(<= |rec1_#res| 2147483650)} is VALID [2022-02-21 03:02:41,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {5540#(<= |rec1_#t~ret2| 2147483649)} assume 1 + #t~ret2 <= 2147483647; {5540#(<= |rec1_#t~ret2| 2147483649)} is VALID [2022-02-21 03:02:41,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {5540#(<= |rec1_#t~ret2| 2147483649)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {5540#(<= |rec1_#t~ret2| 2147483649)} is VALID [2022-02-21 03:02:41,926 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5553#(<= |rec1_#res| 2147483649)} {5320#true} #55#return; {5540#(<= |rec1_#t~ret2| 2147483649)} is VALID [2022-02-21 03:02:41,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {5553#(<= |rec1_#res| 2147483649)} assume true; {5553#(<= |rec1_#res| 2147483649)} is VALID [2022-02-21 03:02:41,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5553#(<= |rec1_#res| 2147483649)} is VALID [2022-02-21 03:02:41,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,927 INFO L272 TraceCheckUtils]: 29: Hoare triple {5320#true} call #t~ret2 := rec1(#t~ret1); {5320#true} is VALID [2022-02-21 03:02:41,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {5320#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,927 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5320#true} {5320#true} #53#return; {5320#true} is VALID [2022-02-21 03:02:41,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {5320#true} assume true; {5320#true} is VALID [2022-02-21 03:02:41,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5320#true} is VALID [2022-02-21 03:02:41,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,927 INFO L272 TraceCheckUtils]: 23: Hoare triple {5320#true} call #t~ret1 := rec1(#t~ret0 - 1); {5320#true} is VALID [2022-02-21 03:02:41,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {5320#true} assume #t~ret0 - 1 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {5320#true} assume #t~ret0 - 1 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {5320#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5320#true} {5320#true} #51#return; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {5320#true} assume true; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {5320#true} assume ~i <= 0;#res := 0; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L272 TraceCheckUtils]: 15: Hoare triple {5320#true} call #t~ret0 := rec1(~i - 2); {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {5320#true} assume ~i - 2 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {5320#true} assume ~i - 2 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {5320#true} assume !(~i <= 0); {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L272 TraceCheckUtils]: 10: Hoare triple {5320#true} call #t~ret0 := rec1(~i - 2); {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {5320#true} assume ~i - 2 >= -2147483648; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {5320#true} assume ~i - 2 <= 2147483647; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {5320#true} assume !(~i <= 0); {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {5320#true} ~i := #in~i; {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L272 TraceCheckUtils]: 5: Hoare triple {5320#true} call #t~ret3 := rec1(~j); {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {5320#true} assume !(~j <= 0); {5320#true} is VALID [2022-02-21 03:02:41,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {5320#true} ~j := #in~j; {5320#true} is VALID [2022-02-21 03:02:41,929 INFO L272 TraceCheckUtils]: 2: Hoare triple {5320#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {5320#true} is VALID [2022-02-21 03:02:41,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {5320#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {5320#true} is VALID [2022-02-21 03:02:41,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {5320#true} assume { :begin_inline_ULTIMATE.init } true; {5320#true} is VALID [2022-02-21 03:02:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-21 03:02:41,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904512028] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:41,929 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:41,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-21 03:02:41,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520276985] [2022-02-21 03:02:41,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2022-02-21 03:02:41,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:41,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-21 03:02:41,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:41,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:02:41,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:02:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:02:41,967 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-21 03:02:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,607 INFO L93 Difference]: Finished difference Result 200 states and 246 transitions. [2022-02-21 03:02:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:02:42,608 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2022-02-21 03:02:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-21 03:02:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 110 transitions. [2022-02-21 03:02:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-21 03:02:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 110 transitions. [2022-02-21 03:02:42,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 110 transitions. [2022-02-21 03:02:42,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:42,693 INFO L225 Difference]: With dead ends: 200 [2022-02-21 03:02:42,693 INFO L226 Difference]: Without dead ends: 124 [2022-02-21 03:02:42,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:02:42,694 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:42,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 301 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:02:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-21 03:02:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 100. [2022-02-21 03:02:42,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:42,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 100 states, 73 states have (on average 1.095890410958904) internal successors, (80), 75 states have internal predecessors, (80), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:02:42,748 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 100 states, 73 states have (on average 1.095890410958904) internal successors, (80), 75 states have internal predecessors, (80), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:02:42,748 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 100 states, 73 states have (on average 1.095890410958904) internal successors, (80), 75 states have internal predecessors, (80), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:02:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,750 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2022-02-21 03:02:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2022-02-21 03:02:42,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:42,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:42,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 73 states have (on average 1.095890410958904) internal successors, (80), 75 states have internal predecessors, (80), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 124 states. [2022-02-21 03:02:42,751 INFO L87 Difference]: Start difference. First operand has 100 states, 73 states have (on average 1.095890410958904) internal successors, (80), 75 states have internal predecessors, (80), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 124 states. [2022-02-21 03:02:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,753 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2022-02-21 03:02:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2022-02-21 03:02:42,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:42,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:42,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:42,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.095890410958904) internal successors, (80), 75 states have internal predecessors, (80), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:02:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-02-21 03:02:42,756 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 46 [2022-02-21 03:02:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:42,756 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-02-21 03:02:42,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-21 03:02:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-02-21 03:02:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-21 03:02:42,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:42,756 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:42,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:02:42,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-21 03:02:42,964 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:42,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:42,964 INFO L85 PathProgramCache]: Analyzing trace with hash 641343195, now seen corresponding path program 1 times [2022-02-21 03:02:42,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:42,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584401850] [2022-02-21 03:02:42,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:42,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:42,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:02:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6288#true} is VALID [2022-02-21 03:02:43,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {6288#true} assume true; {6288#true} is VALID [2022-02-21 03:02:43,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6288#true} {6288#true} #51#return; {6288#true} is VALID [2022-02-21 03:02:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6288#true} is VALID [2022-02-21 03:02:43,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {6288#true} assume true; {6288#true} is VALID [2022-02-21 03:02:43,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6288#true} {6288#true} #53#return; {6288#true} is VALID [2022-02-21 03:02:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6335#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:43,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {6335#(<= |rec1_#res| 0)} assume true; {6335#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:43,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6335#(<= |rec1_#res| 0)} {6288#true} #55#return; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {6288#true} assume !(~i <= 0); {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {6288#true} assume ~i - 2 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {6288#true} assume ~i - 2 >= -2147483648; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {6288#true} call #t~ret0 := rec1(~i - 2); {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {6288#true} assume true; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6288#true} {6288#true} #51#return; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {6288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {6288#true} assume #t~ret0 - 1 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {6288#true} assume #t~ret0 - 1 >= -2147483648; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L272 TraceCheckUtils]: 12: Hoare triple {6288#true} call #t~ret1 := rec1(#t~ret0 - 1); {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {6288#true} assume true; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6288#true} {6288#true} #53#return; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {6288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,032 INFO L272 TraceCheckUtils]: 18: Hoare triple {6288#true} call #t~ret2 := rec1(#t~ret1); {6288#true} is VALID [2022-02-21 03:02:43,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6335#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:43,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {6335#(<= |rec1_#res| 0)} assume true; {6335#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:43,033 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6335#(<= |rec1_#res| 0)} {6288#true} #55#return; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 <= 2147483647; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6334#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:43,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {6334#(<= |rec1_#res| 1)} assume true; {6334#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:43,035 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6334#(<= |rec1_#res| 1)} {6288#true} #57#return; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {6288#true} assume { :begin_inline_ULTIMATE.init } true; {6288#true} is VALID [2022-02-21 03:02:43,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {6288#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6288#true} is VALID [2022-02-21 03:02:43,035 INFO L272 TraceCheckUtils]: 2: Hoare triple {6288#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {6288#true} is VALID [2022-02-21 03:02:43,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {6288#true} ~j := #in~j; {6288#true} is VALID [2022-02-21 03:02:43,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {6288#true} assume !(~j <= 0); {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L272 TraceCheckUtils]: 5: Hoare triple {6288#true} call #t~ret3 := rec1(~j); {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {6288#true} assume !(~i <= 0); {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {6288#true} assume ~i - 2 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {6288#true} assume ~i - 2 >= -2147483648; {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L272 TraceCheckUtils]: 10: Hoare triple {6288#true} call #t~ret0 := rec1(~i - 2); {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {6288#true} assume true; {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6288#true} {6288#true} #51#return; {6288#true} is VALID [2022-02-21 03:02:43,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {6288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {6288#true} assume #t~ret0 - 1 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {6288#true} assume #t~ret0 - 1 >= -2147483648; {6288#true} is VALID [2022-02-21 03:02:43,037 INFO L272 TraceCheckUtils]: 18: Hoare triple {6288#true} call #t~ret1 := rec1(#t~ret0 - 1); {6288#true} is VALID [2022-02-21 03:02:43,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6288#true} is VALID [2022-02-21 03:02:43,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {6288#true} assume true; {6288#true} is VALID [2022-02-21 03:02:43,037 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6288#true} {6288#true} #53#return; {6288#true} is VALID [2022-02-21 03:02:43,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {6288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,037 INFO L272 TraceCheckUtils]: 24: Hoare triple {6288#true} call #t~ret2 := rec1(#t~ret1); {6288#true} is VALID [2022-02-21 03:02:43,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6335#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:43,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {6335#(<= |rec1_#res| 0)} assume true; {6335#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:43,039 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6335#(<= |rec1_#res| 0)} {6288#true} #55#return; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 <= 2147483647; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6334#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:43,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {6334#(<= |rec1_#res| 1)} assume true; {6334#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:43,040 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6334#(<= |rec1_#res| 1)} {6288#true} #57#return; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} assume #t~ret3 - 1 <= 2147483647; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} assume #t~ret3 - 1 >= -2147483648; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,041 INFO L272 TraceCheckUtils]: 37: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3 - 1); {6319#(<= |rec2_#in~j| 0)} is VALID [2022-02-21 03:02:43,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {6319#(<= |rec2_#in~j| 0)} ~j := #in~j; {6320#(<= rec2_~j 0)} is VALID [2022-02-21 03:02:43,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {6320#(<= rec2_~j 0)} assume !(~j <= 0); {6289#false} is VALID [2022-02-21 03:02:43,042 INFO L272 TraceCheckUtils]: 40: Hoare triple {6289#false} call #t~ret3 := rec1(~j); {6289#false} is VALID [2022-02-21 03:02:43,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {6289#false} ~i := #in~i; {6289#false} is VALID [2022-02-21 03:02:43,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {6289#false} assume !(~i <= 0); {6289#false} is VALID [2022-02-21 03:02:43,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {6289#false} assume !(~i - 2 <= 2147483647); {6289#false} is VALID [2022-02-21 03:02:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:02:43,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:43,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584401850] [2022-02-21 03:02:43,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584401850] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:43,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966533119] [2022-02-21 03:02:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:43,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:43,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:43,044 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) [2022-02-21 03:02:43,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:02:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:02:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:43,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {6288#true} assume { :begin_inline_ULTIMATE.init } true; {6288#true} is VALID [2022-02-21 03:02:43,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {6288#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6288#true} is VALID [2022-02-21 03:02:43,196 INFO L272 TraceCheckUtils]: 2: Hoare triple {6288#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {6288#true} is VALID [2022-02-21 03:02:43,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {6288#true} ~j := #in~j; {6288#true} is VALID [2022-02-21 03:02:43,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {6288#true} assume !(~j <= 0); {6288#true} is VALID [2022-02-21 03:02:43,197 INFO L272 TraceCheckUtils]: 5: Hoare triple {6288#true} call #t~ret3 := rec1(~j); {6288#true} is VALID [2022-02-21 03:02:43,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {6288#true} assume !(~i <= 0); {6288#true} is VALID [2022-02-21 03:02:43,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {6288#true} assume ~i - 2 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {6288#true} assume ~i - 2 >= -2147483648; {6288#true} is VALID [2022-02-21 03:02:43,197 INFO L272 TraceCheckUtils]: 10: Hoare triple {6288#true} call #t~ret0 := rec1(~i - 2); {6288#true} is VALID [2022-02-21 03:02:43,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6288#true} is VALID [2022-02-21 03:02:43,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {6288#true} assume true; {6288#true} is VALID [2022-02-21 03:02:43,198 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6288#true} {6288#true} #51#return; {6288#true} is VALID [2022-02-21 03:02:43,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {6288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {6288#true} assume #t~ret0 - 1 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {6288#true} assume #t~ret0 - 1 >= -2147483648; {6288#true} is VALID [2022-02-21 03:02:43,198 INFO L272 TraceCheckUtils]: 18: Hoare triple {6288#true} call #t~ret1 := rec1(#t~ret0 - 1); {6288#true} is VALID [2022-02-21 03:02:43,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6288#true} is VALID [2022-02-21 03:02:43,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {6288#true} assume true; {6288#true} is VALID [2022-02-21 03:02:43,199 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6288#true} {6288#true} #53#return; {6288#true} is VALID [2022-02-21 03:02:43,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {6288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,199 INFO L272 TraceCheckUtils]: 24: Hoare triple {6288#true} call #t~ret2 := rec1(#t~ret1); {6288#true} is VALID [2022-02-21 03:02:43,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6335#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:43,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {6335#(<= |rec1_#res| 0)} assume true; {6335#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:43,200 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6335#(<= |rec1_#res| 0)} {6288#true} #55#return; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 <= 2147483647; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6334#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:43,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {6334#(<= |rec1_#res| 1)} assume true; {6334#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:43,202 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6334#(<= |rec1_#res| 1)} {6288#true} #57#return; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} assume #t~ret3 - 1 <= 2147483647; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} assume #t~ret3 - 1 >= -2147483648; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,203 INFO L272 TraceCheckUtils]: 37: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3 - 1); {6319#(<= |rec2_#in~j| 0)} is VALID [2022-02-21 03:02:43,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {6319#(<= |rec2_#in~j| 0)} ~j := #in~j; {6320#(<= rec2_~j 0)} is VALID [2022-02-21 03:02:43,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {6320#(<= rec2_~j 0)} assume !(~j <= 0); {6289#false} is VALID [2022-02-21 03:02:43,204 INFO L272 TraceCheckUtils]: 40: Hoare triple {6289#false} call #t~ret3 := rec1(~j); {6289#false} is VALID [2022-02-21 03:02:43,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {6289#false} ~i := #in~i; {6289#false} is VALID [2022-02-21 03:02:43,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {6289#false} assume !(~i <= 0); {6289#false} is VALID [2022-02-21 03:02:43,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {6289#false} assume !(~i - 2 <= 2147483647); {6289#false} is VALID [2022-02-21 03:02:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:02:43,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:43,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {6289#false} assume !(~i - 2 <= 2147483647); {6289#false} is VALID [2022-02-21 03:02:43,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {6289#false} assume !(~i <= 0); {6289#false} is VALID [2022-02-21 03:02:43,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {6289#false} ~i := #in~i; {6289#false} is VALID [2022-02-21 03:02:43,532 INFO L272 TraceCheckUtils]: 40: Hoare triple {6289#false} call #t~ret3 := rec1(~j); {6289#false} is VALID [2022-02-21 03:02:43,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {6320#(<= rec2_~j 0)} assume !(~j <= 0); {6289#false} is VALID [2022-02-21 03:02:43,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {6319#(<= |rec2_#in~j| 0)} ~j := #in~j; {6320#(<= rec2_~j 0)} is VALID [2022-02-21 03:02:43,533 INFO L272 TraceCheckUtils]: 37: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3 - 1); {6319#(<= |rec2_#in~j| 0)} is VALID [2022-02-21 03:02:43,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} assume #t~ret3 - 1 >= -2147483648; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} assume #t~ret3 - 1 <= 2147483647; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {6318#(<= |rec2_#t~ret3| 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,534 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6334#(<= |rec1_#res| 1)} {6288#true} #57#return; {6318#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:02:43,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {6334#(<= |rec1_#res| 1)} assume true; {6334#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:43,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6334#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:02:43,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume 1 + #t~ret2 <= 2147483647; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {6333#(<= |rec1_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,536 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6335#(<= |rec1_#res| 0)} {6288#true} #55#return; {6333#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:02:43,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {6335#(<= |rec1_#res| 0)} assume true; {6335#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:43,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6335#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:02:43,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,537 INFO L272 TraceCheckUtils]: 24: Hoare triple {6288#true} call #t~ret2 := rec1(#t~ret1); {6288#true} is VALID [2022-02-21 03:02:43,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {6288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,537 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6288#true} {6288#true} #53#return; {6288#true} is VALID [2022-02-21 03:02:43,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {6288#true} assume true; {6288#true} is VALID [2022-02-21 03:02:43,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6288#true} is VALID [2022-02-21 03:02:43,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,537 INFO L272 TraceCheckUtils]: 18: Hoare triple {6288#true} call #t~ret1 := rec1(#t~ret0 - 1); {6288#true} is VALID [2022-02-21 03:02:43,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {6288#true} assume #t~ret0 - 1 >= -2147483648; {6288#true} is VALID [2022-02-21 03:02:43,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {6288#true} assume #t~ret0 - 1 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {6288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,538 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6288#true} {6288#true} #51#return; {6288#true} is VALID [2022-02-21 03:02:43,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {6288#true} assume true; {6288#true} is VALID [2022-02-21 03:02:43,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {6288#true} assume ~i <= 0;#res := 0; {6288#true} is VALID [2022-02-21 03:02:43,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,538 INFO L272 TraceCheckUtils]: 10: Hoare triple {6288#true} call #t~ret0 := rec1(~i - 2); {6288#true} is VALID [2022-02-21 03:02:43,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {6288#true} assume ~i - 2 >= -2147483648; {6288#true} is VALID [2022-02-21 03:02:43,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {6288#true} assume ~i - 2 <= 2147483647; {6288#true} is VALID [2022-02-21 03:02:43,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {6288#true} assume !(~i <= 0); {6288#true} is VALID [2022-02-21 03:02:43,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {6288#true} ~i := #in~i; {6288#true} is VALID [2022-02-21 03:02:43,539 INFO L272 TraceCheckUtils]: 5: Hoare triple {6288#true} call #t~ret3 := rec1(~j); {6288#true} is VALID [2022-02-21 03:02:43,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {6288#true} assume !(~j <= 0); {6288#true} is VALID [2022-02-21 03:02:43,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {6288#true} ~j := #in~j; {6288#true} is VALID [2022-02-21 03:02:43,539 INFO L272 TraceCheckUtils]: 2: Hoare triple {6288#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {6288#true} is VALID [2022-02-21 03:02:43,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {6288#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6288#true} is VALID [2022-02-21 03:02:43,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {6288#true} assume { :begin_inline_ULTIMATE.init } true; {6288#true} is VALID [2022-02-21 03:02:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:02:43,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966533119] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:43,540 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:43,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2022-02-21 03:02:43,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580100833] [2022-02-21 03:02:43,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:43,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-02-21 03:02:43,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:43,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:43,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:43,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:02:43,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:02:43,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:02:43,566 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:43,734 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-02-21 03:02:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:02:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-02-21 03:02:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-02-21 03:02:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-02-21 03:02:43,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-02-21 03:02:43,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:43,791 INFO L225 Difference]: With dead ends: 119 [2022-02-21 03:02:43,791 INFO L226 Difference]: Without dead ends: 61 [2022-02-21 03:02:43,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:02:43,794 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:43,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 187 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-21 03:02:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-02-21 03:02:43,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:43,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:43,825 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:43,825 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:43,826 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-02-21 03:02:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-02-21 03:02:43,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:43,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:43,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 61 states. [2022-02-21 03:02:43,827 INFO L87 Difference]: Start difference. First operand has 59 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 61 states. [2022-02-21 03:02:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:43,828 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-02-21 03:02:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-02-21 03:02:43,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:43,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:43,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:43,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-02-21 03:02:43,830 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 44 [2022-02-21 03:02:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:43,830 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-02-21 03:02:43,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:02:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-02-21 03:02:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-21 03:02:43,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:43,831 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:43,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-21 03:02:44,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-21 03:02:44,049 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:44,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash 640030532, now seen corresponding path program 1 times [2022-02-21 03:02:44,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:44,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947473309] [2022-02-21 03:02:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:02:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {6942#true} assume ~i <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6942#true} {6942#true} #51#return; {6942#true} is VALID [2022-02-21 03:02:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {6942#true} assume ~i <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6942#true} {6942#true} #53#return; {6942#true} is VALID [2022-02-21 03:02:44,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {6942#true} assume ~i <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6942#true} {6942#true} #55#return; {6942#true} is VALID [2022-02-21 03:02:44,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {6942#true} assume !(~i <= 0); {6942#true} is VALID [2022-02-21 03:02:44,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume ~i - 2 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {6942#true} assume ~i - 2 >= -2147483648; {6942#true} is VALID [2022-02-21 03:02:44,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {6942#true} call #t~ret0 := rec1(~i - 2); {6942#true} is VALID [2022-02-21 03:02:44,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {6942#true} assume ~i <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6942#true} {6942#true} #51#return; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {6942#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {6942#true} assume #t~ret0 - 1 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {6942#true} assume #t~ret0 - 1 >= -2147483648; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L272 TraceCheckUtils]: 12: Hoare triple {6942#true} call #t~ret1 := rec1(#t~ret0 - 1); {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {6942#true} assume ~i <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6942#true} {6942#true} #53#return; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {6942#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L272 TraceCheckUtils]: 18: Hoare triple {6942#true} call #t~ret2 := rec1(#t~ret1); {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {6942#true} assume ~i <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,115 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6942#true} {6942#true} #55#return; {6942#true} is VALID [2022-02-21 03:02:44,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {6942#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {6942#true} assume 1 + #t~ret2 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {6942#true} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6942#true} is VALID [2022-02-21 03:02:44,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,115 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6942#true} {6942#true} #57#return; {6942#true} is VALID [2022-02-21 03:02:44,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-21 03:02:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {6942#true} ~j := #in~j; {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {6942#true} assume ~j <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6942#true} {6942#true} #59#return; {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {6942#true} assume { :begin_inline_ULTIMATE.init } true; {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {6942#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L272 TraceCheckUtils]: 2: Hoare triple {6942#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {6942#true} ~j := #in~j; {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {6942#true} assume !(~j <= 0); {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L272 TraceCheckUtils]: 5: Hoare triple {6942#true} call #t~ret3 := rec1(~j); {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {6942#true} assume !(~i <= 0); {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {6942#true} assume ~i - 2 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {6942#true} assume ~i - 2 >= -2147483648; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L272 TraceCheckUtils]: 10: Hoare triple {6942#true} call #t~ret0 := rec1(~i - 2); {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {6942#true} assume ~i <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6942#true} {6942#true} #51#return; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {6942#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {6942#true} assume #t~ret0 - 1 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {6942#true} assume #t~ret0 - 1 >= -2147483648; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L272 TraceCheckUtils]: 18: Hoare triple {6942#true} call #t~ret1 := rec1(#t~ret0 - 1); {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {6942#true} assume ~i <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6942#true} {6942#true} #53#return; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {6942#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L272 TraceCheckUtils]: 24: Hoare triple {6942#true} call #t~ret2 := rec1(#t~ret1); {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {6942#true} ~i := #in~i; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {6942#true} assume ~i <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,119 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6942#true} {6942#true} #55#return; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {6942#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {6942#true} assume 1 + #t~ret2 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {6942#true} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6942#true} {6942#true} #57#return; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {6942#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {6942#true} assume #t~ret3 - 1 <= 2147483647; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {6942#true} assume #t~ret3 - 1 >= -2147483648; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L272 TraceCheckUtils]: 37: Hoare triple {6942#true} call #t~ret4 := rec2(#t~ret3 - 1); {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {6942#true} ~j := #in~j; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {6942#true} assume ~j <= 0;#res := 0; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6942#true} {6942#true} #59#return; {6942#true} is VALID [2022-02-21 03:02:44,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {6942#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6976#(<= |rec2_#t~ret4| 2147483647)} is VALID [2022-02-21 03:02:44,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {6976#(<= |rec2_#t~ret4| 2147483647)} assume !(#t~ret4 - 1 <= 2147483647); {6943#false} is VALID [2022-02-21 03:02:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-21 03:02:44,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:44,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947473309] [2022-02-21 03:02:44,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947473309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:44,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:44,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:44,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867313660] [2022-02-21 03:02:44,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:44,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2022-02-21 03:02:44,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:44,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:44,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:44,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:44,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:44,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:44,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:44,140 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,188 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-02-21 03:02:44,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:44,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2022-02-21 03:02:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-21 03:02:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-21 03:02:44,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-02-21 03:02:44,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:44,222 INFO L225 Difference]: With dead ends: 59 [2022-02-21 03:02:44,222 INFO L226 Difference]: Without dead ends: 58 [2022-02-21 03:02:44,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:44,223 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:44,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-21 03:02:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-21 03:02:44,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:44,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:44,256 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:44,256 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,258 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-02-21 03:02:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-02-21 03:02:44,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:44,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:44,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 58 states. [2022-02-21 03:02:44,258 INFO L87 Difference]: Start difference. First operand has 58 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 58 states. [2022-02-21 03:02:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,259 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-02-21 03:02:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-02-21 03:02:44,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:44,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:44,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:44,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-02-21 03:02:44,260 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-02-21 03:02:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:44,260 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-02-21 03:02:44,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-02-21 03:02:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:02:44,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:44,261 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:44,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 03:02:44,261 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:02:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:44,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1633889918, now seen corresponding path program 1 times [2022-02-21 03:02:44,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:44,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518219682] [2022-02-21 03:02:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:44,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:02:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {7254#true} assume ~i <= 0;#res := 0; {7254#true} is VALID [2022-02-21 03:02:44,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7254#true} {7254#true} #51#return; {7254#true} is VALID [2022-02-21 03:02:44,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {7254#true} assume ~i <= 0;#res := 0; {7254#true} is VALID [2022-02-21 03:02:44,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7254#true} {7254#true} #53#return; {7254#true} is VALID [2022-02-21 03:02:44,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {7254#true} assume ~i <= 0;#res := 0; {7254#true} is VALID [2022-02-21 03:02:44,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7254#true} {7254#true} #55#return; {7254#true} is VALID [2022-02-21 03:02:44,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {7254#true} assume !(~i <= 0); {7254#true} is VALID [2022-02-21 03:02:44,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {7254#true} assume ~i - 2 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {7254#true} assume ~i - 2 >= -2147483648; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {7254#true} call #t~ret0 := rec1(~i - 2); {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {7254#true} assume ~i <= 0;#res := 0; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {7254#true} {7254#true} #51#return; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {7254#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {7254#true} assume #t~ret0 - 1 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {7254#true} assume #t~ret0 - 1 >= -2147483648; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L272 TraceCheckUtils]: 12: Hoare triple {7254#true} call #t~ret1 := rec1(#t~ret0 - 1); {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {7254#true} assume ~i <= 0;#res := 0; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7254#true} {7254#true} #53#return; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {7254#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L272 TraceCheckUtils]: 18: Hoare triple {7254#true} call #t~ret2 := rec1(#t~ret1); {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {7254#true} assume ~i <= 0;#res := 0; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7254#true} {7254#true} #55#return; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {7254#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {7254#true} assume 1 + #t~ret2 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {7254#true} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {7254#true} is VALID [2022-02-21 03:02:44,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,321 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7254#true} {7254#true} #57#return; {7254#true} is VALID [2022-02-21 03:02:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-21 03:02:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:44,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {7254#true} ~j := #in~j; {7254#true} is VALID [2022-02-21 03:02:44,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {7254#true} assume ~j <= 0;#res := 0; {7301#(<= 0 |rec2_#res|)} is VALID [2022-02-21 03:02:44,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {7301#(<= 0 |rec2_#res|)} assume true; {7301#(<= 0 |rec2_#res|)} is VALID [2022-02-21 03:02:44,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7301#(<= 0 |rec2_#res|)} {7254#true} #59#return; {7288#(<= 0 |rec2_#t~ret4|)} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {7254#true} assume { :begin_inline_ULTIMATE.init } true; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {7254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L272 TraceCheckUtils]: 2: Hoare triple {7254#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {7254#true} ~j := #in~j; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {7254#true} assume !(~j <= 0); {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L272 TraceCheckUtils]: 5: Hoare triple {7254#true} call #t~ret3 := rec1(~j); {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {7254#true} assume !(~i <= 0); {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {7254#true} assume ~i - 2 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {7254#true} assume ~i - 2 >= -2147483648; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L272 TraceCheckUtils]: 10: Hoare triple {7254#true} call #t~ret0 := rec1(~i - 2); {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {7254#true} assume ~i <= 0;#res := 0; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7254#true} {7254#true} #51#return; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {7254#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {7254#true} assume #t~ret0 - 1 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {7254#true} assume #t~ret0 - 1 >= -2147483648; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L272 TraceCheckUtils]: 18: Hoare triple {7254#true} call #t~ret1 := rec1(#t~ret0 - 1); {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {7254#true} assume ~i <= 0;#res := 0; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7254#true} {7254#true} #53#return; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {7254#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L272 TraceCheckUtils]: 24: Hoare triple {7254#true} call #t~ret2 := rec1(#t~ret1); {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {7254#true} ~i := #in~i; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {7254#true} assume ~i <= 0;#res := 0; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7254#true} {7254#true} #55#return; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {7254#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {7254#true} assume 1 + #t~ret2 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {7254#true} assume 1 + #t~ret2 >= -2147483648;#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {7254#true} assume true; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7254#true} {7254#true} #57#return; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {7254#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {7254#true} assume #t~ret3 - 1 <= 2147483647; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {7254#true} assume #t~ret3 - 1 >= -2147483648; {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L272 TraceCheckUtils]: 37: Hoare triple {7254#true} call #t~ret4 := rec2(#t~ret3 - 1); {7254#true} is VALID [2022-02-21 03:02:44,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {7254#true} ~j := #in~j; {7254#true} is VALID [2022-02-21 03:02:44,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {7254#true} assume ~j <= 0;#res := 0; {7301#(<= 0 |rec2_#res|)} is VALID [2022-02-21 03:02:44,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {7301#(<= 0 |rec2_#res|)} assume true; {7301#(<= 0 |rec2_#res|)} is VALID [2022-02-21 03:02:44,332 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7301#(<= 0 |rec2_#res|)} {7254#true} #59#return; {7288#(<= 0 |rec2_#t~ret4|)} is VALID [2022-02-21 03:02:44,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {7288#(<= 0 |rec2_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7288#(<= 0 |rec2_#t~ret4|)} is VALID [2022-02-21 03:02:44,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {7288#(<= 0 |rec2_#t~ret4|)} assume #t~ret4 - 1 <= 2147483647; {7288#(<= 0 |rec2_#t~ret4|)} is VALID [2022-02-21 03:02:44,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {7288#(<= 0 |rec2_#t~ret4|)} assume !(#t~ret4 - 1 >= -2147483648); {7255#false} is VALID [2022-02-21 03:02:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-21 03:02:44,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:44,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518219682] [2022-02-21 03:02:44,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518219682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:44,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:44,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:02:44,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625682293] [2022-02-21 03:02:44,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:44,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2022-02-21 03:02:44,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:44,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:44,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:44,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:02:44,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:44,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:02:44,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:44,356 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:44,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,439 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-02-21 03:02:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:02:44,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2022-02-21 03:02:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-21 03:02:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-21 03:02:44,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-02-21 03:02:44,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:44,465 INFO L225 Difference]: With dead ends: 58 [2022-02-21 03:02:44,465 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:02:44,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:44,465 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:44,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:02:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:02:44,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:44,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-02-21 03:02:44,466 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-02-21 03:02:44,466 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-02-21 03:02:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,466 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:02:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:44,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:44,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:44,466 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-21 03:02:44,466 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-21 03:02:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,466 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:02:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:44,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:44,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:44,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:44,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:44,467 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) [2022-02-21 03:02:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:02:44,467 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-02-21 03:02:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:44,467 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:02:44,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:44,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:44,469 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-02-21 03:02:44,469 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-02-21 03:02:44,469 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-02-21 03:02:44,469 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-02-21 03:02:44,469 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-02-21 03:02:44,470 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-02-21 03:02:44,470 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-02-21 03:02:44,470 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-02-21 03:02:44,470 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-02-21 03:02:44,470 INFO L764 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-02-21 03:02:44,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-21 03:02:44,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:02:44,680 INFO L858 garLoopResultBuilder]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,680 INFO L858 garLoopResultBuilder]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L861 garLoopResultBuilder]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L854 garLoopResultBuilder]: At program point L14-2(line 14) the Hoare annotation is: (or (not (<= |rec1_#in~i| 2147483647)) (and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))) [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point L14-3(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point L14-4(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point L14-5(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L854 garLoopResultBuilder]: At program point L14-6(line 14) the Hoare annotation is: (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (not (<= |rec1_#in~i| 2147483647))) [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point L14-7(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,681 INFO L854 garLoopResultBuilder]: At program point L14-8(line 14) the Hoare annotation is: (and (not (<= |rec1_#in~i| 0)) (or (and (<= |rec1_#t~ret1| 0) (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) (not (<= |rec1_#in~i| 2147483647)))) [2022-02-21 03:02:44,681 INFO L858 garLoopResultBuilder]: For program point L14-9(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L14-10(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L14-11(line 14) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L854 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (and (not (<= |rec2_#in~j| 0)) (or (not (<= |rec2_#in~j| 2147483647)) (and (<= 1 rec2_~j) (<= rec2_~j 2147483647)))) [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 19) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L854 garLoopResultBuilder]: At program point L20-4(line 20) the Hoare annotation is: (and (or (not (<= |rec2_#in~j| 2147483647)) (and (<= |rec2_#t~ret3| 1) (<= 1 |rec2_#t~ret3|) (<= 1 rec2_~j) (<= rec2_~j 2147483647))) (not (<= |rec2_#in~j| 0))) [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L20-5(line 20) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L20-6(line 20) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L20-7(line 20) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L861 garLoopResultBuilder]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:02:44,682 INFO L854 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (<= |ULTIMATE.start_main_~x~0#1| 2147483647) [2022-02-21 03:02:44,682 INFO L858 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-02-21 03:02:44,683 INFO L858 garLoopResultBuilder]: For program point L23(lines 23 26) no Hoare annotation was computed. [2022-02-21 03:02:44,684 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:44,685 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:02:44,687 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-21 03:02:44,687 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:02:44,687 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:02:44,687 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-21 03:02:44,687 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: rec1FINAL has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: rec2FINAL has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: rec1EXIT has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: rec1EXIT has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: rec1EXIT has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: rec1EXIT has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: rec2EXIT has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: rec2EXIT has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-7 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-9 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-9 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-10 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L14-10 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-21 03:02:44,688 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:02:44,689 WARN L170 areAnnotationChecker]: L14-5 has no Hoare annotation [2022-02-21 03:02:44,689 WARN L170 areAnnotationChecker]: L14-5 has no Hoare annotation [2022-02-21 03:02:44,689 WARN L170 areAnnotationChecker]: L14-11 has no Hoare annotation [2022-02-21 03:02:44,689 WARN L170 areAnnotationChecker]: L14-11 has no Hoare annotation [2022-02-21 03:02:44,689 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2022-02-21 03:02:44,689 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2022-02-21 03:02:44,689 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2022-02-21 03:02:44,689 WARN L170 areAnnotationChecker]: L14-7 has no Hoare annotation [2022-02-21 03:02:44,689 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:02:44,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:02:44 BoogieIcfgContainer [2022-02-21 03:02:44,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:02:44,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:02:44,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:02:44,690 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:02:44,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:36" (3/4) ... [2022-02-21 03:02:44,692 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:02:44,695 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2022-02-21 03:02:44,695 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2022-02-21 03:02:44,698 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-21 03:02:44,698 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:02:44,698 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:02:44,717 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:02:44,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:02:44,718 INFO L158 Benchmark]: Toolchain (without parser) took 8252.04ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 56.3MB in the beginning and 98.0MB in the end (delta: -41.7MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2022-02-21 03:02:44,718 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 88.1MB. Free memory was 42.5MB in the beginning and 42.4MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:02:44,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.11ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 65.4MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:02:44,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.09ms. Allocated memory is still 88.1MB. Free memory was 65.4MB in the beginning and 64.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:02:44,719 INFO L158 Benchmark]: Boogie Preprocessor took 24.31ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 63.1MB in the end (delta: 906.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:02:44,719 INFO L158 Benchmark]: RCFGBuilder took 268.68ms. Allocated memory is still 88.1MB. Free memory was 63.1MB in the beginning and 51.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:02:44,719 INFO L158 Benchmark]: TraceAbstraction took 7765.56ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 50.6MB in the beginning and 100.1MB in the end (delta: -49.4MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-02-21 03:02:44,719 INFO L158 Benchmark]: Witness Printer took 27.96ms. Allocated memory is still 157.3MB. Free memory was 100.1MB in the beginning and 98.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:02:44,720 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 88.1MB. Free memory was 42.5MB in the beginning and 42.4MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.11ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 65.4MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.09ms. Allocated memory is still 88.1MB. Free memory was 65.4MB in the beginning and 64.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.31ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 63.1MB in the end (delta: 906.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 268.68ms. Allocated memory is still 88.1MB. Free memory was 63.1MB in the beginning and 51.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7765.56ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 50.6MB in the beginning and 100.1MB in the end (delta: -49.4MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Witness Printer took 27.96ms. Allocated memory is still 157.3MB. Free memory was 100.1MB in the beginning and 98.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: 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, 45 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 2412 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1742 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582 IncrementalHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 670 mSDtfsCounter, 582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=14, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 101 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 194 PreInvPairs, 201 NumberOfFragments, 92 HoareAnnotationTreeSize, 194 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 613 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 565 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 634 ConstructedInterpolants, 0 QuantifiedInterpolants, 952 SizeOfPredicates, 2 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 446/458 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-21 03:02:44,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE