./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cd11d9219c053905d9335ee000e770be1f4c60e6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:26:24,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:26:24,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:26:24,012 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:26:24,012 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:26:24,013 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:26:24,014 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:26:24,014 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:26:24,015 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:26:24,016 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:26:24,016 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:26:24,016 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:26:24,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:26:24,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:26:24,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:26:24,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:26:24,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:26:24,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:26:24,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:26:24,021 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:26:24,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:26:24,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:26:24,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:26:24,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:26:24,024 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:26:24,024 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:26:24,025 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:26:24,025 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:26:24,026 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:26:24,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:26:24,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:26:24,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:26:24,027 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:26:24,027 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:26:24,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:26:24,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:26:24,028 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 09:26:24,036 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:26:24,036 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:26:24,037 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:26:24,037 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:26:24,037 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:26:24,037 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 09:26:24,037 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 09:26:24,037 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 09:26:24,037 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 09:26:24,037 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 09:26:24,038 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:26:24,038 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 09:26:24,039 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:26:24,039 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:26:24,039 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 09:26:24,039 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:26:24,039 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:26:24,039 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 09:26:24,039 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 09:26:24,040 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd11d9219c053905d9335ee000e770be1f4c60e6 [2018-12-08 09:26:24,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:26:24,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:26:24,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:26:24,066 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:26:24,066 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:26:24,066 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc_true-termination.c.i [2018-12-08 09:26:24,100 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/data/13b70e03d/4a267e81da9c41998fc256d6a1ee04b6/FLAG7f711350e [2018-12-08 09:26:24,497 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:26:24,497 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc_true-termination.c.i [2018-12-08 09:26:24,501 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/data/13b70e03d/4a267e81da9c41998fc256d6a1ee04b6/FLAG7f711350e [2018-12-08 09:26:24,509 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/data/13b70e03d/4a267e81da9c41998fc256d6a1ee04b6 [2018-12-08 09:26:24,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:26:24,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:26:24,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:26:24,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:26:24,514 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:26:24,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd688bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24, skipping insertion in model container [2018-12-08 09:26:24,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:26:24,529 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:26:24,610 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:26:24,616 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:26:24,626 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:26:24,634 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:26:24,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24 WrapperNode [2018-12-08 09:26:24,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:26:24,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:26:24,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:26:24,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:26:24,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:26:24,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:26:24,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:26:24,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:26:24,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (1/1) ... [2018-12-08 09:26:24,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:26:24,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:26:24,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:26:24,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:26:24,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f3c9d58-9c37-4d9f-8ae0-efd3d0b420d0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:26:24,736 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2018-12-08 09:26:24,737 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2018-12-08 09:26:24,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:26:24,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:26:24,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:26:24,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:26:24,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 09:26:24,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:26:24,839 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:26:24,839 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 09:26:24,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:26:24 BoogieIcfgContainer [2018-12-08 09:26:24,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:26:24,840 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 09:26:24,840 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 09:26:24,842 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 09:26:24,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:26:24,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 09:26:24" (1/3) ... [2018-12-08 09:26:24,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26a0184f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:26:24, skipping insertion in model container [2018-12-08 09:26:24,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:26:24,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:26:24" (2/3) ... [2018-12-08 09:26:24,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26a0184f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:26:24, skipping insertion in model container [2018-12-08 09:26:24,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:26:24,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:26:24" (3/3) ... [2018-12-08 09:26:24,845 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc_true-termination.c.i [2018-12-08 09:26:24,877 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:26:24,877 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 09:26:24,877 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 09:26:24,877 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 09:26:24,877 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:26:24,877 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:26:24,878 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 09:26:24,878 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:26:24,878 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 09:26:24,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-08 09:26:24,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 09:26:24,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:26:24,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:26:24,907 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:26:24,908 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:26:24,908 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 09:26:24,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-08 09:26:24,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 09:26:24,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:26:24,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:26:24,909 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:26:24,909 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:26:24,914 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~ret6.base, main_#t~ret6.offset, main_#t~ret7.base, main_#t~ret7.offset, main_~length~0, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5; 17#L35true assume main_~length~0 < 1;main_~length~0 := 1; 12#L35-2true build_nondet_String_#in~length := main_~length~0;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.alloc(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; 15#L12true main_#t~ret6.base, main_#t~ret6.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret6.base, main_#t~ret6.offset;havoc main_#t~ret6.base, main_#t~ret6.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset, rec_strcopy_#in~length := main_~original~0.base, main_~original~0.offset, main_~length~0;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length, 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;rec_strcopy_~length := rec_strcopy_#in~length;call rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset := #Ultimate.alloc(rec_strcopy_~length);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset; 4#L28true call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 11#rec_strcopy_helperENTRYtrue [2018-12-08 09:26:24,914 INFO L796 eck$LassoCheckResult]: Loop: 11#rec_strcopy_helperENTRYtrue ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1); 7#L21true assume 0 != #t~mem3;havoc #t~mem3; 14#L22true call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 11#rec_strcopy_helperENTRYtrue [2018-12-08 09:26:24,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:26:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1155759793, now seen corresponding path program 1 times [2018-12-08 09:26:24,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:26:24,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:26:24,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:24,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:26:24,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:26:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:26:25,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:26:25,003 INFO L82 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 1 times [2018-12-08 09:26:25,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:26:25,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:26:25,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:25,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:26:25,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:26:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:26:25,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:26:25,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1512818648, now seen corresponding path program 1 times [2018-12-08 09:26:25,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:26:25,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:26:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:25,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:26:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:26:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:26:25,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:26:25,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:26:25,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:26:25,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:26:25,287 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 7 states. [2018-12-08 09:26:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:26:25,379 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-08 09:26:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:26:25,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-12-08 09:26:25,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 09:26:25,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 9 transitions. [2018-12-08 09:26:25,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 09:26:25,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 09:26:25,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 9 transitions. [2018-12-08 09:26:25,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:26:25,387 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-08 09:26:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 9 transitions. [2018-12-08 09:26:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-08 09:26:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-08 09:26:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-08 09:26:25,406 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-08 09:26:25,406 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-08 09:26:25,406 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 09:26:25,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 9 transitions. [2018-12-08 09:26:25,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 09:26:25,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:26:25,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:26:25,407 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:26:25,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:26:25,407 INFO L794 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 67#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~ret6.base, main_#t~ret6.offset, main_#t~ret7.base, main_#t~ret7.offset, main_~length~0, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5; 68#L35 assume !(main_~length~0 < 1); 74#L35-2 build_nondet_String_#in~length := main_~length~0;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.alloc(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; 75#L12 main_#t~ret6.base, main_#t~ret6.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret6.base, main_#t~ret6.offset;havoc main_#t~ret6.base, main_#t~ret6.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset, rec_strcopy_#in~length := main_~original~0.base, main_~original~0.offset, main_~length~0;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length, 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;rec_strcopy_~length := rec_strcopy_#in~length;call rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset := #Ultimate.alloc(rec_strcopy_~length);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset; 72#L28 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 70#rec_strcopy_helperENTRY [2018-12-08 09:26:25,407 INFO L796 eck$LassoCheckResult]: Loop: 70#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~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1); 73#L21 assume 0 != #t~mem3;havoc #t~mem3; 71#L22 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 70#rec_strcopy_helperENTRY [2018-12-08 09:26:25,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:26:25,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1155819375, now seen corresponding path program 1 times [2018-12-08 09:26:25,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:26:25,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:26:25,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:25,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:26:25,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:26:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:26:25,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:26:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 2 times [2018-12-08 09:26:25,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:26:25,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:26:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:25,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:26:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:26:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:26:25,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:26:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash 262188714, now seen corresponding path program 1 times [2018-12-08 09:26:25,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:26:25,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:26:25,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:25,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:26:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:26:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:26:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:26:25,712 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2018-12-08 09:26:25,878 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:26:25,879 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:26:25,879 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:26:25,879 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:26:25,879 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:26:25,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:26:25,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:26:25,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:26:25,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc_true-termination.c.i_Iteration2_Lasso [2018-12-08 09:26:25,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:26:25,880 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:26:25,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:25,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:26,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:26,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:26:26,201 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:26:26,204 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:26:26,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:26:26,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:26:26,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:26:26,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:26:26,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:26:26,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:26:26,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:26:26,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:26:26,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:26:26,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,274 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:26:26,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,275 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:26:26,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:26:26,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:26:26,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:26:26,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:26:26,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:26:26,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,285 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:26:26,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,286 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:26:26,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:26:26,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:26:26,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:26:26,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:26:26,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:26:26,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:26:26,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:26:26,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:26:26,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:26:26,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:26:26,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:26:26,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:26:26,323 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 09:26:26,323 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 09:26:26,324 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:26:26,325 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:26:26,325 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:26:26,325 INFO L520 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 [] [2018-12-08 09:26:26,340 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 09:26:26,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 09:26:26,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:26:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:26:26,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:26:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:26:26,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:26:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:26:26,443 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-08 09:26:26,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1 Second operand 5 states. [2018-12-08 09:26:26,501 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 16 states and 16 transitions. Complement of second has 9 states. [2018-12-08 09:26:26,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 09:26:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:26:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2018-12-08 09:26:26,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-08 09:26:26,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:26:26,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-08 09:26:26,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:26:26,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-08 09:26:26,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:26:26,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2018-12-08 09:26:26,504 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:26:26,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-12-08 09:26:26,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 09:26:26,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 09:26:26,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 09:26:26,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:26:26,505 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:26:26,505 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:26:26,505 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:26:26,505 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 09:26:26,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 09:26:26,505 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:26:26,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 09:26:26,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 09:26:26 BoogieIcfgContainer [2018-12-08 09:26:26,509 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 09:26:26,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:26:26,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:26:26,509 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:26:26,509 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:26:24" (3/4) ... [2018-12-08 09:26:26,512 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 09:26:26,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:26:26,512 INFO L168 Benchmark]: Toolchain (without parser) took 2001.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 961.3 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:26:26,513 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:26:26,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 123.44 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:26:26,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.07 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:26:26,514 INFO L168 Benchmark]: Boogie Preprocessor took 43.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:26:26,515 INFO L168 Benchmark]: RCFGBuilder took 139.69 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: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2018-12-08 09:26:26,515 INFO L168 Benchmark]: BuchiAutomizer took 1668.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.5 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2018-12-08 09:26:26,516 INFO L168 Benchmark]: Witness Printer took 2.84 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. [2018-12-08 09:26:26,518 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 123.44 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.07 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 139.69 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: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1668.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.5 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.84 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[source] + -1 * dest and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 18 SDslu, 91 SDs, 0 SdLazy, 50 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax100 hnf100 lsp96 ukn63 mio100 lsp50 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...