./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/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 32bit --witnessprinter.graph.data.programhash 13552cca99ea1df7c66453eb01c81a7b6abf3a1a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:35:01,415 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:35:01,416 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:35:01,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:35:01,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:35:01,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:35:01,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:35:01,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:35:01,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:35:01,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:35:01,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:35:01,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:35:01,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:35:01,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:35:01,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:35:01,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:35:01,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:35:01,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:35:01,434 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:35:01,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:35:01,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:35:01,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:35:01,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:35:01,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:35:01,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:35:01,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:35:01,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:35:01,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:35:01,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:35:01,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:35:01,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:35:01,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:35:01,442 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:35:01,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:35:01,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:35:01,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:35:01,444 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 08:35:01,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:35:01,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:35:01,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:35:01,456 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:35:01,456 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:35:01,456 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 08:35:01,456 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 08:35:01,457 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 08:35:01,457 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 08:35:01,457 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 08:35:01,457 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 08:35:01,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:35:01,457 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:35:01,457 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:35:01,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:35:01,457 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:35:01,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:35:01,458 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 08:35:01,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 08:35:01,458 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 08:35:01,458 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:35:01,458 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:35:01,458 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 08:35:01,458 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 08:35:01,459 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:35:01,459 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:35:01,459 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 08:35:01,459 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:35:01,459 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:35:01,459 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 08:35:01,459 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 08:35:01,459 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_03906998-12dd-4052-a5e0-7df7da359d09/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13552cca99ea1df7c66453eb01c81a7b6abf3a1a [2018-11-10 08:35:01,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:35:01,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:35:01,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:35:01,491 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:35:01,491 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:35:01,492 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-11-10 08:35:01,527 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/data/b05dfd709/0ebee1753c46434ba9d46138ff4871ab/FLAG08adade8d [2018-11-10 08:35:01,951 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:35:01,952 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-11-10 08:35:01,958 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/data/b05dfd709/0ebee1753c46434ba9d46138ff4871ab/FLAG08adade8d [2018-11-10 08:35:01,967 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/data/b05dfd709/0ebee1753c46434ba9d46138ff4871ab [2018-11-10 08:35:01,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:35:01,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:35:01,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:35:01,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:35:01,972 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:35:01,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:35:01" (1/1) ... [2018-11-10 08:35:01,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8e72be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:01, skipping insertion in model container [2018-11-10 08:35:01,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:35:01" (1/1) ... [2018-11-10 08:35:01,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:35:02,006 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:35:02,186 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:35:02,193 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:35:02,221 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:35:02,244 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:35:02,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02 WrapperNode [2018-11-10 08:35:02,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:35:02,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:35:02,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:35:02,245 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:35:02,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (1/1) ... [2018-11-10 08:35:02,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (1/1) ... [2018-11-10 08:35:02,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:35:02,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:35:02,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:35:02,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:35:02,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (1/1) ... [2018-11-10 08:35:02,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (1/1) ... [2018-11-10 08:35:02,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (1/1) ... [2018-11-10 08:35:02,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (1/1) ... [2018-11-10 08:35:02,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (1/1) ... [2018-11-10 08:35:02,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (1/1) ... [2018-11-10 08:35:02,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (1/1) ... [2018-11-10 08:35:02,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:35:02,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:35:02,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:35:02,339 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:35:02,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03906998-12dd-4052-a5e0-7df7da359d09/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:35:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 08:35:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 08:35:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:35:02,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:35:02,553 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:35:02,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:35:02 BoogieIcfgContainer [2018-11-10 08:35:02,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:35:02,554 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 08:35:02,554 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 08:35:02,556 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 08:35:02,557 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:35:02,557 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 08:35:01" (1/3) ... [2018-11-10 08:35:02,558 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2415a7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:35:02, skipping insertion in model container [2018-11-10 08:35:02,558 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:35:02,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:35:02" (2/3) ... [2018-11-10 08:35:02,558 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2415a7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:35:02, skipping insertion in model container [2018-11-10 08:35:02,558 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:35:02,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:35:02" (3/3) ... [2018-11-10 08:35:02,559 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-11-10 08:35:02,599 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:35:02,600 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 08:35:02,600 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 08:35:02,600 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 08:35:02,600 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:35:02,600 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:35:02,600 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 08:35:02,601 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:35:02,601 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 08:35:02,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 08:35:02,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 08:35:02,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:35:02,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:35:02,628 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:35:02,628 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 08:35:02,629 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 08:35:02,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 08:35:02,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 08:35:02,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:35:02,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:35:02,631 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:35:02,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 08:35:02,638 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 18#L552true assume !(main_~length1~0 < 1); 22#L552-2true assume !(main_~length2~0 < 2); 9#L555-1true assume !(main_~length3~0 < 1); 3#L558-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 13#L564true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L564 17#L564-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L564-1 8#L565true assume { :begin_inline_cstrcat } true;cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 23#L544-5true [2018-11-10 08:35:02,639 INFO L795 eck$LassoCheckResult]: Loop: 23#L544-5true assume true; 10#L544-1true SUMMARY for call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); srcloc: L544-1 14#L544-2true assume !!(cstrcat_#t~mem3 != 0);havoc cstrcat_#t~mem3; 21#L544-4true cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset := cstrcat_~s.base, cstrcat_~s.offset + 1;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_~s.base, cstrcat_~s.offset + 1;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset; 23#L544-5true [2018-11-10 08:35:02,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-11-10 08:35:02,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:35:02,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:35:02,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:02,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:02,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1909764, now seen corresponding path program 1 times [2018-11-10 08:35:02,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:35:02,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:35:02,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:02,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:02,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:02,765 INFO L82 PathProgramCache]: Analyzing trace with hash 542953743, now seen corresponding path program 1 times [2018-11-10 08:35:02,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:35:02,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:35:02,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:02,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:02,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:03,124 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2018-11-10 08:35:03,232 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:35:03,233 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:35:03,233 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:35:03,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:35:03,234 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:35:03,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:35:03,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:35:03,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:35:03,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 08:35:03,234 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:35:03,235 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:35:03,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,502 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2018-11-10 08:35:03,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:03,934 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:35:03,939 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:35:03,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:03,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:03,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:03,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:03,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:03,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:03,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:03,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:03,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:03,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:03,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:03,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:03,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:03,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:03,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:03,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:03,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:03,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:03,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:03,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:03,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:03,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:03,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:03,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:03,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:03,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:03,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:03,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:03,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:03,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:03,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:03,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:03,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:03,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:03,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:03,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:03,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:03,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:03,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:03,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:03,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:03,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:03,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:03,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:03,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:03,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:03,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:04,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:04,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:04,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:04,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:04,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:04,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:04,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:04,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:04,046 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:35:04,078 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 08:35:04,079 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 08:35:04,080 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:35:04,082 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:35:04,082 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:35:04,083 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1) = -1*ULTIMATE.start_cstrcat_~s.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 Supporting invariants [] [2018-11-10 08:35:04,106 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 08:35:04,113 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:35:04,115 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 08:35:04,115 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 08:35:04,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:04,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:35:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:04,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:35:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:35:04,192 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 08:35:04,193 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 5 states. [2018-11-10 08:35:04,262 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 5 states. Result 56 states and 67 transitions. Complement of second has 8 states. [2018-11-10 08:35:04,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:35:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:35:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-10 08:35:04,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-10 08:35:04,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:35:04,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-10 08:35:04,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:35:04,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 9 letters. Loop has 8 letters. [2018-11-10 08:35:04,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:35:04,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2018-11-10 08:35:04,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 08:35:04,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 23 states and 27 transitions. [2018-11-10 08:35:04,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 08:35:04,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 08:35:04,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 08:35:04,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:35:04,273 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 08:35:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 08:35:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-11-10 08:35:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 08:35:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-10 08:35:04,289 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-10 08:35:04,289 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-10 08:35:04,289 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 08:35:04,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-10 08:35:04,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 08:35:04,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:35:04,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:35:04,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:35:04,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 08:35:04,291 INFO L793 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 202#L552 assume !(main_~length1~0 < 1); 206#L552-2 assume !(main_~length2~0 < 2); 196#L555-1 assume !(main_~length3~0 < 1); 189#L558-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 190#L564 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L564 200#L564-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L564-1 194#L565 assume { :begin_inline_cstrcat } true;cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 195#L544-5 assume true; 198#L544-1 SUMMARY for call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); srcloc: L544-1 199#L544-2 assume !(cstrcat_#t~mem3 != 0);havoc cstrcat_#t~mem3; 203#L545-5 [2018-11-10 08:35:04,291 INFO L795 eck$LassoCheckResult]: Loop: 203#L545-5 assume true; 191#L545 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s.base, cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#t~post4.base, cstrcat_#t~post4.offset + 1;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~append.base, cstrcat_~append.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#t~post5.base, cstrcat_#t~post5.offset + 1; 192#L545-1 SUMMARY for call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1); srcloc: L545-1 193#L545-2 SUMMARY for call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); srcloc: L545-2 197#L545-3 assume !!(cstrcat_#t~mem6 != 0);havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~mem6; 203#L545-5 [2018-11-10 08:35:04,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:04,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535287, now seen corresponding path program 1 times [2018-11-10 08:35:04,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:35:04,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:35:04,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:04,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:04,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:04,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash 72589779, now seen corresponding path program 1 times [2018-11-10 08:35:04,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:35:04,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:35:04,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:04,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:04,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:04,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:04,321 INFO L82 PathProgramCache]: Analyzing trace with hash 291577181, now seen corresponding path program 1 times [2018-11-10 08:35:04,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:35:04,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:35:04,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:04,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:04,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:04,573 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2018-11-10 08:35:04,655 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:35:04,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:35:04,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:35:04,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:35:04,655 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:35:04,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:35:04,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:35:04,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:35:04,656 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 08:35:04,656 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:35:04,656 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:35:04,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:04,926 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 96 [2018-11-10 08:35:05,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:05,380 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:35:05,380 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:35:05,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:05,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,421 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,439 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:35:05,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,440 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:35:05,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:05,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,463 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:35:05,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,466 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:35:05,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:05,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,472 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:35:05,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,473 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:35:05,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:05,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:05,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:05,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:05,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:05,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:05,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:05,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:05,516 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:35:05,546 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 08:35:05,546 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 08:35:05,546 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:35:05,547 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:35:05,548 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:35:05,548 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2, ULTIMATE.start_cstrcat_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 - 1*ULTIMATE.start_cstrcat_~s.offset Supporting invariants [] [2018-11-10 08:35:05,604 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 08:35:05,607 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 08:35:05,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:05,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:35:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:05,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:35:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:35:05,690 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 08:35:05,690 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 08:35:05,763 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 35 states and 41 transitions. Complement of second has 10 states. [2018-11-10 08:35:05,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-10 08:35:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 08:35:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 08:35:05,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 08:35:05,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:35:05,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 08:35:05,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:35:05,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 08:35:05,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:35:05,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2018-11-10 08:35:05,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 08:35:05,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 24 states and 28 transitions. [2018-11-10 08:35:05,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 08:35:05,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 08:35:05,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-10 08:35:05,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:35:05,768 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 08:35:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-10 08:35:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-10 08:35:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 08:35:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-10 08:35:05,770 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 08:35:05,770 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 08:35:05,770 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 08:35:05,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-10 08:35:05,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 08:35:05,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:35:05,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:35:05,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:35:05,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 08:35:05,776 INFO L793 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 412#L552 assume !(main_~length1~0 < 1); 417#L552-2 assume !(main_~length2~0 < 2); 407#L555-1 assume !(main_~length3~0 < 1); 400#L558-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 401#L564 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L564 413#L564-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L564-1 405#L565 assume { :begin_inline_cstrcat } true;cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 406#L544-5 assume true; 408#L544-1 SUMMARY for call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); srcloc: L544-1 409#L544-2 assume !!(cstrcat_#t~mem3 != 0);havoc cstrcat_#t~mem3; 414#L544-4 cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset := cstrcat_~s.base, cstrcat_~s.offset + 1;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_~s.base, cstrcat_~s.offset + 1;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset; 418#L544-5 assume true; 419#L544-1 SUMMARY for call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); srcloc: L544-1 420#L544-2 assume !(cstrcat_#t~mem3 != 0);havoc cstrcat_#t~mem3; 415#L545-5 [2018-11-10 08:35:05,776 INFO L795 eck$LassoCheckResult]: Loop: 415#L545-5 assume true; 402#L545 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s.base, cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#t~post4.base, cstrcat_#t~post4.offset + 1;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~append.base, cstrcat_~append.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#t~post5.base, cstrcat_#t~post5.offset + 1; 403#L545-1 SUMMARY for call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1); srcloc: L545-1 404#L545-2 SUMMARY for call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); srcloc: L545-2 410#L545-3 assume !!(cstrcat_#t~mem6 != 0);havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~mem6; 415#L545-5 [2018-11-10 08:35:05,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:05,776 INFO L82 PathProgramCache]: Analyzing trace with hash 288152788, now seen corresponding path program 1 times [2018-11-10 08:35:05,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:35:05,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:35:05,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:05,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:05,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:05,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:05,797 INFO L82 PathProgramCache]: Analyzing trace with hash 72589779, now seen corresponding path program 2 times [2018-11-10 08:35:05,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:35:05,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:35:05,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:05,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:05,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:05,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1596010272, now seen corresponding path program 1 times [2018-11-10 08:35:05,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:35:05,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:35:05,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:05,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:35:05,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:35:06,131 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 112 [2018-11-10 08:35:06,210 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:35:06,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:35:06,210 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:35:06,210 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:35:06,210 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:35:06,210 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:35:06,210 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:35:06,210 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:35:06,210 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 08:35:06,210 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:35:06,210 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:35:06,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,500 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-11-10 08:35:06,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:06,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:35:07,013 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:35:07,013 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:35:07,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:07,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:07,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:07,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:07,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:35:07,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:35:07,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:35:07,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,038 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:35:07,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,040 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:35:07,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:07,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:07,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:07,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:35:07,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:35:07,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:35:07,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:35:07,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:35:07,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:35:07,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:35:07,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:35:07,079 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:35:07,107 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 08:35:07,107 INFO L444 ModelExtractionUtils]: 55 out of 61 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 08:35:07,108 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:35:07,108 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:35:07,108 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:35:07,109 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrcat_~s.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrcat_~s.offset Supporting invariants [] [2018-11-10 08:35:07,178 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2018-11-10 08:35:07,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:35:07,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 08:35:07,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 08:35:07,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:07,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:35:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:07,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:35:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:35:07,247 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 08:35:07,247 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 08:35:07,293 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 32 transitions. Complement of second has 8 states. [2018-11-10 08:35:07,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:35:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 08:35:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-10 08:35:07,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-10 08:35:07,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:35:07,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-10 08:35:07,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:35:07,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 16 letters. Loop has 10 letters. [2018-11-10 08:35:07,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:35:07,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-10 08:35:07,295 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:35:07,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2018-11-10 08:35:07,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 08:35:07,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 08:35:07,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 08:35:07,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:35:07,296 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:35:07,296 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:35:07,296 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:35:07,296 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 08:35:07,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:35:07,296 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:35:07,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 08:35:07,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 08:35:07 BoogieIcfgContainer [2018-11-10 08:35:07,301 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 08:35:07,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:35:07,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:35:07,301 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:35:07,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:35:02" (3/4) ... [2018-11-10 08:35:07,304 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 08:35:07,304 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:35:07,305 INFO L168 Benchmark]: Toolchain (without parser) took 5336.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 96.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:35:07,306 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:35:07,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.69 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:35:07,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 08:35:07,307 INFO L168 Benchmark]: Boogie Preprocessor took 18.32 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:35:07,307 INFO L168 Benchmark]: RCFGBuilder took 214.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:35:07,307 INFO L168 Benchmark]: BuchiAutomizer took 4746.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:35:07,308 INFO L168 Benchmark]: Witness Printer took 3.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:35:07,310 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.69 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.32 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 214.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4746.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.35 ms. Allocated memory is still 1.3 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 52 SDtfs, 80 SDslu, 68 SDs, 0 SdLazy, 47 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf99 lsp97 ukn101 mio100 lsp43 div100 bol100 ite100 ukn100 eq194 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 4 VariablesLoop: 4 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...