./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/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 a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 13:49:22,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 13:49:22,254 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 13:49:22,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 13:49:22,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 13:49:22,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 13:49:22,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 13:49:22,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 13:49:22,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 13:49:22,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 13:49:22,264 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 13:49:22,264 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 13:49:22,265 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 13:49:22,265 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 13:49:22,266 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 13:49:22,266 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 13:49:22,267 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 13:49:22,267 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 13:49:22,268 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 13:49:22,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 13:49:22,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 13:49:22,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 13:49:22,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 13:49:22,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 13:49:22,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 13:49:22,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 13:49:22,273 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 13:49:22,273 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 13:49:22,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 13:49:22,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 13:49:22,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 13:49:22,274 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 13:49:22,275 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 13:49:22,275 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 13:49:22,275 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 13:49:22,276 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 13:49:22,276 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 13:49:22,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 13:49:22,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 13:49:22,284 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 13:49:22,284 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 13:49:22,284 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 13:49:22,284 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 13:49:22,285 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 13:49:22,285 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 13:49:22,285 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 13:49:22,285 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 13:49:22,285 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 13:49:22,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 13:49:22,285 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 13:49:22,285 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 13:49:22,285 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 13:49:22,285 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 13:49:22,285 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 13:49:22,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 13:49:22,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 13:49:22,286 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 13:49:22,286 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 13:49:22,286 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 13:49:22,286 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 13:49:22,286 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 13:49:22,286 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 13:49:22,286 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 13:49:22,286 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 13:49:22,286 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 13:49:22,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 13:49:22,287 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 13:49:22,287 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 13:49:22,287 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 13:49:22,287 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_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/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 -> a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 [2018-12-08 13:49:22,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 13:49:22,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 13:49:22,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 13:49:22,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 13:49:22,314 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 13:49:22,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-12-08 13:49:22,348 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/data/ca2c4fbd4/5607df65fc3e4e098ad200056b398040/FLAG984d28584 [2018-12-08 13:49:22,723 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 13:49:22,724 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-12-08 13:49:22,729 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/data/ca2c4fbd4/5607df65fc3e4e098ad200056b398040/FLAG984d28584 [2018-12-08 13:49:23,096 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/data/ca2c4fbd4/5607df65fc3e4e098ad200056b398040 [2018-12-08 13:49:23,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 13:49:23,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 13:49:23,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 13:49:23,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 13:49:23,110 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 13:49:23,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5b6929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23, skipping insertion in model container [2018-12-08 13:49:23,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 13:49:23,141 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 13:49:23,286 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:49:23,293 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 13:49:23,355 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:49:23,375 INFO L195 MainTranslator]: Completed translation [2018-12-08 13:49:23,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23 WrapperNode [2018-12-08 13:49:23,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 13:49:23,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 13:49:23,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 13:49:23,376 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 13:49:23,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 13:49:23,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 13:49:23,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 13:49:23,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 13:49:23,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (1/1) ... [2018-12-08 13:49:23,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 13:49:23,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 13:49:23,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 13:49:23,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 13:49:23,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:49:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 13:49:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 13:49:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 13:49:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 13:49:23,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 13:49:23,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 13:49:23,614 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 13:49:23,614 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-08 13:49:23,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:49:23 BoogieIcfgContainer [2018-12-08 13:49:23,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 13:49:23,615 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 13:49:23,615 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 13:49:23,617 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 13:49:23,618 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 13:49:23,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 01:49:23" (1/3) ... [2018-12-08 13:49:23,619 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a9a3b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 01:49:23, skipping insertion in model container [2018-12-08 13:49:23,619 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 13:49:23,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:49:23" (2/3) ... [2018-12-08 13:49:23,619 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a9a3b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 01:49:23, skipping insertion in model container [2018-12-08 13:49:23,619 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 13:49:23,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:49:23" (3/3) ... [2018-12-08 13:49:23,620 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-12-08 13:49:23,654 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 13:49:23,655 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 13:49:23,655 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 13:49:23,655 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 13:49:23,655 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 13:49:23,655 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 13:49:23,655 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 13:49:23,655 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 13:49:23,655 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 13:49:23,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-12-08 13:49:23,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-08 13:49:23,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:49:23,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:49:23,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 13:49:23,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 13:49:23,682 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 13:49:23,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-12-08 13:49:23,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-08 13:49:23,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:49:23,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:49:23,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 13:49:23,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 13:49:23,689 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 12#L581true assume !(main_~length1~0 < 1); 3#L581-2true assume !(main_~length2~0 < 1); 27#L584-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 6#L566true assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 30#L544-4true [2018-12-08 13:49:23,689 INFO L796 eck$LassoCheckResult]: Loop: 30#L544-4true call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 8#L544-1true assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 26#L544-3true cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 30#L544-4true [2018-12-08 13:49:23,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-12-08 13:49:23,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:23,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:23,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:23,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:23,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:23,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:23,789 INFO L82 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2018-12-08 13:49:23,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:23,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:23,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:23,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:23,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:23,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2018-12-08 13:49:23,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:23,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:23,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:23,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:23,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:24,123 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2018-12-08 13:49:24,226 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-08 13:49:24,236 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:49:24,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:49:24,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:49:24,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:49:24,237 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:49:24,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:49:24,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:49:24,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:49:24,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-08 13:49:24,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:49:24,238 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:49:24,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:24,521 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2018-12-08 13:49:24,886 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:49:24,890 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:49:24,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:24,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:24,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:24,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:24,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,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-12-08 13:49:24,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:24,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:24,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:24,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,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-12-08 13:49:24,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:24,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:24,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:24,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:24,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:24,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:24,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:24,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:24,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,973 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:49:24,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,974 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:49:24,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:24,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,978 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:49:24,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,979 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:49:24,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:24,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:24,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:24,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:24,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:24,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:24,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:24,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:24,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:25,011 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:49:25,032 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-12-08 13:49:25,032 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 13:49:25,033 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:49:25,034 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 13:49:25,034 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:49:25,035 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1) = -1*ULTIMATE.start_cstrlen_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1 Supporting invariants [] [2018-12-08 13:49:25,073 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-08 13:49:25,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 13:49:25,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:25,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:25,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:49:25,174 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-12-08 13:49:25,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 4 states. [2018-12-08 13:49:25,235 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 4 states. Result 80 states and 111 transitions. Complement of second has 7 states. [2018-12-08 13:49:25,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 13:49:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 13:49:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-12-08 13:49:25,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-08 13:49:25,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:25,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-08 13:49:25,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:25,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-08 13:49:25,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:25,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 111 transitions. [2018-12-08 13:49:25,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 13:49:25,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 27 states and 36 transitions. [2018-12-08 13:49:25,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-08 13:49:25,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-08 13:49:25,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-12-08 13:49:25,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:49:25,245 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-08 13:49:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-12-08 13:49:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-08 13:49:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-08 13:49:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-12-08 13:49:25,261 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-08 13:49:25,261 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-08 13:49:25,261 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 13:49:25,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2018-12-08 13:49:25,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 13:49:25,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:49:25,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:49:25,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:49:25,262 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:49:25,262 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 244#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 245#L581 assume !(main_~length1~0 < 1); 231#L581-2 assume !(main_~length2~0 < 1); 232#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 237#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 238#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 240#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 241#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 233#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 234#L568-4 [2018-12-08 13:49:25,263 INFO L796 eck$LassoCheckResult]: Loop: 234#L568-4 goto; 250#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 246#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 247#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 235#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 236#L551 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 248#L559 cstrstr_#t~ret16 := cstrncmp_#res; 239#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 234#L568-4 [2018-12-08 13:49:25,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:25,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2018-12-08 13:49:25,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:25,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:25,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:25,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1752516368, now seen corresponding path program 1 times [2018-12-08 13:49:25,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:25,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:49:25,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:49:25,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:49:25,305 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 13:49:25,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 13:49:25,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 13:49:25,308 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-08 13:49:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:49:25,331 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-12-08 13:49:25,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 13:49:25,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2018-12-08 13:49:25,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-08 13:49:25,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2018-12-08 13:49:25,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-08 13:49:25,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-08 13:49:25,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-12-08 13:49:25,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:49:25,334 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-08 13:49:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-12-08 13:49:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-08 13:49:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-08 13:49:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-12-08 13:49:25,336 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-08 13:49:25,336 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-08 13:49:25,336 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 13:49:25,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-12-08 13:49:25,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-08 13:49:25,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:49:25,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:49:25,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:49:25,337 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:49:25,337 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 317#L581 assume !(main_~length1~0 < 1); 299#L581-2 assume !(main_~length2~0 < 1); 300#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 307#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 308#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 312#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 313#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 301#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 302#L568-4 [2018-12-08 13:49:25,337 INFO L796 eck$LassoCheckResult]: Loop: 302#L568-4 goto; 298#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 303#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 296#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 297#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 304#L551 assume !(0 == cstrncmp_~n % 4294967296); 321#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 310#L554 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 311#L559 cstrstr_#t~ret16 := cstrncmp_#res; 309#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 302#L568-4 [2018-12-08 13:49:25,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2018-12-08 13:49:25,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:25,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:25,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:25,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash 542190293, now seen corresponding path program 1 times [2018-12-08 13:49:25,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:25,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:49:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:25,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1106695813, now seen corresponding path program 1 times [2018-12-08 13:49:25,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:25,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:25,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:25,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:49:25,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:49:25,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 13:49:25,597 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-12-08 13:49:25,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 13:49:25,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 13:49:25,641 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-08 13:49:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:49:25,687 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-08 13:49:25,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:49:25,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-12-08 13:49:25,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-08 13:49:25,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2018-12-08 13:49:25,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-08 13:49:25,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-08 13:49:25,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-12-08 13:49:25,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:49:25,689 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-08 13:49:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-12-08 13:49:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-08 13:49:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 13:49:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-12-08 13:49:25,691 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-08 13:49:25,691 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-08 13:49:25,691 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 13:49:25,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-12-08 13:49:25,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-08 13:49:25,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:49:25,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:49:25,692 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:49:25,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 13:49:25,693 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 398#L581 assume !(main_~length1~0 < 1); 378#L581-2 assume !(main_~length2~0 < 1); 379#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 387#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 388#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 393#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 394#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 380#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 381#L568-4 goto; 377#L569-2 [2018-12-08 13:49:25,693 INFO L796 eck$LassoCheckResult]: Loop: 377#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 382#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 376#L569 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 377#L569-2 [2018-12-08 13:49:25,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2018-12-08 13:49:25,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:25,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:25,708 INFO L82 PathProgramCache]: Analyzing trace with hash 71663, now seen corresponding path program 1 times [2018-12-08 13:49:25,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:25,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:25,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:25,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:25,713 INFO L82 PathProgramCache]: Analyzing trace with hash 194815290, now seen corresponding path program 1 times [2018-12-08 13:49:25,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:25,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:25,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:25,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:26,005 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2018-12-08 13:49:26,250 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-12-08 13:49:26,252 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:49:26,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:49:26,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:49:26,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:49:26,252 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:49:26,252 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:49:26,252 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:49:26,252 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:49:26,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-08 13:49:26,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:49:26,253 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:49:26,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,537 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-12-08 13:49:26,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:26,732 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-12-08 13:49:26,973 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:49:26,974 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:49:26,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,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-12-08 13:49:26,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:26,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:26,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:26,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:26,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:26,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:26,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:26,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:26,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:26,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:26,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:26,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:27,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:27,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:27,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:27,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:27,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:27,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:27,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:27,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:27,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:27,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:27,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:27,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:27,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:27,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:27,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:27,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:27,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:27,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:27,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:27,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:27,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:27,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:27,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:27,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:27,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:27,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:27,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:27,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:27,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:27,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:27,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:27,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:27,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:27,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:27,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:27,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:27,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:27,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:27,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:27,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:27,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:27,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:27,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:27,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:27,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:27,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:27,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:27,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:27,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:27,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:27,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:27,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:27,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:27,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:27,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:27,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:27,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:27,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:27,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:27,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:27,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:27,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:27,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:27,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:27,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:27,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-12-08 13:49:27,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:27,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:27,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:27,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:27,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:27,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:27,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:49:27,044 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 13:49:27,045 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:49:27,045 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:49:27,045 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 13:49:27,046 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:49:27,046 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_2, ULTIMATE.start_cstrstr_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_2 - 1*ULTIMATE.start_cstrstr_~s.offset Supporting invariants [] [2018-12-08 13:49:27,100 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-12-08 13:49:27,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 13:49:27,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:27,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:27,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:49:27,155 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-12-08 13:49:27,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-08 13:49:27,178 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 50 states and 58 transitions. Complement of second has 5 states. [2018-12-08 13:49:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 13:49:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 13:49:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-12-08 13:49:27,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-08 13:49:27,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:27,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 13:49:27,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:27,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-08 13:49:27,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:27,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2018-12-08 13:49:27,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 13:49:27,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2018-12-08 13:49:27,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-08 13:49:27,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 13:49:27,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-12-08 13:49:27,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:49:27,181 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-08 13:49:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-12-08 13:49:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-08 13:49:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-08 13:49:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-12-08 13:49:27,183 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-08 13:49:27,183 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-08 13:49:27,183 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 13:49:27,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-12-08 13:49:27,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 13:49:27,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:49:27,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:49:27,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:49:27,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 13:49:27,185 INFO L794 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 644#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 645#L581 assume !(main_~length1~0 < 1); 621#L581-2 assume !(main_~length2~0 < 1); 622#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 635#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 636#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 642#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 643#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 649#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 640#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 641#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 623#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 624#L568-4 goto; 625#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 626#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 616#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 617#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 627#L551 assume !(0 == cstrncmp_~n % 4294967296); 650#L553-4 [2018-12-08 13:49:27,185 INFO L796 eck$LassoCheckResult]: Loop: 650#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 637#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 629#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 630#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 647#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 650#L553-4 [2018-12-08 13:49:27,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash -912258627, now seen corresponding path program 1 times [2018-12-08 13:49:27,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:27,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:27,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:27,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:27,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:27,205 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 1 times [2018-12-08 13:49:27,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:27,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:27,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:27,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:27,212 INFO L82 PathProgramCache]: Analyzing trace with hash -599457521, now seen corresponding path program 1 times [2018-12-08 13:49:27,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:27,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:27,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:27,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:49:27,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:49:27,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49fae654-b3d2-4ba8-9aa4-f833d0e4f664/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:49:27,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:27,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:49:27,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:49:27,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-12-08 13:49:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 13:49:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-08 13:49:27,505 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-12-08 13:49:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:49:27,586 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-08 13:49:27,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 13:49:27,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2018-12-08 13:49:27,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 13:49:27,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2018-12-08 13:49:27,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 13:49:27,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 13:49:27,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-12-08 13:49:27,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:49:27,588 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-08 13:49:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-12-08 13:49:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-08 13:49:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 13:49:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-12-08 13:49:27,589 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-12-08 13:49:27,589 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-12-08 13:49:27,589 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 13:49:27,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2018-12-08 13:49:27,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 13:49:27,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:49:27,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:49:27,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:49:27,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 13:49:27,590 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 847#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 848#L581 assume !(main_~length1~0 < 1); 824#L581-2 assume !(main_~length2~0 < 1); 825#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 836#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 837#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 856#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 852#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 853#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 845#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 846#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 857#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 843#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 844#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 826#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 827#L568-4 goto; 828#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 829#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 819#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 820#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 830#L551 assume !(0 == cstrncmp_~n % 4294967296); 854#L553-4 [2018-12-08 13:49:27,590 INFO L796 eck$LassoCheckResult]: Loop: 854#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 840#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 832#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 833#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 850#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 854#L553-4 [2018-12-08 13:49:27,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1478230621, now seen corresponding path program 2 times [2018-12-08 13:49:27,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:27,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:27,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:27,605 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 2 times [2018-12-08 13:49:27,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:27,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:49:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:27,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1703636079, now seen corresponding path program 2 times [2018-12-08 13:49:27,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:27,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:27,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:49:27,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:28,289 WARN L180 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 185 [2018-12-08 13:49:28,721 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 141 [2018-12-08 13:49:28,722 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:49:28,722 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:49:28,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:49:28,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:49:28,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:49:28,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:49:28,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:49:28,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:49:28,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-08 13:49:28,723 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:49:28,723 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:49:28,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:28,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,355 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2018-12-08 13:49:29,491 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-12-08 13:49:29,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:29,780 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-12-08 13:49:30,216 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:49:30,217 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:49:30,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:30,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:30,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:30,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:30,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:30,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,242 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:49:30,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,243 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:49:30,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:30,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,250 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:49:30,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,250 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:49:30,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:30,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:30,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:30,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,257 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:49:30,257 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 13:49:30,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,258 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 13:49:30,258 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 13:49:30,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,263 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:49:30,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,264 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:49:30,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:30,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:30,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:30,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:30,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:30,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:30,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:30,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:30,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:30,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:30,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:30,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:30,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:30,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:30,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:30,327 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:49:30,348 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 13:49:30,348 INFO L444 ModelExtractionUtils]: 80 out of 85 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 13:49:30,348 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:49:30,348 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 13:49:30,349 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:49:30,349 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1.offset, v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1) = -1*ULTIMATE.start_cstrncmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1 Supporting invariants [] [2018-12-08 13:49:30,515 INFO L297 tatePredicateManager]: 49 out of 51 supporting invariants were superfluous and have been removed [2018-12-08 13:49:30,517 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 13:49:30,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:30,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:30,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:49:30,580 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-12-08 13:49:30,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-08 13:49:30,616 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 86 states and 99 transitions. Complement of second has 9 states. [2018-12-08 13:49:30,616 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-12-08 13:49:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 13:49:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-12-08 13:49:30,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 5 letters. [2018-12-08 13:49:30,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:30,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 27 letters. Loop has 5 letters. [2018-12-08 13:49:30,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:30,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-12-08 13:49:30,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:30,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 99 transitions. [2018-12-08 13:49:30,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 13:49:30,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 63 states and 74 transitions. [2018-12-08 13:49:30,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-08 13:49:30,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-08 13:49:30,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 74 transitions. [2018-12-08 13:49:30,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:49:30,618 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-12-08 13:49:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 74 transitions. [2018-12-08 13:49:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-12-08 13:49:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-08 13:49:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-12-08 13:49:30,620 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-08 13:49:30,620 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-08 13:49:30,620 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 13:49:30,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2018-12-08 13:49:30,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 13:49:30,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:49:30,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:49:30,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:49:30,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 13:49:30,621 INFO L794 eck$LassoCheckResult]: Stem: 1296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1294#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1295#L581 assume !(main_~length1~0 < 1); 1270#L581-2 assume !(main_~length2~0 < 1); 1271#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1283#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1284#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1304#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1309#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1305#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1292#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1293#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1300#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1290#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1291#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1272#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1273#L568-4 goto; 1274#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1275#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1307#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1316#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1313#L551 assume !(0 == cstrncmp_~n % 4294967296); 1314#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1310#L554 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 1308#L559 cstrstr_#t~ret16 := cstrncmp_#res; 1285#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1286#L568-4 goto; 1269#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1276#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1265#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1266#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1277#L551 assume !(0 == cstrncmp_~n % 4294967296); 1301#L553-4 [2018-12-08 13:49:30,621 INFO L796 eck$LassoCheckResult]: Loop: 1301#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1287#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 1279#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 1280#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1297#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1301#L553-4 [2018-12-08 13:49:30,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:30,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2051218895, now seen corresponding path program 1 times [2018-12-08 13:49:30,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:30,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:30,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:30,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:49:30,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:30,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:30,643 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 3 times [2018-12-08 13:49:30,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:30,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:30,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:30,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:49:30,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:30,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:30,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1369353957, now seen corresponding path program 1 times [2018-12-08 13:49:30,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:49:30,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:49:30,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:30,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:49:30,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:49:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:49:31,919 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 325 DAG size of output: 258 [2018-12-08 13:49:32,444 WARN L180 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 156 [2018-12-08 13:49:32,446 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:49:32,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:49:32,446 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:49:32,446 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:49:32,446 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:49:32,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:49:32,447 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:49:32,447 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:49:32,447 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-12-08 13:49:32,447 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:49:32,447 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:49:32,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:32,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,191 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 144 [2018-12-08 13:49:33,380 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2018-12-08 13:49:33,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:49:33,623 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-12-08 13:49:33,775 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-12-08 13:49:34,425 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-12-08 13:49:34,508 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:49:34,508 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:49:34,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:34,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:34,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:49:34,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:49:34,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:49:34,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,529 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:49:34,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,529 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:49:34,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:34,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:34,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:34,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,533 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:49:34,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,534 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:49:34,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:34,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:34,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:34,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:34,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:34,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:34,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:34,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:49:34,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:49:34,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:49:34,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:49:34,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:49:34,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:49:34,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:49:34,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:49:34,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:49:34,609 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-08 13:49:34,609 INFO L444 ModelExtractionUtils]: 76 out of 85 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-08 13:49:34,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:49:34,610 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 13:49:34,610 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:49:34,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_4, ULTIMATE.start_cstrncmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_4 - 1*ULTIMATE.start_cstrncmp_~s2.offset Supporting invariants [] [2018-12-08 13:49:34,959 INFO L297 tatePredicateManager]: 81 out of 84 supporting invariants were superfluous and have been removed [2018-12-08 13:49:34,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 13:49:34,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:35,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:35,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:49:35,039 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-08 13:49:35,039 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-08 13:49:35,061 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 61 states and 70 transitions. Complement of second has 7 states. [2018-12-08 13:49:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 13:49:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 13:49:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-12-08 13:49:35,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 32 letters. Loop has 5 letters. [2018-12-08 13:49:35,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:35,062 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:49:35,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:35,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:35,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:49:35,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-08 13:49:35,120 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-08 13:49:35,156 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 79 states and 93 transitions. Complement of second has 9 states. [2018-12-08 13:49:35,157 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-12-08 13:49:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 13:49:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-12-08 13:49:35,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2018-12-08 13:49:35,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:35,157 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:49:35,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:49:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:35,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:49:35,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:49:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:49:35,218 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-08 13:49:35,218 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-08 13:49:35,250 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 71 states and 80 transitions. Complement of second has 6 states. [2018-12-08 13:49:35,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 13:49:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 13:49:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-12-08 13:49:35,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 5 letters. [2018-12-08 13:49:35,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:35,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 37 letters. Loop has 5 letters. [2018-12-08 13:49:35,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:35,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 10 letters. [2018-12-08 13:49:35,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:49:35,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 80 transitions. [2018-12-08 13:49:35,252 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 13:49:35,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 0 states and 0 transitions. [2018-12-08 13:49:35,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 13:49:35,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 13:49:35,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 13:49:35,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 13:49:35,252 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:49:35,252 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:49:35,252 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:49:35,252 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 13:49:35,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 13:49:35,252 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 13:49:35,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 13:49:35,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 01:49:35 BoogieIcfgContainer [2018-12-08 13:49:35,256 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 13:49:35,256 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 13:49:35,256 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 13:49:35,257 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 13:49:35,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:49:23" (3/4) ... [2018-12-08 13:49:35,259 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 13:49:35,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 13:49:35,260 INFO L168 Benchmark]: Toolchain (without parser) took 12157.53 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 482.9 MB). Free memory was 956.0 MB in the beginning and 1.4 GB in the end (delta: -427.8 MB). Peak memory consumption was 55.0 MB. Max. memory is 11.5 GB. [2018-12-08 13:49:35,260 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:49:35,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-08 13:49:35,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:49:35,261 INFO L168 Benchmark]: Boogie Preprocessor took 17.31 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-08 13:49:35,262 INFO L168 Benchmark]: RCFGBuilder took 195.06 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-08 13:49:35,262 INFO L168 Benchmark]: BuchiAutomizer took 11641.38 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 360.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -310.9 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2018-12-08 13:49:35,262 INFO L168 Benchmark]: Witness Printer took 2.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:49:35,264 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.31 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 195.06 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11641.38 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 360.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -310.9 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[s] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.6s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 10.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 254 SDtfs, 301 SDslu, 517 SDs, 0 SdLazy, 207 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital292 mio100 ax100 hnf99 lsp97 ukn89 mio100 lsp47 div139 bol100 ite100 ukn100 eq170 hnf76 smp95 dnf141 smp87 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...