./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/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 18edad3aefc49839189b8c997aba3dd32264f7ca .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:53:14,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:53:14,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:53:14,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:53:14,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:53:14,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:53:14,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:53:14,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:53:14,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:53:14,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:53:14,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:53:14,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:53:14,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:53:14,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:53:14,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:53:14,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:53:14,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:53:14,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:53:14,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:53:14,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:53:14,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:53:14,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:53:14,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:53:14,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:53:14,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:53:14,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:53:14,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:53:14,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:53:14,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:53:14,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:53:14,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:53:14,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:53:14,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:53:14,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:53:14,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:53:14,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:53:14,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:53:14,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:53:14,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:53:14,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:53:14,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:53:14,905 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:53:14,925 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:53:14,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:53:14,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:53:14,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:53:14,928 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:53:14,928 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:53:14,928 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:53:14,928 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:53:14,929 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:53:14,929 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:53:14,930 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:53:14,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:53:14,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:53:14,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:53:14,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:53:14,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:53:14,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:53:14,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:53:14,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:53:14,932 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:53:14,932 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:53:14,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:53:14,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:53:14,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:53:14,933 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:53:14,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:53:14,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:53:14,934 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:53:14,937 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:53:14,937 INFO L138 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/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/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 -> 18edad3aefc49839189b8c997aba3dd32264f7ca [2019-11-15 21:53:14,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:53:15,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:53:15,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:53:15,012 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:53:15,012 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:53:15,013 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2019-11-15 21:53:15,073 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/data/dec8bd8c8/5573ee0a8206473791144da42a70bd36/FLAGd2ec9b1f7 [2019-11-15 21:53:15,566 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:53:15,566 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2019-11-15 21:53:15,588 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/data/dec8bd8c8/5573ee0a8206473791144da42a70bd36/FLAGd2ec9b1f7 [2019-11-15 21:53:16,086 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/data/dec8bd8c8/5573ee0a8206473791144da42a70bd36 [2019-11-15 21:53:16,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:53:16,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:53:16,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:53:16,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:53:16,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:53:16,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a22a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16, skipping insertion in model container [2019-11-15 21:53:16,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,105 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:53:16,155 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:53:16,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:53:16,471 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:53:16,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:53:16,552 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:53:16,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16 WrapperNode [2019-11-15 21:53:16,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:53:16,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:53:16,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:53:16,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:53:16,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:53:16,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:53:16,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:53:16,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:53:16,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (1/1) ... [2019-11-15 21:53:16,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:53:16,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:53:16,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:53:16,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:53:16,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/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 [2019-11-15 21:53:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2019-11-15 21:53:16,682 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2019-11-15 21:53:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:53:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:53:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:53:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:53:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure length [2019-11-15 21:53:16,684 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2019-11-15 21:53:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:53:16,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:53:17,010 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:53:17,010 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:53:17,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:53:17 BoogieIcfgContainer [2019-11-15 21:53:17,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:53:17,012 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:53:17,012 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:53:17,015 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:53:17,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:53:17,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:53:16" (1/3) ... [2019-11-15 21:53:17,018 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ca17f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:53:17, skipping insertion in model container [2019-11-15 21:53:17,018 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:53:17,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:16" (2/3) ... [2019-11-15 21:53:17,019 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ca17f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:53:17, skipping insertion in model container [2019-11-15 21:53:17,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:53:17,019 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:53:17" (3/3) ... [2019-11-15 21:53:17,021 INFO L371 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2019-11-15 21:53:17,061 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:53:17,062 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:53:17,062 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:53:17,062 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:53:17,062 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:53:17,062 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:53:17,062 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:53:17,062 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:53:17,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-15 21:53:17,102 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 21:53:17,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:17,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:17,108 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:53:17,109 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:53:17,109 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:53:17,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-15 21:53:17,112 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 21:53:17,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:17,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:17,112 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:53:17,112 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:53:17,118 INFO L791 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 12#L574true assume !(main_~n~0 < 1); 7#L577true call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 15#new_llENTRYtrue [2019-11-15 21:53:17,118 INFO L793 eck$LassoCheckResult]: Loop: 15#new_llENTRYtrue ~n := #in~n; 29#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 22#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 15#new_llENTRYtrue [2019-11-15 21:53:17,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:17,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2019-11-15 21:53:17,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:17,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781163391] [2019-11-15 21:53:17,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:17,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:17,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:17,229 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:17,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:17,230 INFO L82 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2019-11-15 21:53:17,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:17,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126165240] [2019-11-15 21:53:17,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:17,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:17,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:17,269 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:17,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:17,270 INFO L82 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2019-11-15 21:53:17,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:17,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119593198] [2019-11-15 21:53:17,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:17,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:17,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:17,314 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:17,519 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-15 21:53:17,737 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 21:53:18,053 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:53:18,054 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:53:18,054 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:53:18,054 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:53:18,054 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:53:18,055 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:53:18,055 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:53:18,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:53:18,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2019-11-15 21:53:18,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:53:18,057 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:53:18,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:53:18,573 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:53:18,586 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:53:18,588 INFO L120 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 [2019-11-15 21:53:18,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,591 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,592 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,594 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,598 INFO L120 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 [2019-11-15 21:53:18,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,599 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,601 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,601 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,603 INFO L120 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 [2019-11-15 21:53:18,604 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,604 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,605 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,606 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,606 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,613 INFO L120 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 [2019-11-15 21:53:18,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,616 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,617 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,619 INFO L120 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 [2019-11-15 21:53:18,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,620 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,621 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,621 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,633 INFO L120 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 [2019-11-15 21:53:18,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,636 INFO L120 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 [2019-11-15 21:53:18,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,637 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,637 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,637 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,638 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,638 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,639 INFO L120 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 [2019-11-15 21:53:18,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,659 INFO L120 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 [2019-11-15 21:53:18,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,661 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,663 INFO L120 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 [2019-11-15 21:53:18,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,664 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,666 INFO L120 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 [2019-11-15 21:53:18,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,669 INFO L120 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 [2019-11-15 21:53:18,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,674 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,676 INFO L120 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 [2019-11-15 21:53:18,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,678 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,682 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,689 INFO L120 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 [2019-11-15 21:53:18,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,691 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,693 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,693 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,696 INFO L120 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 [2019-11-15 21:53:18,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,700 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,701 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,701 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,703 INFO L120 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 [2019-11-15 21:53:18,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,709 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:18,709 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:18,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,719 INFO L120 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 [2019-11-15 21:53:18,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,720 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,720 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,722 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,724 INFO L120 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 [2019-11-15 21:53:18,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,728 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,729 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,729 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,729 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,733 INFO L120 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 [2019-11-15 21:53:18,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,734 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,735 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,735 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,739 INFO L120 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 [2019-11-15 21:53:18,741 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,742 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,747 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,752 INFO L120 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 [2019-11-15 21:53:18,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,753 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,754 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,756 INFO L120 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 [2019-11-15 21:53:18,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,757 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,758 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,760 INFO L120 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 [2019-11-15 21:53:18,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,763 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,765 INFO L120 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 [2019-11-15 21:53:18,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,766 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,766 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,767 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,767 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,768 INFO L120 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 [2019-11-15 21:53:18,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,769 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,770 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,772 INFO L120 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 [2019-11-15 21:53:18,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,773 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,774 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,780 INFO L120 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 [2019-11-15 21:53:18,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,780 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,787 INFO L120 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 [2019-11-15 21:53:18,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,791 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:18,791 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:18,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,802 INFO L120 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 [2019-11-15 21:53:18,802 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,802 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,802 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,802 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,803 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,803 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,804 INFO L120 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 [2019-11-15 21:53:18,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,805 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,805 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,807 INFO L120 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 [2019-11-15 21:53:18,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,810 INFO L120 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 [2019-11-15 21:53:18,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,811 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,812 INFO L120 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 [2019-11-15 21:53:18,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,813 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,813 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,814 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,814 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,815 INFO L120 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 [2019-11-15 21:53:18,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,816 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,816 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,817 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,817 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,818 INFO L120 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 [2019-11-15 21:53:18,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,820 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,820 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,821 INFO L120 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 [2019-11-15 21:53:18,822 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,822 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,822 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,822 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,822 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,823 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,823 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,824 INFO L120 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 [2019-11-15 21:53:18,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,825 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,825 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,827 INFO L120 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 [2019-11-15 21:53:18,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,827 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,828 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,829 INFO L120 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 [2019-11-15 21:53:18,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,832 INFO L120 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 [2019-11-15 21:53:18,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,834 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,834 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,835 INFO L120 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 [2019-11-15 21:53:18,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,836 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,837 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,837 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,838 INFO L120 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 [2019-11-15 21:53:18,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,839 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:18,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,840 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:18,840 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,841 INFO L120 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 [2019-11-15 21:53:18,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,842 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:18,842 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,842 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:53:18,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,843 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:53:18,843 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:18,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:18,848 INFO L120 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 [2019-11-15 21:53:18,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:18,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:18,849 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:53:18,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:18,853 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 21:53:18,853 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:53:18,951 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:53:18,978 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 21:53:18,978 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 21:53:18,980 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:53:18,983 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-11-15 21:53:18,984 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:53:18,984 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2019-11-15 21:53:18,993 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 21:53:19,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:19,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:53:19,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:19,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:53:19,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:53:19,192 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 [2019-11-15 21:53:19,193 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 5 states. [2019-11-15 21:53:19,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 5 states. Result 45 states and 54 transitions. Complement of second has 13 states. [2019-11-15 21:53:19,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:53:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:53:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 21:53:19,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-15 21:53:19,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:19,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 21:53:19,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:19,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-15 21:53:19,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:19,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2019-11-15 21:53:19,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 21:53:19,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2019-11-15 21:53:19,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 21:53:19,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 21:53:19,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-11-15 21:53:19,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:53:19,360 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-11-15 21:53:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-11-15 21:53:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-15 21:53:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 21:53:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-15 21:53:19,385 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-15 21:53:19,385 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-15 21:53:19,385 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:53:19,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-11-15 21:53:19,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 21:53:19,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:19,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:19,387 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:19,387 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:53:19,388 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 158#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 159#L574 assume !(main_~n~0 < 1); 141#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 151#new_llENTRY ~n := #in~n; 163#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 140#new_llFINAL assume true; 142#new_llEXIT >#57#return; 153#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 154#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 157#L566-3 [2019-11-15 21:53:19,388 INFO L793 eck$LassoCheckResult]: Loop: 157#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 155#L566-1 assume !!(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8);append_~x.base, append_~x.offset := append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem7.base, append_#t~mem7.offset; 157#L566-3 [2019-11-15 21:53:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2019-11-15 21:53:19,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:19,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625982073] [2019-11-15 21:53:19,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:19,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:19,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:53:19,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625982073] [2019-11-15 21:53:19,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:19,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:53:19,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36321139] [2019-11-15 21:53:19,480 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:53:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:19,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2019-11-15 21:53:19,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:19,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136127991] [2019-11-15 21:53:19,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:19,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:19,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:19,491 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:19,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:53:19,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:53:19,565 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-15 21:53:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:19,667 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-11-15 21:53:19,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:53:19,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-11-15 21:53:19,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 21:53:19,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2019-11-15 21:53:19,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 21:53:19,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 21:53:19,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-11-15 21:53:19,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:53:19,671 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-15 21:53:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-11-15 21:53:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-15 21:53:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 21:53:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-15 21:53:19,673 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-15 21:53:19,673 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-15 21:53:19,673 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:53:19,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2019-11-15 21:53:19,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 21:53:19,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:19,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:19,675 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:19,675 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:53:19,675 INFO L791 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 229#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 230#L574 assume !(main_~n~0 < 1); 220#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 222#new_llENTRY ~n := #in~n; 232#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 212#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 223#new_llENTRY ~n := #in~n; 233#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 211#new_llFINAL assume true; 213#new_llEXIT >#53#return; 219#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 221#new_llFINAL assume true; 234#new_llEXIT >#57#return; 224#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 225#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 228#L566-3 [2019-11-15 21:53:19,676 INFO L793 eck$LassoCheckResult]: Loop: 228#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 226#L566-1 assume !!(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8);append_~x.base, append_~x.offset := append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem7.base, append_#t~mem7.offset; 228#L566-3 [2019-11-15 21:53:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2019-11-15 21:53:19,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:19,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258720439] [2019-11-15 21:53:19,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:19,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:19,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:19,708 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:19,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:19,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2019-11-15 21:53:19,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:19,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138699575] [2019-11-15 21:53:19,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:19,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:19,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:19,716 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2019-11-15 21:53:19,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:19,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568246469] [2019-11-15 21:53:19,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:19,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:19,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:53:19,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568246469] [2019-11-15 21:53:19,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958722510] [2019-11-15 21:53:19,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:20,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 21:53:20,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:20,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:53:20,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:20,189 INFO L567 ElimStorePlain]: treesize reduction 3, result has 75.0 percent of original size [2019-11-15 21:53:20,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:20,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:53:20,306 INFO L375 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 11 treesize of output 7 [2019-11-15 21:53:20,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:20,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:20,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:53:20,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:20,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:20,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:53:20,342 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:20,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:20,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:20,352 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-11-15 21:53:20,376 INFO L375 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 15 treesize of output 7 [2019-11-15 21:53:20,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:20,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:20,391 INFO L375 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 15 treesize of output 7 [2019-11-15 21:53:20,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:20,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:20,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:20,397 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-15 21:53:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:53:20,422 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:53:20,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-15 21:53:20,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752185546] [2019-11-15 21:53:20,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:20,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:53:20,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:53:20,504 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand 15 states. [2019-11-15 21:53:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:20,767 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-11-15 21:53:20,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:53:20,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2019-11-15 21:53:20,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 21:53:20,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2019-11-15 21:53:20,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-15 21:53:20,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-15 21:53:20,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2019-11-15 21:53:20,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:53:20,772 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-15 21:53:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2019-11-15 21:53:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-11-15 21:53:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 21:53:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-15 21:53:20,776 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-15 21:53:20,776 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-15 21:53:20,776 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:53:20,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2019-11-15 21:53:20,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 21:53:20,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:20,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:20,779 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:20,779 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:53:20,779 INFO L791 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 376#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 377#L574 assume !(main_~n~0 < 1); 362#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 370#new_llENTRY ~n := #in~n; 382#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 361#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 371#new_llENTRY ~n := #in~n; 383#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 384#new_llFINAL assume true; 381#new_llEXIT >#53#return; 369#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 360#new_llFINAL assume true; 363#new_llEXIT >#57#return; 387#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 386#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 368#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 365#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 364#lengthENTRY [2019-11-15 21:53:20,779 INFO L793 eck$LassoCheckResult]: Loop: 364#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 367#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 366#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 364#lengthENTRY [2019-11-15 21:53:20,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:20,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2019-11-15 21:53:20,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:20,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638365637] [2019-11-15 21:53:20,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:20,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:20,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:53:20,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638365637] [2019-11-15 21:53:20,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:20,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:53:20,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716766898] [2019-11-15 21:53:20,872 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:53:20,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:20,872 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2019-11-15 21:53:20,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:20,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307684470] [2019-11-15 21:53:20,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:20,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:20,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:20,886 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:21,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:53:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:53:21,045 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-15 21:53:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:21,138 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-11-15 21:53:21,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:53:21,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2019-11-15 21:53:21,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 21:53:21,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2019-11-15 21:53:21,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-15 21:53:21,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-15 21:53:21,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2019-11-15 21:53:21,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:53:21,143 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-15 21:53:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2019-11-15 21:53:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-11-15 21:53:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 21:53:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-15 21:53:21,151 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-15 21:53:21,151 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-15 21:53:21,151 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:53:21,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2019-11-15 21:53:21,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 21:53:21,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:21,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:21,153 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:21,153 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:53:21,153 INFO L791 eck$LassoCheckResult]: Stem: 474#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 470#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 471#L574 assume !(main_~n~0 < 1); 456#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 464#new_llENTRY ~n := #in~n; 478#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 455#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 465#new_llENTRY ~n := #in~n; 479#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 480#new_llFINAL assume true; 476#new_llEXIT >#53#return; 477#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 484#new_llFINAL assume true; 481#new_llEXIT >#57#return; 466#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 467#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 482#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 468#L566-1 assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 469#L566-4 call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8);append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; 462#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 459#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 458#lengthENTRY [2019-11-15 21:53:21,153 INFO L793 eck$LassoCheckResult]: Loop: 458#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 461#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 460#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 458#lengthENTRY [2019-11-15 21:53:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2019-11-15 21:53:21,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:21,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556579740] [2019-11-15 21:53:21,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:21,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:21,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:21,216 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2019-11-15 21:53:21,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:21,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634617140] [2019-11-15 21:53:21,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:21,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:21,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:21,235 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:21,237 INFO L82 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2019-11-15 21:53:21,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:21,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793728599] [2019-11-15 21:53:21,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:21,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:21,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:21,290 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:21,842 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 111 [2019-11-15 21:53:21,861 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:21,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:21,932 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:22,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:22,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:22,004 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:107 [2019-11-15 21:53:22,824 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 148 [2019-11-15 21:53:22,850 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:22,983 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-15 21:53:22,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:22,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:22,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:217, output treesize:221 [2019-11-15 21:53:23,104 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-15 21:53:23,219 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-15 21:53:23,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:53:23 BoogieIcfgContainer [2019-11-15 21:53:23,332 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:53:23,333 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:53:23,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:53:23,333 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:53:23,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:53:17" (3/4) ... [2019-11-15 21:53:23,336 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 21:53:23,405 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_405a2fec-a30e-46d4-9f51-c058bfc37f08/bin/uautomizer/witness.graphml [2019-11-15 21:53:23,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:53:23,407 INFO L168 Benchmark]: Toolchain (without parser) took 7316.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 943.3 MB in the beginning and 921.5 MB in the end (delta: 21.9 MB). Peak memory consumption was 211.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:23,407 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:53:23,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:23,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:53:23,409 INFO L168 Benchmark]: Boogie Preprocessor took 26.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:23,409 INFO L168 Benchmark]: RCFGBuilder took 390.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:23,410 INFO L168 Benchmark]: BuchiAutomizer took 6320.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 923.6 MB in the end (delta: 168.6 MB). Peak memory consumption was 229.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:23,410 INFO L168 Benchmark]: Witness Printer took 72.48 ms. Allocated memory is still 1.2 GB. Free memory was 923.6 MB in the beginning and 921.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:23,413 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 462.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 390.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6320.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 923.6 MB in the end (delta: 168.6 MB). Peak memory consumption was 229.3 MB. Max. memory is 11.5 GB. * Witness Printer took 72.48 ms. Allocated memory is still 1.2 GB. Free memory was 923.6 MB in the beginning and 921.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 15 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 61 SDtfs, 58 SDslu, 209 SDs, 0 SdLazy, 237 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital133 mio100 ax100 hnf100 lsp95 ukn25 mio100 lsp42 div100 bol100 ite100 ukn100 eq214 hnf86 smp100 dnf130 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 135ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=-2} State at position 1 is {x=0, x=0, y_length=0, NULL=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a5980eb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37f955e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48099b3c=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48099b3c=0, s=0, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39dc8e01=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b8476d9=0, NULL=0, y=0, y=0, \result=0, x=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4920dd91=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3674f040=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3674f040=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37f955e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e0c798e=0, x=0, y=0, n=0, NULL=0, y=0, xs=-1, \result=0, \result=0, NULL=0, xs=0, xs=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39dc8e01=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a5980eb=0, x=0, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) [L577] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L577] RET, EXPR new_ll(n) [L577] node_t* x = new_ll(n); [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [L578] node_t* y = append(x, x); [L579] CALL length(y) Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...