./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/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 a96be28be4b50f026536d78db5ba85eeb0ae4413 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:10:36,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:10:36,995 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:10:37,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:10:37,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:10:37,003 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:10:37,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:10:37,005 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:10:37,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:10:37,007 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:10:37,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:10:37,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:10:37,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:10:37,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:10:37,010 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:10:37,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:10:37,011 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:10:37,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:10:37,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:10:37,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:10:37,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:10:37,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:10:37,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:10:37,017 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:10:37,017 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:10:37,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:10:37,018 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:10:37,019 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:10:37,019 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:10:37,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:10:37,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:10:37,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:10:37,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:10:37,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:10:37,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:10:37,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:10:37,022 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:10:37,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:10:37,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:10:37,031 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:10:37,031 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:10:37,031 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:10:37,031 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:10:37,032 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:10:37,032 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:10:37,032 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:10:37,032 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:10:37,032 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:10:37,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:10:37,032 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:10:37,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:10:37,033 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:10:37,033 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:10:37,033 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:10:37,033 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:10:37,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:10:37,033 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:10:37,033 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:10:37,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:10:37,034 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:10:37,034 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:10:37,034 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:10:37,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:10:37,034 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:10:37,034 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:10:37,035 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:10:37,035 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_a7262b1e-a8b2-4832-ad50-02c109212b40/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 -> a96be28be4b50f026536d78db5ba85eeb0ae4413 [2018-11-23 06:10:37,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:10:37,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:10:37,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:10:37,072 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:10:37,072 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:10:37,072 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i [2018-11-23 06:10:37,118 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/bin-2019/uautomizer/data/8b9b5dfa5/e73a2a8e19f04509bc1dc288a778b2ed/FLAGee023d287 [2018-11-23 06:10:37,413 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:10:37,414 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i [2018-11-23 06:10:37,418 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/bin-2019/uautomizer/data/8b9b5dfa5/e73a2a8e19f04509bc1dc288a778b2ed/FLAGee023d287 [2018-11-23 06:10:37,428 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/bin-2019/uautomizer/data/8b9b5dfa5/e73a2a8e19f04509bc1dc288a778b2ed [2018-11-23 06:10:37,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:10:37,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:10:37,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:10:37,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:10:37,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:10:37,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a030d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37, skipping insertion in model container [2018-11-23 06:10:37,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:10:37,456 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:10:37,553 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:10:37,559 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:10:37,568 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:10:37,577 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:10:37,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37 WrapperNode [2018-11-23 06:10:37,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:10:37,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:10:37,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:10:37,578 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:10:37,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:10:37,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:10:37,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:10:37,598 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:10:37,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (1/1) ... [2018-11-23 06:10:37,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:10:37,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:10:37,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:10:37,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:10:37,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7262b1e-a8b2-4832-ad50-02c109212b40/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-23 06:10:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:10:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-23 06:10:37,690 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-23 06:10:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:10:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:10:37,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:10:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:10:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:10:37,818 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:10:37,818 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 06:10:37,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:10:37 BoogieIcfgContainer [2018-11-23 06:10:37,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:10:37,819 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:10:37,819 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:10:37,823 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:10:37,824 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:10:37,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:10:37" (1/3) ... [2018-11-23 06:10:37,825 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c798af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:10:37, skipping insertion in model container [2018-11-23 06:10:37,826 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:10:37,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:37" (2/3) ... [2018-11-23 06:10:37,826 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c798af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:10:37, skipping insertion in model container [2018-11-23 06:10:37,826 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:10:37,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:10:37" (3/3) ... [2018-11-23 06:10:37,828 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex3_true-termination.c.i [2018-11-23 06:10:37,876 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:10:37,877 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:10:37,877 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:10:37,877 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:10:37,877 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:10:37,877 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:10:37,877 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:10:37,877 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:10:37,877 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:10:37,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 06:10:37,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 06:10:37,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:10:37,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:10:37,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:10:37,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:10:37,917 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:10:37,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 06:10:37,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 06:10:37,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:10:37,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:10:37,919 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:10:37,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:10:37,924 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 5#L20-2true [2018-11-23 06:10:37,925 INFO L796 eck$LassoCheckResult]: Loop: 5#L20-2true assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 13#L23true call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 9#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 15#recFINALtrue assume true; 12#recEXITtrue >#30#return; 11#L23-1true main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 5#L20-2true [2018-11-23 06:10:37,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:37,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-23 06:10:37,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:37,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:37,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:37,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:37,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:37,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2039113776, now seen corresponding path program 1 times [2018-11-23 06:10:37,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:37,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:37,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:37,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:37,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:38,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:38,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1009969970, now seen corresponding path program 1 times [2018-11-23 06:10:38,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:38,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:38,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:38,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:38,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:38,353 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-23 06:10:38,400 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:10:38,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:10:38,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:10:38,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:10:38,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:10:38,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:10:38,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:10:38,402 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:10:38,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration1_Lasso [2018-11-23 06:10:38,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:10:38,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:10:38,418 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-23 06:10:38,422 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-23 06:10:38,424 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-23 06:10:38,427 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-23 06:10:38,428 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-23 06:10:38,434 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-23 06:10:38,446 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-23 06:10:38,608 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:10:38,613 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:10:38,615 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-23 06:10:38,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:38,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:38,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:38,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:38,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:38,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:38,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:38,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:38,623 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-23 06:10:38,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:38,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:38,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:38,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:38,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:38,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:38,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:38,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:38,626 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-23 06:10:38,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:38,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:38,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:38,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:38,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:38,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:38,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:38,634 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-23 06:10:38,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:38,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:38,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:38,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:38,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:38,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:38,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:38,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:38,637 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-23 06:10:38,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:38,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:38,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:38,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:38,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:38,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:38,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:38,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:38,641 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-23 06:10:38,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:38,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:38,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:38,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:38,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:38,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:38,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:38,647 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-23 06:10:38,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:38,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:38,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:38,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:38,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:38,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:38,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:38,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:38,651 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-23 06:10:38,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:38,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:38,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:38,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:38,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:38,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:38,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:38,659 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-23 06:10:38,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:38,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:38,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:38,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:38,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:38,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:38,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:38,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:38,665 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-23 06:10:38,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:38,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:38,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:38,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:38,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:38,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:38,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:38,672 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:10:38,676 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:10:38,677 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:10:38,678 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:10:38,679 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:10:38,679 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:10:38,679 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 06:10:38,680 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:10:38,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:38,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:38,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:38,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 06:10:38,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 06:10:38,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:10:38,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:38,796 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-23 06:10:38,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-23 06:10:38,829 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-23 06:10:38,840 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-23 06:10:38,841 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2018-11-23 06:10:38,930 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 63 states and 77 transitions. Complement of second has 22 states. [2018-11-23 06:10:38,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 06:10:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 06:10:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2018-11-23 06:10:38,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-23 06:10:38,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:38,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-23 06:10:38,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:38,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-23 06:10:38,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:38,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2018-11-23 06:10:38,940 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 06:10:38,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 35 states and 42 transitions. [2018-11-23 06:10:38,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 06:10:38,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 06:10:38,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-23 06:10:38,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:10:38,947 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 06:10:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-23 06:10:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 06:10:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 06:10:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 06:10:38,967 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 06:10:38,967 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 06:10:38,967 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:10:38,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-11-23 06:10:38,968 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 06:10:38,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:10:38,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:10:38,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:10:38,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:10:38,969 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 162#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 174#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 175#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 185#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 156#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 164#recENTRY [2018-11-23 06:10:38,969 INFO L796 eck$LassoCheckResult]: Loop: 164#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 154#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 155#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 164#recENTRY [2018-11-23 06:10:38,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash 557607690, now seen corresponding path program 1 times [2018-11-23 06:10:38,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:38,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:38,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:38,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:38,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:38,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:38,988 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2018-11-23 06:10:38,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:38,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:38,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:38,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:38,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:38,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:38,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1242807987, now seen corresponding path program 2 times [2018-11-23 06:10:38,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:38,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:39,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:39,372 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:10:39,372 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:10:39,372 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:10:39,372 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:10:39,373 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:10:39,373 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:10:39,373 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:10:39,373 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:10:39,373 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration2_Lasso [2018-11-23 06:10:39,373 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:10:39,373 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:10:39,376 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-23 06:10:39,377 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-23 06:10:39,379 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-23 06:10:39,380 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-23 06:10:39,381 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-23 06:10:39,382 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-23 06:10:39,383 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-23 06:10:39,413 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-23 06:10:39,414 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-23 06:10:39,415 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-23 06:10:39,416 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-23 06:10:39,417 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-23 06:10:39,418 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-23 06:10:39,419 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-23 06:10:39,421 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-23 06:10:39,421 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-23 06:10:39,422 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-23 06:10:39,423 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-23 06:10:39,424 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-23 06:10:39,425 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-23 06:10:39,426 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-23 06:10:39,427 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-23 06:10:39,428 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-23 06:10:39,429 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-23 06:10:39,430 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-23 06:10:39,547 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:10:39,547 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:10:39,547 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-23 06:10:39,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:39,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:39,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:39,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:39,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:39,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:39,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:39,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:39,550 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-23 06:10:39,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:39,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:39,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:39,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:39,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:39,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:39,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:39,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:39,553 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-23 06:10:39,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:39,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:39,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:39,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:39,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:39,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:39,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:39,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:39,555 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-23 06:10:39,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:39,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:39,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:39,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:39,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:39,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:39,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:39,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:39,559 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-23 06:10:39,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:39,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:39,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:39,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:39,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:39,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:39,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:39,564 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-23 06:10:39,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:39,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:39,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:39,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:39,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:39,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:39,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:39,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:39,566 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-23 06:10:39,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:39,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:39,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:39,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:39,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:39,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:39,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:39,578 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-23 06:10:39,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:39,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:39,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:39,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:39,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:39,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:39,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:39,584 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-23 06:10:39,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:39,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:39,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:39,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:39,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:39,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:39,598 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:10:39,602 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:10:39,602 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 06:10:39,603 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:10:39,604 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:10:39,604 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:10:39,604 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2018-11-23 06:10:39,606 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 06:10:39,612 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 06:10:39,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:39,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:39,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:39,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:10:39,664 INFO L478 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 36 treesize of output 37 [2018-11-23 06:10:39,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:10:39,668 INFO L478 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 37 treesize of output 26 [2018-11-23 06:10:39,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:10:39,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:39,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:39,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-23 06:10:39,714 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-23 06:10:39,714 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 06:10:39,714 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-23 06:10:39,763 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 47 states and 56 transitions. Complement of second has 17 states. [2018-11-23 06:10:39,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 06:10:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:10:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-23 06:10:39,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 06:10:39,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:39,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 06:10:39,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:39,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 06:10:39,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:39,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2018-11-23 06:10:39,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 06:10:39,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 50 transitions. [2018-11-23 06:10:39,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 06:10:39,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 06:10:39,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2018-11-23 06:10:39,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:10:39,772 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 06:10:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2018-11-23 06:10:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 06:10:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 06:10:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-23 06:10:39,780 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-23 06:10:39,780 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-23 06:10:39,780 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:10:39,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-23 06:10:39,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 06:10:39,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:10:39,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:10:39,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:10:39,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:10:39,782 INFO L794 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 310#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 311#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 329#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 339#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 338#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 309#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 314#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 315#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 343#recFINAL assume true; 322#recEXIT >#28#return; 323#L15-1 #res := #t~ret5;havoc #t~ret5; 337#recFINAL assume true; 332#recEXIT >#30#return; 318#L23-1 [2018-11-23 06:10:39,783 INFO L796 eck$LassoCheckResult]: Loop: 318#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 319#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 326#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 327#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 334#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 336#recFINAL assume true; 341#recEXIT >#30#return; 318#L23-1 [2018-11-23 06:10:39,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:39,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1969157627, now seen corresponding path program 1 times [2018-11-23 06:10:39,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:39,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:39,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:39,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:10:39,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:39,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 2 times [2018-11-23 06:10:39,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:39,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:39,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:39,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:39,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:39,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash 931270558, now seen corresponding path program 1 times [2018-11-23 06:10:39,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:39,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:39,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:39,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:10:39,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:40,311 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:10:40,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:10:40,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:10:40,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:10:40,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:10:40,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:10:40,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:10:40,311 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:10:40,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration3_Lasso [2018-11-23 06:10:40,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:10:40,312 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:10:40,314 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-23 06:10:40,316 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-23 06:10:40,317 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-23 06:10:40,319 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-23 06:10:40,440 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-23 06:10:40,563 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:10:40,563 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:10:40,564 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-23 06:10:40,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:40,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:40,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:40,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:40,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:40,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:40,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:40,567 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-23 06:10:40,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:40,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:40,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:40,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:40,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:40,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:40,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:40,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:40,569 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-23 06:10:40,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:40,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:40,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:40,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:40,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:40,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:40,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:40,577 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-23 06:10:40,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:40,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:40,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:40,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:40,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:40,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:40,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:40,585 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-23 06:10:40,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:40,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:40,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:40,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:40,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:40,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:40,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:40,588 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-23 06:10:40,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:40,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:40,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:40,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:40,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:40,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:40,609 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:10:40,621 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 06:10:40,621 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 06:10:40,622 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:10:40,622 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:10:40,622 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:10:40,623 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 06:10:40,644 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 06:10:40,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:40,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:40,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:40,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 06:10:40,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 06:10:40,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:10:40,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:40,750 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-23 06:10:40,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-23 06:10:40,759 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-23 06:10:40,760 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-23 06:10:40,760 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-23 06:10:40,835 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 130 states and 152 transitions. Complement of second has 21 states. [2018-11-23 06:10:40,836 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-23 06:10:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 06:10:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-23 06:10:40,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 7 letters. [2018-11-23 06:10:40,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:40,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-23 06:10:40,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:40,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 14 letters. [2018-11-23 06:10:40,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:40,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 152 transitions. [2018-11-23 06:10:40,842 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 06:10:40,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 90 states and 105 transitions. [2018-11-23 06:10:40,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-23 06:10:40,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-23 06:10:40,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 105 transitions. [2018-11-23 06:10:40,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:10:40,844 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 105 transitions. [2018-11-23 06:10:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 105 transitions. [2018-11-23 06:10:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-11-23 06:10:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 06:10:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-11-23 06:10:40,852 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-11-23 06:10:40,852 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-11-23 06:10:40,852 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:10:40,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2018-11-23 06:10:40,854 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 06:10:40,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:10:40,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:10:40,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:10:40,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:10:40,855 INFO L794 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 603#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 604#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 633#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 634#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 639#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 629#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 638#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 644#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 641#recFINAL assume true; 637#recEXIT >#28#return; 636#L15-1 #res := #t~ret5;havoc #t~ret5; 635#recFINAL assume true; 632#recEXIT >#30#return; 631#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 618#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 622#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 623#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 673#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 609#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 608#recENTRY [2018-11-23 06:10:40,855 INFO L796 eck$LassoCheckResult]: Loop: 608#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 611#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 610#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 608#recENTRY [2018-11-23 06:10:40,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -801242957, now seen corresponding path program 2 times [2018-11-23 06:10:40,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:40,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:40,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:40,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2018-11-23 06:10:40,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:40,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:40,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:10:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:40,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:40,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1599299332, now seen corresponding path program 3 times [2018-11-23 06:10:40,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:40,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:40,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:40,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:10:40,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:41,398 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2018-11-23 06:10:41,625 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-11-23 06:10:41,664 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:10:41,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:10:41,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:10:41,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:10:41,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:10:41,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:10:41,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:10:41,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:10:41,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration4_Lasso [2018-11-23 06:10:41,665 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:10:41,665 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:10:41,667 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-23 06:10:41,669 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-23 06:10:41,670 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-23 06:10:41,670 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-23 06:10:41,671 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-23 06:10:41,673 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-23 06:10:41,674 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-23 06:10:41,675 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-23 06:10:41,676 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-23 06:10:41,677 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-23 06:10:41,678 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-23 06:10:41,679 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-23 06:10:41,680 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-23 06:10:41,681 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-23 06:10:41,682 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-23 06:10:41,683 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-23 06:10:41,684 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-23 06:10:41,685 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-23 06:10:41,686 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-23 06:10:41,687 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-23 06:10:41,688 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-23 06:10:41,689 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-23 06:10:41,689 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-23 06:10:41,690 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-23 06:10:41,691 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-23 06:10:41,840 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:10:41,840 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:10:41,840 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-23 06:10:41,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,843 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-23 06:10:41,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,844 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-23 06:10:41,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,850 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-23 06:10:41,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,852 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-23 06:10:41,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:41,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:41,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,854 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-23 06:10:41,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,856 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-23 06:10:41,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,857 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-23 06:10:41,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,859 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-23 06:10:41,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,861 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-23 06:10:41,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,862 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-23 06:10:41,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,864 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-23 06:10:41,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,866 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-23 06:10:41,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,868 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-23 06:10:41,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,869 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-23 06:10:41,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,871 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-23 06:10:41,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:41,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:41,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,873 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-23 06:10:41,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,875 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-23 06:10:41,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,877 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-23 06:10:41,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,879 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-23 06:10:41,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,881 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-23 06:10:41,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,882 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-23 06:10:41,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,884 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-23 06:10:41,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:41,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:41,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:41,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,886 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-23 06:10:41,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:41,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:41,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,891 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-23 06:10:41,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,892 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:10:41,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,893 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:10:41,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:41,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,895 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-23 06:10:41,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:41,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:41,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,898 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-23 06:10:41,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:41,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:41,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:41,901 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-23 06:10:41,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:41,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:41,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:41,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:41,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:41,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:41,908 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:10:41,911 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:10:41,911 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 06:10:41,911 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:10:41,912 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:10:41,912 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:10:41,912 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2018-11-23 06:10:41,937 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 06:10:41,941 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 06:10:41,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:41,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:41,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:42,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:10:42,010 INFO L478 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 36 treesize of output 37 [2018-11-23 06:10:42,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:10:42,013 INFO L478 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 37 treesize of output 26 [2018-11-23 06:10:42,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:10:42,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:42,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:42,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-23 06:10:42,028 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-23 06:10:42,028 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 06:10:42,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-23 06:10:42,087 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 106 states and 124 transitions. Complement of second has 17 states. [2018-11-23 06:10:42,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 06:10:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 06:10:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-11-23 06:10:42,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-23 06:10:42,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:42,091 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:10:42,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:42,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:42,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:42,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:10:42,155 INFO L478 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 36 treesize of output 37 [2018-11-23 06:10:42,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:10:42,158 INFO L478 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 37 treesize of output 26 [2018-11-23 06:10:42,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:10:42,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:42,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:42,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-23 06:10:42,172 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-23 06:10:42,172 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 06:10:42,172 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-23 06:10:42,259 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 106 states and 124 transitions. Complement of second has 17 states. [2018-11-23 06:10:42,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 06:10:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 06:10:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-11-23 06:10:42,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-23 06:10:42,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:42,261 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:10:42,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:42,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:42,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:42,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:10:42,336 INFO L478 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 36 treesize of output 37 [2018-11-23 06:10:42,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:10:42,339 INFO L478 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 37 treesize of output 26 [2018-11-23 06:10:42,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:10:42,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:42,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:42,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-23 06:10:42,365 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-23 06:10:42,365 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 06:10:42,366 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-23 06:10:42,429 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 154 states and 179 transitions. Complement of second has 19 states. [2018-11-23 06:10:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 06:10:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 06:10:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-11-23 06:10:42,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-23 06:10:42,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:42,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 23 letters. Loop has 3 letters. [2018-11-23 06:10:42,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:42,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-23 06:10:42,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:42,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 179 transitions. [2018-11-23 06:10:42,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:10:42,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 110 states and 135 transitions. [2018-11-23 06:10:42,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-23 06:10:42,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-23 06:10:42,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 135 transitions. [2018-11-23 06:10:42,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:10:42,436 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 135 transitions. [2018-11-23 06:10:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 135 transitions. [2018-11-23 06:10:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2018-11-23 06:10:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 06:10:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2018-11-23 06:10:42,443 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-11-23 06:10:42,443 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-11-23 06:10:42,443 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:10:42,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2018-11-23 06:10:42,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:10:42,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:10:42,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:10:42,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:10:42,445 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:10:42,446 INFO L794 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1356#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 1357#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1371#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1374#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1378#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1376#recFINAL assume true; 1370#recEXIT >#30#return; 1366#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1368#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1372#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1373#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1400#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 1352#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1360#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1351#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1353#recFINAL assume true; 1417#recEXIT >#28#return; 1406#L15-1 #res := #t~ret5;havoc #t~ret5; 1401#recFINAL assume true; 1377#recEXIT >#30#return; 1364#L23-1 [2018-11-23 06:10:42,446 INFO L796 eck$LassoCheckResult]: Loop: 1364#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1365#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1403#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1407#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1402#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1404#recFINAL assume true; 1408#recEXIT >#30#return; 1364#L23-1 [2018-11-23 06:10:42,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:42,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1572162950, now seen corresponding path program 4 times [2018-11-23 06:10:42,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:42,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:42,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:42,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:10:42,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:42,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 3 times [2018-11-23 06:10:42,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:42,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:42,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:42,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:10:42,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:42,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1341076915, now seen corresponding path program 5 times [2018-11-23 06:10:42,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:42,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:42,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:42,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:10:42,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:42,678 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2018-11-23 06:10:43,264 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 128 [2018-11-23 06:10:43,304 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:10:43,304 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:10:43,304 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:10:43,304 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:10:43,304 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:10:43,304 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:10:43,304 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:10:43,304 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:10:43,304 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration5_Lasso [2018-11-23 06:10:43,304 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:10:43,304 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:10:43,306 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-23 06:10:43,310 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-23 06:10:43,316 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-23 06:10:43,318 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-23 06:10:43,319 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-23 06:10:43,569 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:10:43,569 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:10:43,570 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-23 06:10:43,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:43,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:43,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:43,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:43,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:43,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:43,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:43,576 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-23 06:10:43,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:43,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:43,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:43,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:43,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:43,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:43,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:43,578 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-23 06:10:43,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:43,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:43,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:43,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:43,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:43,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:43,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:43,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:43,579 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-23 06:10:43,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:43,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:43,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:43,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:43,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:43,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:43,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:43,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:43,581 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-23 06:10:43,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:43,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:43,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:43,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:43,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:43,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:43,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:43,583 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-23 06:10:43,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:43,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:43,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:43,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:43,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:43,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:43,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:43,584 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-23 06:10:43,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:43,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:43,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:43,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:43,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:43,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:43,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:43,586 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-23 06:10:43,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:43,587 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:10:43,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:43,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:43,587 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:10:43,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:43,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:43,589 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-23 06:10:43,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:43,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:43,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:43,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:43,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:43,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:43,616 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:10:43,622 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:10:43,623 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:10:43,623 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:10:43,623 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:10:43,624 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:10:43,624 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~ret9) = 1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_#t~ret9 Supporting invariants [] [2018-11-23 06:10:43,642 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 06:10:43,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:43,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:43,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:43,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 06:10:43,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 06:10:43,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:10:43,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:43,730 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-23 06:10:43,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-23 06:10:43,739 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-23 06:10:43,739 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-23 06:10:43,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-23 06:10:43,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 118 states and 139 transitions. Complement of second has 21 states. [2018-11-23 06:10:43,810 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-23 06:10:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 06:10:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-23 06:10:43,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-23 06:10:43,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:43,811 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:10:43,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:43,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:43,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:43,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 06:10:43,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 06:10:43,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:10:43,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:43,912 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-23 06:10:43,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-23 06:10:43,921 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-23 06:10:43,921 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-23 06:10:43,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-23 06:10:43,983 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 118 states and 139 transitions. Complement of second has 21 states. [2018-11-23 06:10:43,983 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-23 06:10:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 06:10:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-23 06:10:43,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-23 06:10:43,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:43,985 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:10:43,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:44,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:44,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:44,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 06:10:44,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 06:10:44,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:10:44,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:44,078 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-23 06:10:44,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-23 06:10:44,088 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-23 06:10:44,088 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-23 06:10:44,088 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-23 06:10:44,152 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 143 states and 169 transitions. Complement of second has 22 states. [2018-11-23 06:10:44,153 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-23 06:10:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 06:10:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-11-23 06:10:44,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-23 06:10:44,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:44,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-23 06:10:44,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:44,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 14 letters. [2018-11-23 06:10:44,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:44,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 169 transitions. [2018-11-23 06:10:44,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 06:10:44,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 94 states and 109 transitions. [2018-11-23 06:10:44,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-23 06:10:44,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2018-11-23 06:10:44,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 109 transitions. [2018-11-23 06:10:44,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:10:44,157 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 109 transitions. [2018-11-23 06:10:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 109 transitions. [2018-11-23 06:10:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 32. [2018-11-23 06:10:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 06:10:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 06:10:44,162 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 06:10:44,162 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 06:10:44,162 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:10:44,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-11-23 06:10:44,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 06:10:44,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:10:44,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:10:44,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 06:10:44,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:10:44,163 INFO L794 eck$LassoCheckResult]: Stem: 2197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2189#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 2190#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2204#L23 [2018-11-23 06:10:44,163 INFO L796 eck$LassoCheckResult]: Loop: 2204#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 2205#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2209#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 2184#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 2194#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2183#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 2185#recFINAL assume true; 2206#recEXIT >#28#return; 2211#L15-1 #res := #t~ret5;havoc #t~ret5; 2210#recFINAL assume true; 2208#recEXIT >#30#return; 2198#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 2200#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2204#L23 [2018-11-23 06:10:44,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 37808, now seen corresponding path program 1 times [2018-11-23 06:10:44,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:44,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:44,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:10:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:44,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash -669629144, now seen corresponding path program 1 times [2018-11-23 06:10:44,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:44,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:44,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:44,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:44,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1720097319, now seen corresponding path program 6 times [2018-11-23 06:10:44,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:44,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:44,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:44,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:44,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:44,526 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:10:44,526 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:10:44,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:10:44,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:10:44,526 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:10:44,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:10:44,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:10:44,526 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:10:44,526 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration6_Lasso [2018-11-23 06:10:44,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:10:44,526 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:10:44,528 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-23 06:10:44,530 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-23 06:10:44,531 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-23 06:10:44,531 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-23 06:10:44,533 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-23 06:10:44,533 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-23 06:10:44,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:10:44,734 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:10:44,734 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-23 06:10:44,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:44,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:44,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:44,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:44,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:44,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:44,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:44,736 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-23 06:10:44,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:44,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:44,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:44,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:44,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:44,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:44,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:44,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:44,738 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-23 06:10:44,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:44,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:44,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:44,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:44,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:44,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:44,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:44,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:44,739 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-23 06:10:44,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:44,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:44,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:44,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:44,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:44,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:44,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:44,741 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-23 06:10:44,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:44,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:10:44,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:44,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:44,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:44,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:10:44,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:10:44,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:44,742 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-23 06:10:44,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:44,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:44,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:44,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:44,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:44,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:44,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:44,747 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-23 06:10:44,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:44,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:44,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:44,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:44,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:44,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:44,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:44,754 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-23 06:10:44,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:44,754 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:10:44,755 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:10:44,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:44,756 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 06:10:44,757 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 06:10:44,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:10:44,765 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-23 06:10:44,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:10:44,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:10:44,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:10:44,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:10:44,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:10:44,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:10:44,771 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:10:44,774 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:10:44,774 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:10:44,775 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:10:44,775 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:10:44,775 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:10:44,775 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 06:10:44,790 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 06:10:44,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:44,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:10:44,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:10:44,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 06:10:44,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 06:10:44,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:10:44,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:10:44,835 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-23 06:10:44,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-11-23 06:10:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 06:10:44,865 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-23 06:10:44,865 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-23 06:10:44,903 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 69 states and 86 transitions. Complement of second has 22 states. [2018-11-23 06:10:44,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 06:10:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 06:10:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-11-23 06:10:44,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 13 letters. [2018-11-23 06:10:44,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:44,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 16 letters. Loop has 13 letters. [2018-11-23 06:10:44,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:44,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 26 letters. [2018-11-23 06:10:44,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:10:44,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 86 transitions. [2018-11-23 06:10:44,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:10:44,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-11-23 06:10:44,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:10:44,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:10:44,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:10:44,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:10:44,908 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:10:44,908 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:10:44,908 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:10:44,908 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:10:44,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:10:44,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:10:44,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:10:44,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:10:44 BoogieIcfgContainer [2018-11-23 06:10:44,914 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:10:44,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:10:44,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:10:44,914 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:10:44,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:10:37" (3/4) ... [2018-11-23 06:10:44,917 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:10:44,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:10:44,918 INFO L168 Benchmark]: Toolchain (without parser) took 7488.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 236.5 MB). Free memory was 959.1 MB in the beginning and 964.1 MB in the end (delta: -5.0 MB). Peak memory consumption was 231.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:44,919 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:10:44,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.60 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:44,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.28 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:44,919 INFO L168 Benchmark]: Boogie Preprocessor took 49.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -210.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:44,920 INFO L168 Benchmark]: RCFGBuilder took 171.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:44,920 INFO L168 Benchmark]: BuchiAutomizer took 7095.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 964.1 MB in the end (delta: 177.8 MB). Peak memory consumption was 254.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:44,920 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.3 GB. Free memory is still 964.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:10:44,926 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.60 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.28 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -210.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 171.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7095.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 964.1 MB in the end (delta: 177.8 MB). Peak memory consumption was 254.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.3 GB. Free memory is still 964.1 MB. 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 - 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 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function i and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One deterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. One deterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function i + aux-rec(op)-aux and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 111 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 82 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 127 SDtfs, 149 SDslu, 120 SDs, 0 SdLazy, 376 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital172 mio100 ax100 hnf100 lsp95 ukn58 mio100 lsp31 div100 bol100 ite100 ukn100 eq171 hnf90 smp97 dnf107 smp100 tf101 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...