./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6b0b5eb73c85bd27f01305782cc76399fba05e9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:46:39,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:46:39,915 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:46:39,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:46:39,923 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:46:39,924 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:46:39,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:46:39,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:46:39,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:46:39,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:46:39,928 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:46:39,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:46:39,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:46:39,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:46:39,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:46:39,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:46:39,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:46:39,934 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:46:39,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:46:39,936 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:46:39,937 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:46:39,938 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:46:39,940 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:46:39,940 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:46:39,940 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:46:39,941 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:46:39,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:46:39,942 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:46:39,942 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:46:39,943 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:46:39,943 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:46:39,944 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:46:39,944 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:46:39,944 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:46:39,945 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:46:39,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:46:39,946 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 04:46:39,956 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:46:39,956 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:46:39,957 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:46:39,958 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:46:39,958 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:46:39,958 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:46:39,958 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:46:39,958 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:46:39,958 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:46:39,958 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:46:39,958 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:46:39,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:46:39,959 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:46:39,959 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:46:39,959 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:46:39,959 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:46:39,959 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:46:39,959 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:46:39,960 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:46:39,960 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:46:39,960 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:46:39,960 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:46:39,960 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:46:39,960 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:46:39,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:46:39,963 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:46:39,963 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:46:39,963 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:46:39,964 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer 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(F end) ) 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 -> b6b0b5eb73c85bd27f01305782cc76399fba05e9 [2018-11-10 04:46:39,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:46:39,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:46:39,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:46:39,995 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:46:39,996 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:46:39,996 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca_true-termination_true-no-overflow.c.i [2018-11-10 04:46:40,031 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/data/8bc2e57d6/86dc21aa4f194313a32a8a24154f7e15/FLAG2015f0731 [2018-11-10 04:46:40,445 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:46:40,445 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/sv-benchmarks/c/termination-memory-alloca/c.07-alloca_true-termination_true-no-overflow.c.i [2018-11-10 04:46:40,451 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/data/8bc2e57d6/86dc21aa4f194313a32a8a24154f7e15/FLAG2015f0731 [2018-11-10 04:46:40,460 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/data/8bc2e57d6/86dc21aa4f194313a32a8a24154f7e15 [2018-11-10 04:46:40,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:46:40,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:46:40,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:46:40,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:46:40,466 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:46:40,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4562ca46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40, skipping insertion in model container [2018-11-10 04:46:40,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:46:40,499 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:46:40,674 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:46:40,682 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:46:40,710 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:46:40,731 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:46:40,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40 WrapperNode [2018-11-10 04:46:40,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:46:40,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:46:40,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:46:40,733 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:46:40,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:46:40,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:46:40,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:46:40,810 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:46:40,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (1/1) ... [2018-11-10 04:46:40,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:46:40,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:46:40,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:46:40,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:46:40,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea14798-0ce6-41c6-919b-f291466da386/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:46:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:46:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:46:40,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:46:41,108 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:46:41,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:46:41 BoogieIcfgContainer [2018-11-10 04:46:41,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:46:41,109 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:46:41,109 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:46:41,112 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:46:41,112 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:46:41,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:46:40" (1/3) ... [2018-11-10 04:46:41,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a84db43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:46:41, skipping insertion in model container [2018-11-10 04:46:41,113 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:46:41,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:40" (2/3) ... [2018-11-10 04:46:41,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a84db43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:46:41, skipping insertion in model container [2018-11-10 04:46:41,114 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:46:41,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:46:41" (3/3) ... [2018-11-10 04:46:41,115 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.07-alloca_true-termination_true-no-overflow.c.i [2018-11-10 04:46:41,151 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:46:41,152 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:46:41,152 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:46:41,152 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:46:41,152 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:46:41,152 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:46:41,152 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:46:41,152 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:46:41,152 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:46:41,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-10 04:46:41,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 04:46:41,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:41,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:41,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:41,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:41,183 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:46:41,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-10 04:46:41,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 04:46:41,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:41,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:41,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:41,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:41,191 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~i, test_fun_#in~j, test_fun_#in~k, test_fun_#in~tmp := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~i, test_fun_~j, test_fun_~k, test_fun_~tmp, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;test_fun_~k := test_fun_#in~k;test_fun_~tmp := test_fun_#in~tmp;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset; 28#L554true SUMMARY for call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L554 12#L554-1true SUMMARY for call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); srcloc: L554-1 8#L555true SUMMARY for call write~int(test_fun_~k, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L555 25#L556true SUMMARY for call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L556 5#L557true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L557 24#L559-13true [2018-11-10 04:46:41,192 INFO L795 eck$LassoCheckResult]: Loop: 24#L559-13true assume true; 20#L559true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L559 3#L559-1true test_fun_#t~short9 := test_fun_#t~mem7 <= 100; 6#L559-2true assume !test_fun_#t~short9; 29#L559-6true test_fun_#t~short11 := test_fun_#t~short9; 31#L559-7true assume !test_fun_#t~short11; 22#L559-11true assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short11;havoc test_fun_#t~mem10; 36#L560true SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L560 38#L560-1true SUMMARY for call write~int(test_fun_#t~mem12, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L560-1 23#L560-2true havoc test_fun_#t~mem12; 16#L561true SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); srcloc: L561 19#L561-1true SUMMARY for call write~int(test_fun_#t~mem13, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L561-1 21#L561-2true havoc test_fun_#t~mem13; 32#L562true SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L562 34#L562-1true SUMMARY for call write~int(test_fun_#t~mem14 + 1, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); srcloc: L562-1 37#L562-2true havoc test_fun_#t~mem14; 13#L563true SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L563 14#L563-1true SUMMARY for call write~int(test_fun_#t~mem15 - 1, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L563-1 17#L563-2true havoc test_fun_#t~mem15; 24#L559-13true [2018-11-10 04:46:41,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:41,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1802963362, now seen corresponding path program 1 times [2018-11-10 04:46:41,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:41,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:41,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash -302550279, now seen corresponding path program 1 times [2018-11-10 04:46:41,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:41,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:41,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:41,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:46:41,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:46:41,382 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:46:41,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:46:41,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:46:41,393 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-11-10 04:46:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:46:41,418 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-10 04:46:41,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:46:41,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 39 transitions. [2018-11-10 04:46:41,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 04:46:41,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 30 states and 31 transitions. [2018-11-10 04:46:41,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 04:46:41,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 04:46:41,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 31 transitions. [2018-11-10 04:46:41,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:46:41,428 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-10 04:46:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 31 transitions. [2018-11-10 04:46:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 04:46:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 04:46:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-10 04:46:41,452 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-10 04:46:41,453 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-10 04:46:41,453 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:46:41,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 31 transitions. [2018-11-10 04:46:41,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 04:46:41,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:41,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:41,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:41,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:41,455 INFO L793 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 91#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~i, test_fun_#in~j, test_fun_#in~k, test_fun_#in~tmp := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~i, test_fun_~j, test_fun_~k, test_fun_~tmp, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;test_fun_~k := test_fun_#in~k;test_fun_~tmp := test_fun_#in~tmp;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset; 92#L554 SUMMARY for call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L554 93#L554-1 SUMMARY for call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); srcloc: L554-1 89#L555 SUMMARY for call write~int(test_fun_~k, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L555 90#L556 SUMMARY for call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L556 84#L557 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L557 85#L559-13 [2018-11-10 04:46:41,455 INFO L795 eck$LassoCheckResult]: Loop: 85#L559-13 assume true; 101#L559 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L559 82#L559-1 test_fun_#t~short9 := test_fun_#t~mem7 <= 100; 83#L559-2 assume !test_fun_#t~short9; 87#L559-6 test_fun_#t~short11 := test_fun_#t~short9; 105#L559-7 assume test_fun_#t~short11; 107#L559-8 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L559-8 109#L559-9 test_fun_#t~short11 := test_fun_#t~mem10 > -2147483648; 102#L559-11 assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short11;havoc test_fun_#t~mem10; 103#L560 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L560 111#L560-1 SUMMARY for call write~int(test_fun_#t~mem12, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L560-1 104#L560-2 havoc test_fun_#t~mem12; 97#L561 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); srcloc: L561 98#L561-1 SUMMARY for call write~int(test_fun_#t~mem13, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L561-1 99#L561-2 havoc test_fun_#t~mem13; 100#L562 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L562 108#L562-1 SUMMARY for call write~int(test_fun_#t~mem14 + 1, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); srcloc: L562-1 110#L562-2 havoc test_fun_#t~mem14; 94#L563 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L563 95#L563-1 SUMMARY for call write~int(test_fun_#t~mem15 - 1, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L563-1 96#L563-2 havoc test_fun_#t~mem15; 85#L559-13 [2018-11-10 04:46:41,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:41,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1802963362, now seen corresponding path program 2 times [2018-11-10 04:46:41,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:41,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:41,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:41,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:41,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1236809212, now seen corresponding path program 1 times [2018-11-10 04:46:41,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:41,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:46:41,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:41,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:46:41,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:46:41,519 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:46:41,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:46:41,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:46:41,520 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-10 04:46:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:46:41,549 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-10 04:46:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:46:41,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 32 transitions. [2018-11-10 04:46:41,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 04:46:41,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 30 transitions. [2018-11-10 04:46:41,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 04:46:41,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 04:46:41,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 30 transitions. [2018-11-10 04:46:41,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:46:41,552 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-10 04:46:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 30 transitions. [2018-11-10 04:46:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 04:46:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 04:46:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-10 04:46:41,553 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-10 04:46:41,553 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-10 04:46:41,553 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:46:41,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 30 transitions. [2018-11-10 04:46:41,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 04:46:41,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:41,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:41,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:41,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:41,555 INFO L793 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~i, test_fun_#in~j, test_fun_#in~k, test_fun_#in~tmp := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~i, test_fun_~j, test_fun_~k, test_fun_~tmp, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;test_fun_~k := test_fun_#in~k;test_fun_~tmp := test_fun_#in~tmp;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset; 163#L554 SUMMARY for call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L554 164#L554-1 SUMMARY for call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); srcloc: L554-1 160#L555 SUMMARY for call write~int(test_fun_~k, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L555 161#L556 SUMMARY for call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L556 156#L557 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L557 157#L559-13 [2018-11-10 04:46:41,555 INFO L795 eck$LassoCheckResult]: Loop: 157#L559-13 assume true; 172#L559 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L559 153#L559-1 test_fun_#t~short9 := test_fun_#t~mem7 <= 100; 154#L559-2 assume test_fun_#t~short9; 155#L559-3 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); srcloc: L559-3 158#L559-4 test_fun_#t~short9 := test_fun_#t~mem8 <= test_fun_~k; 159#L559-6 test_fun_#t~short11 := test_fun_#t~short9; 176#L559-7 assume test_fun_#t~short11; 178#L559-8 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L559-8 180#L559-9 test_fun_#t~short11 := test_fun_#t~mem10 > -2147483648; 173#L559-11 assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short11;havoc test_fun_#t~mem10; 174#L560 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L560 182#L560-1 SUMMARY for call write~int(test_fun_#t~mem12, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L560-1 175#L560-2 havoc test_fun_#t~mem12; 168#L561 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); srcloc: L561 169#L561-1 SUMMARY for call write~int(test_fun_#t~mem13, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4); srcloc: L561-1 170#L561-2 havoc test_fun_#t~mem13; 171#L562 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L562 179#L562-1 SUMMARY for call write~int(test_fun_#t~mem14 + 1, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4); srcloc: L562-1 181#L562-2 havoc test_fun_#t~mem14; 165#L563 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L563 166#L563-1 SUMMARY for call write~int(test_fun_#t~mem15 - 1, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4); srcloc: L563-1 167#L563-2 havoc test_fun_#t~mem15; 157#L559-13 [2018-11-10 04:46:41,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:41,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1802963362, now seen corresponding path program 3 times [2018-11-10 04:46:41,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:41,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:41,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:41,592 INFO L82 PathProgramCache]: Analyzing trace with hash 905451231, now seen corresponding path program 1 times [2018-11-10 04:46:41,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:41,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:41,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:46:41,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:41,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:41,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1604438046, now seen corresponding path program 1 times [2018-11-10 04:46:41,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:41,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:41,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:41,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:42,027 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2018-11-10 04:46:42,611 WARN L179 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 144 [2018-11-10 04:46:42,868 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-11-10 04:46:42,877 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:42,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:42,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:42,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:42,878 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:46:42,878 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:42,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:42,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:42,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.07-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-10 04:46:42,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:42,879 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:42,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:42,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:42,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:42,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:42,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:42,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:42,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,611 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 161 [2018-11-10 04:46:43,780 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2018-11-10 04:46:43,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:43,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:44,080 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-11-10 04:46:44,457 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:44,460 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:46:44,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:44,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:44,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:44,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:44,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:44,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:44,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:44,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:44,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:44,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:44,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:44,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:44,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:44,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:44,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:44,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:44,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:44,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:44,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:44,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:44,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:44,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:44,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:44,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:44,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:44,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:44,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:44,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:44,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:44,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:44,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:44,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:44,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:44,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:44,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:44,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:44,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:44,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:44,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:44,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:44,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:44,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:44,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:44,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:44,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:44,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:44,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:44,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:44,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:44,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:44,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:44,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:44,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:44,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:44,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:44,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:44,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:44,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:44,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:44,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:44,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:44,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:44,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:44,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:44,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:44,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:44,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:44,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:44,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:44,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:44,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:44,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:44,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:44,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:44,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:44,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:44,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:44,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:44,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:44,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:44,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:44,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:44,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:44,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:44,521 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:46:44,541 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:46:44,541 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 04:46:44,543 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:46:44,544 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:46:44,544 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:46:44,545 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~k_ref~0.base) ULTIMATE.start_test_fun_~k_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~k_ref~0.base) ULTIMATE.start_test_fun_~k_ref~0.offset)_1 + 4294967295 Supporting invariants [] [2018-11-10 04:46:44,777 INFO L297 tatePredicateManager]: 53 out of 59 supporting invariants were superfluous and have been removed [2018-11-10 04:46:44,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 04:46:44,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:44,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:44,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-10 04:46:44,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:46:44,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:46:44,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-11-10 04:46:44,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:46:44,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:46:44,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:46:44,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:46:44,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-10 04:46:44,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:46:44,902 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:46:44,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:46:44,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:46:44,918 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:36, output treesize:31 [2018-11-10 04:46:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:44,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:45,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:46:45,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-10 04:46:45,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 04:46:45,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:46:45,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:46:45,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:46:45,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:42 [2018-11-10 04:46:45,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-10 04:46:45,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 04:46:45,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:46:45,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:46:45,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:46:45,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:42 [2018-11-10 04:46:45,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:46:45,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-11-10 04:46:45,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 04:46:45,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:46:45,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:46:45,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:46:45,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:42 [2018-11-10 04:46:45,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:46:45,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-10 04:46:45,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-10 04:46:45,125 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 04:46:45,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 04:46:45,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 04:46:45,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:43 [2018-11-10 04:46:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:46:45,189 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 04:46:45,190 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 30 transitions. cyclomatic complexity: 1 Second operand 9 states. [2018-11-10 04:46:45,337 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 30 transitions. cyclomatic complexity: 1. Second operand 9 states. Result 54 states and 55 transitions. Complement of second has 13 states. [2018-11-10 04:46:45,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 04:46:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-11-10 04:46:45,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 7 letters. Loop has 23 letters. [2018-11-10 04:46:45,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:45,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 30 letters. Loop has 23 letters. [2018-11-10 04:46:45,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:45,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 7 letters. Loop has 46 letters. [2018-11-10 04:46:45,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:45,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2018-11-10 04:46:45,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:46:45,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2018-11-10 04:46:45,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:46:45,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:46:45,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:46:45,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:46:45,345 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:45,345 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:45,345 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:45,345 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:46:45,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:46:45,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:46:45,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:46:45,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:46:45 BoogieIcfgContainer [2018-11-10 04:46:45,349 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:46:45,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:46:45,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:46:45,350 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:46:45,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:46:41" (3/4) ... [2018-11-10 04:46:45,352 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:46:45,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:46:45,353 INFO L168 Benchmark]: Toolchain (without parser) took 4889.92 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 953.1 MB in the beginning and 1.0 GB in the end (delta: -56.3 MB). Peak memory consumption was 267.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:45,353 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:46:45,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.29 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 931.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:45,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 931.6 MB in the beginning and 1.1 GB in the end (delta: -217.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:45,354 INFO L168 Benchmark]: Boogie Preprocessor took 23.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:45,354 INFO L168 Benchmark]: RCFGBuilder took 275.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:45,355 INFO L168 Benchmark]: BuchiAutomizer took 4240.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.1 MB). Peak memory consumption was 276.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:45,355 INFO L168 Benchmark]: Witness Printer took 2.78 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:46:45,358 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.29 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 931.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 931.6 MB in the beginning and 1.1 GB in the end (delta: -217.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 275.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4240.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.1 MB). Peak memory consumption was 276.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.78 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[k_ref][k_ref] + 4294967295 and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 39 SDslu, 110 SDs, 0 SdLazy, 72 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital1045 mio100 ax101 hnf100 lsp97 ukn35 mio100 lsp38 div100 bol100 ite100 ukn100 eq202 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...