./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.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_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/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 f9e8d57988f982ece26fd7a4aa6d80b7a8ef76d2 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:31:29,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:31:29,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:31:29,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:31:29,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:31:29,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:31:29,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:31:29,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:31:29,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:31:29,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:31:29,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:31:29,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:31:29,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:31:29,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:31:29,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:31:29,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:31:29,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:31:29,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:31:29,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:31:29,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:31:29,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:31:29,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:31:29,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:31:29,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:31:29,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:31:29,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:31:29,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:31:29,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:31:29,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:31:29,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:31:29,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:31:29,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:31:29,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:31:29,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:31:29,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:31:29,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:31:29,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:31:29,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:31:29,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:31:29,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:31:29,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:31:29,601 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:31:29,616 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:31:29,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:31:29,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:31:29,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:31:29,618 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:31:29,618 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:31:29,618 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:31:29,618 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:31:29,619 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:31:29,619 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:31:29,619 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:31:29,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:31:29,620 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:31:29,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:31:29,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:31:29,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:31:29,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:31:29,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:31:29,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:31:29,621 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:31:29,621 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:31:29,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:31:29,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:31:29,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:31:29,622 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:31:29,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:31:29,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:31:29,623 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:31:29,624 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:31:29,624 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_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/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 -> f9e8d57988f982ece26fd7a4aa6d80b7a8ef76d2 [2019-11-16 00:31:29,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:31:29,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:31:29,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:31:29,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:31:29,663 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:31:29,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i [2019-11-16 00:31:29,714 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/bin/uautomizer/data/2b8c99f8f/c52313d2cf894e28882cbe5aa2e72721/FLAG5b918270f [2019-11-16 00:31:30,119 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:31:30,119 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i [2019-11-16 00:31:30,127 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/bin/uautomizer/data/2b8c99f8f/c52313d2cf894e28882cbe5aa2e72721/FLAG5b918270f [2019-11-16 00:31:30,137 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/bin/uautomizer/data/2b8c99f8f/c52313d2cf894e28882cbe5aa2e72721 [2019-11-16 00:31:30,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:31:30,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:31:30,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:31:30,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:31:30,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:31:30,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32378de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30, skipping insertion in model container [2019-11-16 00:31:30,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,153 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:31:30,167 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:31:30,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:31:30,382 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:31:30,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:31:30,413 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:31:30,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30 WrapperNode [2019-11-16 00:31:30,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:31:30,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:31:30,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:31:30,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:31:30,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:31:30,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:31:30,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:31:30,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:31:30,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (1/1) ... [2019-11-16 00:31:30,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:31:30,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:31:30,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:31:30,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:31:30,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d59ffd6-bb5a-4ffd-b3ab-78f03599432d/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-16 00:31:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2019-11-16 00:31:30,534 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2019-11-16 00:31:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure rec_cstrlen [2019-11-16 00:31:30,535 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_cstrlen [2019-11-16 00:31:30,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:31:30,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:31:30,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:31:30,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:31:30,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:31:30,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:31:30,817 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:31:30,818 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:31:30,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:30 BoogieIcfgContainer [2019-11-16 00:31:30,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:31:30,820 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:31:30,820 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:31:30,823 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:31:30,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:31:30,823 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:31:30" (1/3) ... [2019-11-16 00:31:30,824 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2eb50555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:31:30, skipping insertion in model container [2019-11-16 00:31:30,825 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:31:30,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:30" (2/3) ... [2019-11-16 00:31:30,825 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2eb50555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:31:30, skipping insertion in model container [2019-11-16 00:31:30,825 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:31:30,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:30" (3/3) ... [2019-11-16 00:31:30,839 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc2.i [2019-11-16 00:31:30,889 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:31:30,890 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:31:30,890 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:31:30,890 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:31:30,890 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:31:30,890 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:31:30,891 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:31:30,891 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:31:30,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-16 00:31:30,934 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:31:30,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:31:30,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:31:30,945 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:31:30,945 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:31:30,945 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:31:30,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-16 00:31:30,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:31:30,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:31:30,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:31:30,953 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:31:30,953 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:31:30,966 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#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_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 16#L43true assume main_~length~1 < 1;main_~length~1 := 1; 11#L43-2true build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 20#L12true main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 22#L34true call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 6#rec_cstrlenENTRYtrue [2019-11-16 00:31:30,966 INFO L793 eck$LassoCheckResult]: Loop: 6#rec_cstrlenENTRYtrue ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 8#L17true assume !(0 == #t~mem2);havoc #t~mem2; 14#L20true call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 6#rec_cstrlenENTRYtrue [2019-11-16 00:31:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1155759803, now seen corresponding path program 1 times [2019-11-16 00:31:30,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:30,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381375229] [2019-11-16 00:31:30,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:30,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:30,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:31,098 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 1 times [2019-11-16 00:31:31,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:31,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565320617] [2019-11-16 00:31:31,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:31,114 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:31,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:31,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1512490931, now seen corresponding path program 1 times [2019-11-16 00:31:31,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:31,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917832434] [2019-11-16 00:31:31,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:31,329 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-16 00:31:31,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917832434] [2019-11-16 00:31:31,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:31,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:31:31,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119646906] [2019-11-16 00:31:31,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:31,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:31:31,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:31,458 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2019-11-16 00:31:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:31,645 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-16 00:31:31,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:31:31,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2019-11-16 00:31:31,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:31:31,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 26 states and 29 transitions. [2019-11-16 00:31:31,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-16 00:31:31,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-16 00:31:31,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2019-11-16 00:31:31,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:31:31,660 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-11-16 00:31:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2019-11-16 00:31:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-16 00:31:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:31:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-11-16 00:31:31,688 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-16 00:31:31,688 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-16 00:31:31,688 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:31:31,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-11-16 00:31:31,689 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:31:31,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:31:31,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:31:31,690 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:31:31,690 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:31:31,690 INFO L791 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 98#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_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 99#L43 assume !(main_~length~1 < 1); 102#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 106#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 93#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 100#rec_cstrlenENTRY [2019-11-16 00:31:31,690 INFO L793 eck$LassoCheckResult]: Loop: 100#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 104#L17 assume !(0 == #t~mem2);havoc #t~mem2; 94#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 100#rec_cstrlenENTRY [2019-11-16 00:31:31,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:31,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1155819385, now seen corresponding path program 1 times [2019-11-16 00:31:31,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:31,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357443925] [2019-11-16 00:31:31,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:31,719 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:31,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:31,720 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 2 times [2019-11-16 00:31:31,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:31,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097225710] [2019-11-16 00:31:31,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:31,730 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash 262516431, now seen corresponding path program 1 times [2019-11-16 00:31:31,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:31,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004504325] [2019-11-16 00:31:31,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:31,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:31,767 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:31,915 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-11-16 00:31:32,187 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-16 00:31:32,413 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:31:32,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:31:32,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:31:32,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:31:32,414 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:31:32,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:31:32,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:31:32,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:31:32,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2.i_Iteration2_Lasso [2019-11-16 00:31:32,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:31:32,415 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:31:32,450 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-16 00:31:32,462 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-16 00:31:32,465 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-16 00:31:32,468 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-16 00:31:32,472 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-16 00:31:32,475 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-16 00:31:32,478 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-16 00:31:32,481 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-16 00:31:32,488 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-16 00:31:32,490 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-16 00:31:32,494 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-16 00:31:32,497 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-16 00:31:32,500 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-16 00:31:32,555 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-16 00:31:32,558 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-16 00:31:32,561 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-16 00:31:32,564 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-16 00:31:32,566 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-16 00:31:32,568 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-16 00:31:32,571 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-16 00:31:32,573 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-16 00:31:32,575 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-16 00:31:32,581 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-16 00:31:32,583 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-16 00:31:32,585 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-16 00:31:32,588 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-16 00:31:32,591 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-16 00:31:32,593 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-16 00:31:32,596 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-16 00:31:32,598 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-16 00:31:32,600 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-16 00:31:32,602 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-16 00:31:32,604 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-16 00:31:32,607 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-16 00:31:32,609 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-16 00:31:32,611 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-16 00:31:32,614 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-16 00:31:32,616 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-16 00:31:32,618 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-16 00:31:32,621 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-16 00:31:32,623 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-16 00:31:32,625 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-16 00:31:32,628 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-16 00:31:32,630 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-16 00:31:32,632 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-16 00:31:32,940 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:31:32,945 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:31:32,947 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-16 00:31:32,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,949 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,952 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:32,952 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:32,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,955 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-16 00:31:32,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,956 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,956 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,957 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:32,957 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:32,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,958 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-16 00:31:32,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,959 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,960 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:32,961 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:32,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,962 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-16 00:31:32,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,963 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,963 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,963 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,964 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:32,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:32,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,966 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-16 00:31:32,966 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,967 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,967 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,967 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,967 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,968 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:32,968 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:32,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,969 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-16 00:31:32,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:32,972 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:32,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,973 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-16 00:31:32,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,977 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:32,977 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:32,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,981 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-16 00:31:32,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,981 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,982 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,983 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:32,983 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:32,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,984 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-16 00:31:32,985 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,985 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,985 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,985 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,986 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:32,986 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:32,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,987 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-16 00:31:32,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,988 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,988 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,989 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:32,990 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:32,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,991 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-16 00:31:32,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,992 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:32,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,993 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:32,993 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:32,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:32,994 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-16 00:31:32,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:32,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:32,996 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:32,996 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:31:32,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:32,997 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:31:32,997 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:33,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:33,001 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-16 00:31:33,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:33,002 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:33,002 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:33,002 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:33,005 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:33,005 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:33,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:33,015 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-16 00:31:33,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:33,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:33,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:33,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:33,020 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:33,020 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:33,046 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:31:33,077 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:31:33,078 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:31:33,080 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:31:33,082 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:31:33,082 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:31:33,083 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_cstrlen_#in~s.offset, v_rep(select #length rec_cstrlen_#in~s.base)_1) = -1*rec_cstrlen_#in~s.offset + 1*v_rep(select #length rec_cstrlen_#in~s.base)_1 Supporting invariants [] [2019-11-16 00:31:33,090 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-16 00:31:33,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:31:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:33,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:31:33,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:33,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:31:33,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:33,204 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-16 00:31:33,207 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:31:33,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-16 00:31:33,291 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 42 states and 48 transitions. Complement of second has 8 states. [2019-11-16 00:31:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:31:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:31:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-16 00:31:33,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-16 00:31:33,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:33,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-16 00:31:33,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:33,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-16 00:31:33,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:33,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2019-11-16 00:31:33,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:31:33,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 39 transitions. [2019-11-16 00:31:33,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:31:33,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-16 00:31:33,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2019-11-16 00:31:33,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:31:33,312 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-11-16 00:31:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2019-11-16 00:31:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-16 00:31:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:31:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-16 00:31:33,321 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-16 00:31:33,321 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-16 00:31:33,322 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:31:33,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2019-11-16 00:31:33,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:31:33,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:31:33,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:31:33,327 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:33,327 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:31:33,328 INFO L791 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#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_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 223#L43 assume !(main_~length~1 < 1); 225#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 231#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 210#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 212#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 214#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 209#rec_cstrlenFINAL assume true; 211#rec_cstrlenEXIT >#41#return; 226#L34-1 rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; 206#L36 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 207#rec_strcopy_helperENTRY [2019-11-16 00:31:33,328 INFO L793 eck$LassoCheckResult]: Loop: 207#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 208#L28 assume 0 != #t~mem5;havoc #t~mem5; 205#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 207#rec_strcopy_helperENTRY [2019-11-16 00:31:33,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:33,329 INFO L82 PathProgramCache]: Analyzing trace with hash -509542028, now seen corresponding path program 1 times [2019-11-16 00:31:33,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:33,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077429484] [2019-11-16 00:31:33,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:33,380 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 1 times [2019-11-16 00:31:33,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:33,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273480283] [2019-11-16 00:31:33,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:33,396 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:33,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:33,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1352131953, now seen corresponding path program 1 times [2019-11-16 00:31:33,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:33,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846887004] [2019-11-16 00:31:33,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:33,581 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-16 00:31:33,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846887004] [2019-11-16 00:31:33,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:33,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:31:33,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070495949] [2019-11-16 00:31:33,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:33,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:31:33,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:31:33,771 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 6 Second operand 10 states. [2019-11-16 00:31:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:33,910 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-11-16 00:31:33,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:31:33,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2019-11-16 00:31:33,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:31:33,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 23 transitions. [2019-11-16 00:31:33,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-16 00:31:33,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:31:33,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-11-16 00:31:33,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:31:33,914 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-16 00:31:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-11-16 00:31:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-16 00:31:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:31:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-16 00:31:33,916 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-16 00:31:33,916 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-16 00:31:33,916 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:31:33,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2019-11-16 00:31:33,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:31:33,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:31:33,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:31:33,918 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:33,918 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:31:33,918 INFO L791 eck$LassoCheckResult]: Stem: 316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 314#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_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 315#L43 assume !(main_~length~1 < 1); 312#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 313#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 306#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 305#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 307#L17 assume !(0 == #t~mem2);havoc #t~mem2; 303#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 308#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 309#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 302#rec_cstrlenFINAL assume true; 304#rec_cstrlenEXIT >#45#return; 310#L20-1 #res := 1 + #t~ret3;havoc #t~ret3; 311#rec_cstrlenFINAL assume true; 318#rec_cstrlenEXIT >#41#return; 317#L34-1 rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; 299#L36 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 300#rec_strcopy_helperENTRY [2019-11-16 00:31:33,919 INFO L793 eck$LassoCheckResult]: Loop: 300#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 301#L28 assume 0 != #t~mem5;havoc #t~mem5; 298#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 300#rec_strcopy_helperENTRY [2019-11-16 00:31:33,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:33,919 INFO L82 PathProgramCache]: Analyzing trace with hash -462834206, now seen corresponding path program 1 times [2019-11-16 00:31:33,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:33,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010909449] [2019-11-16 00:31:33,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:33,968 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 2 times [2019-11-16 00:31:33,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:33,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393799175] [2019-11-16 00:31:33,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:33,992 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1448810655, now seen corresponding path program 1 times [2019-11-16 00:31:33,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:33,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622440287] [2019-11-16 00:31:33,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:33,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:31:34,035 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:31:34,796 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2019-11-16 00:31:34,942 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-16 00:31:35,095 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-16 00:31:35,173 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:31:35,173 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:31:35,174 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:31:35,174 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:31:35,174 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:31:35,174 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:31:35,174 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:31:35,174 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:31:35,174 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2.i_Iteration4_Lasso [2019-11-16 00:31:35,174 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:31:35,174 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:31:35,178 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-16 00:31:35,184 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-16 00:31:35,187 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-16 00:31:35,189 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-16 00:31:35,191 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-16 00:31:35,193 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-16 00:31:35,195 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-16 00:31:35,198 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-16 00:31:35,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-16 00:31:35,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-16 00:31:35,207 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-16 00:31:35,209 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-16 00:31:35,211 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-16 00:31:35,212 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-16 00:31:35,215 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-16 00:31:35,219 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-16 00:31:35,221 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-16 00:31:35,229 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-16 00:31:35,231 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-16 00:31:35,237 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-16 00:31:35,239 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-16 00:31:35,241 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-16 00:31:35,243 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-16 00:31:35,245 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-16 00:31:35,247 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-16 00:31:35,249 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-16 00:31:35,434 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-16 00:31:35,435 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-16 00:31:35,437 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-16 00:31:35,439 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-16 00:31:35,441 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-16 00:31:35,442 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-16 00:31:35,444 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-16 00:31:35,445 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-16 00:31:35,446 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-16 00:31:35,448 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-16 00:31:35,450 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-16 00:31:35,457 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-16 00:31:35,459 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-16 00:31:35,461 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-16 00:31:35,463 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-16 00:31:35,466 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-16 00:31:35,467 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-16 00:31:35,469 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-16 00:31:35,471 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-16 00:31:35,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:31:35,798 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:31:35,799 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-16 00:31:35,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,800 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,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-16 00:31:35,802 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,804 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,804 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,805 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-16 00:31:35,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,805 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,806 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,807 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,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-16 00:31:35,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,808 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,809 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,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-16 00:31:35,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,811 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,812 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,812 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,813 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-16 00:31:35,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,813 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,813 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,814 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,814 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,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-16 00:31:35,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,816 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,816 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,817 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,817 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,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-16 00:31:35,818 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,818 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,819 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,819 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,820 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-16 00:31:35,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,821 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,822 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,822 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,823 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-16 00:31:35,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,823 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,824 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,824 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,825 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-16 00:31:35,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,826 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,827 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,827 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,827 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,828 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-16 00:31:35,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,829 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,829 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,829 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,830 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,830 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,831 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-16 00:31:35,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,831 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,832 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,832 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,833 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-16 00:31:35,834 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,834 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,835 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:35,835 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:35,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,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-16 00:31:35,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,838 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,839 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,839 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,840 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-16 00:31:35,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,843 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-16 00:31:35,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,844 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,844 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,845 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,845 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-16 00:31:35,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,846 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,847 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,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-16 00:31:35,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,849 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,849 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,850 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,851 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-16 00:31:35,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,852 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,853 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-16 00:31:35,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,854 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,855 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,855 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,856 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-16 00:31:35,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,857 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,859 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-16 00:31:35,859 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,859 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,859 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,860 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,860 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,860 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,861 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-16 00:31:35,862 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,862 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,862 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,862 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,863 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,864 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-16 00:31:35,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,864 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:31:35,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,865 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:31:35,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:31:35,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,866 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-16 00:31:35,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,867 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:31:35,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,870 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:31:35,870 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:35,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,880 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-16 00:31:35,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,881 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:31:35,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,884 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:31:35,885 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:31:35,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:31:35,898 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-16 00:31:35,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:31:35,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:31:35,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:31:35,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:31:35,901 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:31:35,901 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:31:35,918 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:31:35,942 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:31:35,942 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:31:35,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:31:35,944 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:31:35,945 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:31:35,946 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length rec_strcopy_helper_#in~source.base)_1, rec_strcopy_helper_#in~dest.offset) = 1*v_rep(select #length rec_strcopy_helper_#in~source.base)_1 - 1*rec_strcopy_helper_#in~dest.offset Supporting invariants [] [2019-11-16 00:31:35,979 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-16 00:31:35,987 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:31:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:36,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-16 00:31:36,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:36,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:31:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:36,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:31:36,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:36,193 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-16 00:31:36,194 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-11-16 00:31:36,194 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-16 00:31:36,357 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 33 states and 36 transitions. Complement of second has 12 states. [2019-11-16 00:31:36,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 5 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:31:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:31:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-11-16 00:31:36,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-16 00:31:36,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:36,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-16 00:31:36,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:36,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 18 letters. Loop has 6 letters. [2019-11-16 00:31:36,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:31:36,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2019-11-16 00:31:36,361 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:31:36,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2019-11-16 00:31:36,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:31:36,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:31:36,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:31:36,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:31:36,361 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:36,362 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:36,362 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:31:36,362 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:31:36,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:31:36,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:31:36,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:31:36,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:31:36 BoogieIcfgContainer [2019-11-16 00:31:36,367 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:31:36,368 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:31:36,368 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:31:36,368 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:31:36,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:30" (3/4) ... [2019-11-16 00:31:36,372 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:31:36,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:31:36,373 INFO L168 Benchmark]: Toolchain (without parser) took 6232.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 943.4 MB in the beginning and 937.1 MB in the end (delta: 6.3 MB). Peak memory consumption was 190.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:36,374 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:31:36,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:36,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.13 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-16 00:31:36,376 INFO L168 Benchmark]: Boogie Preprocessor took 23.25 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-16 00:31:36,377 INFO L168 Benchmark]: RCFGBuilder took 346.88 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:36,377 INFO L168 Benchmark]: BuchiAutomizer took 5547.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 943.2 MB in the end (delta: 164.8 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:36,378 INFO L168 Benchmark]: Witness Printer took 4.41 ms. Allocated memory is still 1.2 GB. Free memory was 943.2 MB in the beginning and 937.1 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:31:36,385 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.13 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 23.25 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 346.88 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5547.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 943.2 MB in the end (delta: 164.8 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.41 ms. Allocated memory is still 1.2 GB. Free memory was 943.2 MB in the beginning and 937.1 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[source] + -1 * dest and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 75 SDtfs, 42 SDslu, 237 SDs, 0 SdLazy, 151 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital149 mio100 ax100 hnf100 lsp95 ukn58 mio100 lsp49 div100 bol100 ite100 ukn100 eq181 hnf79 smp100 dnf101 smp98 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...