./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a1e56cd09ec23c2fd76dcb47b6d93a02131ca6ec ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:53:40,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:53:40,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:53:40,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:53:40,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:53:40,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:53:40,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:53:40,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:53:40,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:53:40,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:53:40,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:53:40,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:53:40,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:53:40,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:53:40,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:53:40,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:53:40,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:53:40,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:53:40,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:53:40,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:53:40,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:53:40,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:53:40,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:53:40,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:53:40,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:53:40,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:53:40,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:53:40,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:53:40,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:53:40,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:53:40,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:53:40,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:53:40,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:53:40,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:53:40,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:53:40,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:53:40,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:53:40,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:53:40,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:53:40,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:53:40,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:53:40,697 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:53:40,723 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:53:40,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:53:40,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:53:40,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:53:40,735 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:53:40,736 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:53:40,736 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:53:40,736 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:53:40,736 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:53:40,736 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:53:40,737 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:53:40,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:53:40,737 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:53:40,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:53:40,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:53:40,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:53:40,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:53:40,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:53:40,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:53:40,740 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:53:40,740 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:53:40,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:53:40,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:53:40,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:53:40,741 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:53:40,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:53:40,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:53:40,742 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:53:40,743 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:53:40,744 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1e56cd09ec23c2fd76dcb47b6d93a02131ca6ec [2019-11-15 22:53:40,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:53:40,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:53:40,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:53:40,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:53:40,794 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:53:40,795 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i [2019-11-15 22:53:40,850 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/data/9999302ba/674854a747b1438b9b894ac1beecbd22/FLAG1e7be24fb [2019-11-15 22:53:41,337 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:53:41,338 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i [2019-11-15 22:53:41,358 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/data/9999302ba/674854a747b1438b9b894ac1beecbd22/FLAG1e7be24fb [2019-11-15 22:53:41,673 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/data/9999302ba/674854a747b1438b9b894ac1beecbd22 [2019-11-15 22:53:41,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:53:41,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:53:41,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:53:41,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:53:41,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:53:41,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:53:41" (1/1) ... [2019-11-15 22:53:41,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa2f979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:41, skipping insertion in model container [2019-11-15 22:53:41,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:53:41" (1/1) ... [2019-11-15 22:53:41,698 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:53:41,753 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:53:42,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:53:42,096 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:53:42,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:53:42,204 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:53:42,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42 WrapperNode [2019-11-15 22:53:42,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:53:42,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:53:42,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:53:42,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:53:42,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (1/1) ... [2019-11-15 22:53:42,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (1/1) ... [2019-11-15 22:53:42,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:53:42,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:53:42,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:53:42,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:53:42,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (1/1) ... [2019-11-15 22:53:42,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (1/1) ... [2019-11-15 22:53:42,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (1/1) ... [2019-11-15 22:53:42,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (1/1) ... [2019-11-15 22:53:42,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (1/1) ... [2019-11-15 22:53:42,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (1/1) ... [2019-11-15 22:53:42,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (1/1) ... [2019-11-15 22:53:42,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:53:42,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:53:42,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:53:42,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:53:42,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:53:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:53:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:53:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:53:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:53:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:53:42,760 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:53:42,760 INFO L284 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-15 22:53:42,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:53:42 BoogieIcfgContainer [2019-11-15 22:53:42,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:53:42,762 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:53:42,762 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:53:42,765 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:53:42,766 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:53:42,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:53:41" (1/3) ... [2019-11-15 22:53:42,767 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@93943d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:53:42, skipping insertion in model container [2019-11-15 22:53:42,768 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:53:42,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:42" (2/3) ... [2019-11-15 22:53:42,768 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@93943d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:53:42, skipping insertion in model container [2019-11-15 22:53:42,768 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:53:42,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:53:42" (3/3) ... [2019-11-15 22:53:42,770 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-1.i [2019-11-15 22:53:42,829 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:53:42,829 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:53:42,830 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:53:42,831 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:53:42,831 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:53:42,831 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:53:42,831 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:53:42,831 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:53:42,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-11-15 22:53:42,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-15 22:53:42,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:42,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:42,881 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:53:42,881 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:42,881 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:53:42,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-11-15 22:53:42,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-15 22:53:42,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:42,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:42,887 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:53:42,887 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:42,895 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#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; 3#L588true assume !(main_~length1~0 < 1); 6#L588-2true assume !(main_~length2~0 < 1); 15#L591-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 27#L573true assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;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; 18#L551-4true [2019-11-15 22:53:42,895 INFO L793 eck$LassoCheckResult]: Loop: 18#L551-4true call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 29#L551-1true assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 14#L551-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; 18#L551-4true [2019-11-15 22:53:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:42,901 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2019-11-15 22:53:42,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:42,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966004213] [2019-11-15 22:53:42,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:42,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:42,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:43,166 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:43,168 INFO L82 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2019-11-15 22:53:43,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:43,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664538556] [2019-11-15 22:53:43,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:43,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:43,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:43,199 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2019-11-15 22:53:43,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:43,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041170768] [2019-11-15 22:53:43,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:43,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:43,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:43,291 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:43,961 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2019-11-15 22:53:44,188 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 22:53:44,200 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:44,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:44,201 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:44,201 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:44,201 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:44,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:44,201 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:44,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:44,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration1_Lasso [2019-11-15 22:53:44,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:44,202 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:44,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,812 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-11-15 22:53:44,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:44,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,266 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-11-15 22:53:45,893 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 22:53:46,035 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:46,039 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:46,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,044 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,051 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,051 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,066 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,074 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,074 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,077 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,077 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,082 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,086 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,087 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,087 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,091 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,092 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,097 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,100 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,100 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,102 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,103 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,103 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,105 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,107 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,107 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,111 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,113 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,113 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,121 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,121 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,134 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,134 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:53:46,135 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,135 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,137 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:53:46,137 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,144 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,144 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:53:46,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,152 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:53:46,152 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,207 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,207 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:46,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,211 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,278 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:46,327 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 22:53:46,328 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:53:46,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:46,331 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:53:46,331 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:46,332 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrlen_~s~0.base)_1, ULTIMATE.start_cstrlen_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrlen_~s~0.base)_1 - 1*ULTIMATE.start_cstrlen_~s~0.offset Supporting invariants [] [2019-11-15 22:53:46,386 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 22:53:46,393 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:53:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:46,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:46,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:46,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:53:46,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:46,486 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:46,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2019-11-15 22:53:46,548 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 83 states and 114 transitions. Complement of second has 5 states. [2019-11-15 22:53:46,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:53:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2019-11-15 22:53:46,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 22:53:46,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:46,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 22:53:46,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:46,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-15 22:53:46,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:46,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 114 transitions. [2019-11-15 22:53:46,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 22:53:46,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 27 states and 36 transitions. [2019-11-15 22:53:46,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 22:53:46,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 22:53:46,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-15 22:53:46,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:46,565 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-15 22:53:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-15 22:53:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 22:53:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:53:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-11-15 22:53:46,588 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-15 22:53:46,588 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-15 22:53:46,588 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:53:46,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2019-11-15 22:53:46,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 22:53:46,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:46,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:46,591 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:46,591 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:46,591 INFO L791 eck$LassoCheckResult]: Stem: 251#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 232#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; 225#L588 assume !(main_~length1~0 < 1); 226#L588-2 assume !(main_~length2~0 < 1); 231#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 242#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;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; 244#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 246#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 247#L551-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); 248#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 250#L575-4 [2019-11-15 22:53:46,591 INFO L793 eck$LassoCheckResult]: Loop: 250#L575-4 goto; 233#L576-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; 227#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 228#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 249#L575-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; 240#L558 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 229#L566 cstrstr_#t~ret16 := cstrncmp_#res; 230#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 250#L575-4 [2019-11-15 22:53:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:46,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2019-11-15 22:53:46,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:46,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404872260] [2019-11-15 22:53:46,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:46,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:46,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:46,622 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:46,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1752516368, now seen corresponding path program 1 times [2019-11-15 22:53:46,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:46,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378036140] [2019-11-15 22:53:46,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:46,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:46,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:46,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378036140] [2019-11-15 22:53:46,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:46,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:46,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063599466] [2019-11-15 22:53:46,666 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:53:46,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:46,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:46,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:46,670 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-15 22:53:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:46,713 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-11-15 22:53:46,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:53:46,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2019-11-15 22:53:46,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-15 22:53:46,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2019-11-15 22:53:46,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 22:53:46,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-15 22:53:46,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2019-11-15 22:53:46,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:46,717 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-15 22:53:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2019-11-15 22:53:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-15 22:53:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 22:53:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-11-15 22:53:46,720 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-15 22:53:46,720 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-15 22:53:46,720 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:53:46,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2019-11-15 22:53:46,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-15 22:53:46,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:46,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:46,722 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:46,722 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:46,722 INFO L791 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 311#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; 302#L588 assume !(main_~length1~0 < 1); 303#L588-2 assume !(main_~length2~0 < 1); 292#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 293#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;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; 297#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 299#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 300#L551-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#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 312#L575-4 [2019-11-15 22:53:46,722 INFO L793 eck$LassoCheckResult]: Loop: 312#L575-4 goto; 310#L576-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; 305#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 306#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 309#L575-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; 294#L558 assume !(0 == cstrncmp_~n % 4294967296); 295#L560-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); 304#L561 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;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~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem9; 307#L566 cstrstr_#t~ret16 := cstrncmp_#res; 308#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 312#L575-4 [2019-11-15 22:53:46,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2019-11-15 22:53:46,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:46,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782485621] [2019-11-15 22:53:46,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:46,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:46,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:46,782 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash 542190293, now seen corresponding path program 1 times [2019-11-15 22:53:46,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:46,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286243121] [2019-11-15 22:53:46,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:46,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:46,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:46,826 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:46,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:46,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1106695813, now seen corresponding path program 1 times [2019-11-15 22:53:46,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:46,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509117956] [2019-11-15 22:53:46,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:46,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:46,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:46,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509117956] [2019-11-15 22:53:46,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:46,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:53:46,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217352274] [2019-11-15 22:53:47,259 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-11-15 22:53:47,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:47,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:53:47,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:53:47,337 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-15 22:53:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:47,439 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-11-15 22:53:47,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:53:47,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2019-11-15 22:53:47,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-11-15 22:53:47,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2019-11-15 22:53:47,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 22:53:47,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 22:53:47,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2019-11-15 22:53:47,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:47,443 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-11-15 22:53:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2019-11-15 22:53:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-15 22:53:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 22:53:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-11-15 22:53:47,446 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-11-15 22:53:47,446 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-11-15 22:53:47,446 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:53:47,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2019-11-15 22:53:47,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-11-15 22:53:47,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:47,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:47,448 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:47,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:47,448 INFO L791 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 391#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; 383#L588 assume !(main_~length1~0 < 1); 384#L588-2 assume !(main_~length2~0 < 1); 372#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 373#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;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; 377#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 379#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 381#L551-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); 382#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 398#L575-4 goto; 390#L576-2 [2019-11-15 22:53:47,448 INFO L793 eck$LassoCheckResult]: Loop: 390#L576-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; 386#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 387#L576 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 390#L576-2 [2019-11-15 22:53:47,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:47,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2019-11-15 22:53:47,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:47,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677658580] [2019-11-15 22:53:47,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:47,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:47,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:47,487 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:47,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:47,488 INFO L82 PathProgramCache]: Analyzing trace with hash 71663, now seen corresponding path program 1 times [2019-11-15 22:53:47,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:47,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773680254] [2019-11-15 22:53:47,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:47,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:47,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:47,500 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:47,501 INFO L82 PathProgramCache]: Analyzing trace with hash 194815290, now seen corresponding path program 1 times [2019-11-15 22:53:47,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:47,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194006573] [2019-11-15 22:53:47,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:47,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:47,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:47,543 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:48,088 WARN L191 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 130 [2019-11-15 22:53:48,554 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2019-11-15 22:53:48,557 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:48,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:48,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:48,557 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:48,557 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:48,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:48,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:48,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:48,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration4_Lasso [2019-11-15 22:53:48,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:48,558 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:48,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:48,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:49,010 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2019-11-15 22:53:49,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:49,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:49,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:49,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:49,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:49,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:49,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:49,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:49,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:49,910 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 22:53:50,052 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:50,052 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:50,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,054 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,054 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,056 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,056 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,058 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,061 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,062 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,062 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,062 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,067 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:50,068 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:50,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,075 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:50,075 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:50,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,081 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,081 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,091 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:50,091 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:50,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:50,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:50,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:50,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,097 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:50,097 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:50,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,103 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:50,103 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:50,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,106 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:53:50,106 INFO L203 nArgumentSynthesizer]: 4 loop disjuncts [2019-11-15 22:53:50,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,117 INFO L400 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2019-11-15 22:53:50,117 INFO L401 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-11-15 22:53:50,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,167 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:53:50,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,172 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:53:50,172 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:50,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,194 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:50,194 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:50,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,197 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:50,197 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:50,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:50,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:50,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:50,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:50,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:50,199 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:50,201 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:50,201 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:50,216 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:50,252 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:53:50,253 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:53:50,253 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:50,254 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:53:50,254 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:50,254 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrstr_~s.base)_1, ULTIMATE.start_cstrstr_~s.offset) = 1*v_rep(select #length ULTIMATE.start_cstrstr_~s.base)_1 - 1*ULTIMATE.start_cstrstr_~s.offset Supporting invariants [] [2019-11-15 22:53:50,356 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2019-11-15 22:53:50,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:53:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:50,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:50,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:50,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:53:50,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:50,431 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:50,431 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 22:53:50,457 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 50 states and 58 transitions. Complement of second has 4 states. [2019-11-15 22:53:50,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:53:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2019-11-15 22:53:50,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 22:53:50,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:50,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 22:53:50,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:50,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-15 22:53:50,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:50,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2019-11-15 22:53:50,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:53:50,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2019-11-15 22:53:50,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 22:53:50,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:53:50,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-11-15 22:53:50,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:50,462 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-15 22:53:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-11-15 22:53:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-15 22:53:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 22:53:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-15 22:53:50,464 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-15 22:53:50,464 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-15 22:53:50,464 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:53:50,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-11-15 22:53:50,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:53:50,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:50,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:50,465 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:50,465 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:53:50,465 INFO L791 eck$LassoCheckResult]: Stem: 637#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 630#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; 620#L588 assume !(main_~length1~0 < 1); 621#L588-2 assume !(main_~length2~0 < 1); 611#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 612#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;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; 613#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 614#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 603#L551-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; 604#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 615#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 616#L551-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); 617#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 631#L575-4 goto; 632#L576-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; 622#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 624#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 627#L575-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; 605#L558 assume !(0 == cstrncmp_~n % 4294967296); 606#L560-4 [2019-11-15 22:53:50,465 INFO L793 eck$LassoCheckResult]: Loop: 606#L560-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); 618#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;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); 633#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 634#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 609#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 606#L560-4 [2019-11-15 22:53:50,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:50,466 INFO L82 PathProgramCache]: Analyzing trace with hash -912258627, now seen corresponding path program 1 times [2019-11-15 22:53:50,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:50,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678596880] [2019-11-15 22:53:50,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:50,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:50,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:50,512 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:50,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:50,513 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 1 times [2019-11-15 22:53:50,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:50,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364693014] [2019-11-15 22:53:50,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:50,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:50,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:50,529 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:50,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash -599457521, now seen corresponding path program 1 times [2019-11-15 22:53:50,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:50,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328249622] [2019-11-15 22:53:50,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:50,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:50,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:50,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328249622] [2019-11-15 22:53:50,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030168659] [2019-11-15 22:53:50,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_908c7cd6-47db-44e1-b261-ab4001f85766/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:50,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:53:50,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:50,854 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:50,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-15 22:53:50,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66600677] [2019-11-15 22:53:51,000 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-15 22:53:51,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:51,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:53:51,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:53:51,037 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand 11 states. [2019-11-15 22:53:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:51,193 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-11-15 22:53:51,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:53:51,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2019-11-15 22:53:51,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:53:51,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2019-11-15 22:53:51,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:53:51,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:53:51,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2019-11-15 22:53:51,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:51,196 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-11-15 22:53:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2019-11-15 22:53:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-15 22:53:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 22:53:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-15 22:53:51,199 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-15 22:53:51,199 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-15 22:53:51,199 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:53:51,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2019-11-15 22:53:51,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:53:51,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:51,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:51,201 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:51,202 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:53:51,202 INFO L791 eck$LassoCheckResult]: Stem: 835#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 832#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; 822#L588 assume !(main_~length1~0 < 1); 823#L588-2 assume !(main_~length2~0 < 1); 811#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 812#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;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; 815#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 816#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 805#L551-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; 806#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 817#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 842#L551-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; 843#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 841#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 818#L551-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); 819#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 833#L575-4 goto; 834#L576-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; 824#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 825#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 829#L575-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; 807#L558 assume !(0 == cstrncmp_~n % 4294967296); 808#L560-4 [2019-11-15 22:53:51,202 INFO L793 eck$LassoCheckResult]: Loop: 808#L560-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); 820#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;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); 836#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 837#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 813#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 808#L560-4 [2019-11-15 22:53:51,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:51,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1478230621, now seen corresponding path program 2 times [2019-11-15 22:53:51,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:51,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504930969] [2019-11-15 22:53:51,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:51,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:51,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:51,253 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:51,253 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 2 times [2019-11-15 22:53:51,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:51,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512185724] [2019-11-15 22:53:51,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:51,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:51,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:51,264 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:51,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:51,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1703636079, now seen corresponding path program 2 times [2019-11-15 22:53:51,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:51,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412674499] [2019-11-15 22:53:51,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:51,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:51,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:51,330 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:51,475 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-15 22:53:52,524 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 230 DAG size of output: 188 [2019-11-15 22:53:53,243 WARN L191 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 145 [2019-11-15 22:53:53,245 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:53,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:53,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:53,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:53,245 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:53,245 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:53,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:53,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:53,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration6_Lasso [2019-11-15 22:53:53,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:53,246 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:53,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:53,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:54,211 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 136 [2019-11-15 22:53:54,512 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-11-15 22:53:54,882 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 22:53:55,039 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-15 22:53:55,758 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-11-15 22:53:55,955 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 22:53:56,151 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:56,151 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:56,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,152 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,153 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,155 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,155 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,157 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,157 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,157 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,157 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,158 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,159 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,159 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,160 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,160 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,161 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,161 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,161 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,162 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,162 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,163 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,164 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,164 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,165 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,166 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,166 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,169 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,170 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,170 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,170 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,171 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:56,171 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,176 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,176 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,176 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,178 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,178 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,180 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,180 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,182 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,182 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,182 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,182 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,183 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,183 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,184 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,185 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,185 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,186 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,187 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,188 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,188 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,189 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:56,189 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,191 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,192 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,192 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,192 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,194 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,194 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,196 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,196 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,196 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,198 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,198 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,199 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,201 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,202 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,202 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,203 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,203 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,205 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:56,205 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,207 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,207 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,208 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,209 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,209 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,210 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,210 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,211 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,212 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:56,212 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,214 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,215 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,215 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,216 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,216 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,216 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,217 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,217 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,217 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,219 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,219 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,219 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,219 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,221 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,221 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,221 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,221 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,222 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,223 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,223 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,223 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,223 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,224 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,224 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,225 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,225 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,226 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,226 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,227 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,228 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,228 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,228 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,229 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,230 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,230 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,231 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:56,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,232 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:56,232 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:56,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,234 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,234 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:56,235 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,238 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:56,238 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,243 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:53:56,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,243 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:53:56,244 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,246 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,246 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:53:56,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,251 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:53:56,251 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,276 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,277 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:56,277 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,280 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:56,280 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:56,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:56,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:56,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:56,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:56,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:56,288 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:56,288 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:56,436 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:56,586 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 22:53:56,586 INFO L444 ModelExtractionUtils]: 79 out of 85 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:53:56,587 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:56,588 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:53:56,588 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:56,588 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_1, ULTIMATE.start_cstrncmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_1 - 1*ULTIMATE.start_cstrncmp_~s2.offset Supporting invariants [] [2019-11-15 22:53:56,854 INFO L297 tatePredicateManager]: 52 out of 53 supporting invariants were superfluous and have been removed [2019-11-15 22:53:56,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:53:56,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:56,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:53:56,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:56,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:53:56,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:57,036 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2019-11-15 22:53:57,036 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-15 22:53:57,191 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 63 states and 74 transitions. Complement of second has 7 states. [2019-11-15 22:53:57,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 0 non-accepting loop states 2 accepting loop states [2019-11-15 22:53:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:53:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2019-11-15 22:53:57,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 22 letters. Loop has 5 letters. [2019-11-15 22:53:57,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:57,196 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:53:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:57,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 22:53:57,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:57,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:53:57,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:57,385 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2019-11-15 22:53:57,385 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-15 22:53:57,526 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 95 states and 110 transitions. Complement of second has 13 states. [2019-11-15 22:53:57,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 2 accepting loop states [2019-11-15 22:53:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:53:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2019-11-15 22:53:57,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 22 letters. Loop has 5 letters. [2019-11-15 22:53:57,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:57,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 27 letters. Loop has 5 letters. [2019-11-15 22:53:57,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:57,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 22 letters. Loop has 10 letters. [2019-11-15 22:53:57,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:57,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 110 transitions. [2019-11-15 22:53:57,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:53:57,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 70 states and 82 transitions. [2019-11-15 22:53:57,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-15 22:53:57,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-15 22:53:57,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 82 transitions. [2019-11-15 22:53:57,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:57,535 INFO L688 BuchiCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-11-15 22:53:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 82 transitions. [2019-11-15 22:53:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2019-11-15 22:53:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-15 22:53:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-15 22:53:57,544 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-15 22:53:57,544 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-15 22:53:57,544 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:53:57,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2019-11-15 22:53:57,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:53:57,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:57,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:57,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:57,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:53:57,547 INFO L791 eck$LassoCheckResult]: Stem: 1481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1473#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; 1463#L588 assume !(main_~length1~0 < 1); 1464#L588-2 assume !(main_~length2~0 < 1); 1453#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 1454#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;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; 1455#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1456#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1485#L551-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; 1457#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1458#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1445#L551-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; 1446#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1484#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1459#L551-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); 1460#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1474#L575-4 goto; 1475#L576-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; 1476#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1493#L576 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 1472#L576-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; 1465#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1466#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1470#L575-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; 1451#L558 assume !(0 == cstrncmp_~n % 4294967296); 1448#L560-4 [2019-11-15 22:53:57,548 INFO L793 eck$LassoCheckResult]: Loop: 1448#L560-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); 1461#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;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); 1477#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 1478#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1447#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1448#L560-4 [2019-11-15 22:53:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1711753785, now seen corresponding path program 1 times [2019-11-15 22:53:57,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:57,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698321324] [2019-11-15 22:53:57,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:57,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:57,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:57,575 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:57,575 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 3 times [2019-11-15 22:53:57,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:57,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401512301] [2019-11-15 22:53:57,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:57,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:57,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:57,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:57,584 INFO L82 PathProgramCache]: Analyzing trace with hash -234967533, now seen corresponding path program 1 times [2019-11-15 22:53:57,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:57,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515587951] [2019-11-15 22:53:57,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:57,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:57,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:57,623 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:57,769 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-11-15 22:53:58,858 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 254 DAG size of output: 210 [2019-11-15 22:53:59,614 WARN L191 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 156 [2019-11-15 22:53:59,616 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:59,616 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:59,616 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:59,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:59,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:59,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:59,617 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:59,617 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:59,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration7_Lasso [2019-11-15 22:53:59,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:59,617 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:59,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:59,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:00,770 WARN L191 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 146 [2019-11-15 22:54:01,096 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-11-15 22:54:01,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:01,496 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-11-15 22:54:01,746 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-15 22:54:02,120 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 22:54:02,821 WARN L191 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-11-15 22:54:03,160 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-15 22:54:03,206 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:54:03,207 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:54:03,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,208 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,209 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,209 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,211 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,211 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,211 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,214 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,215 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,215 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,216 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,216 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,216 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,217 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,217 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,217 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,219 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:03,219 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:03,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,221 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,221 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,221 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,222 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,222 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,222 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,223 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,224 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,224 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,225 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,226 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,226 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,226 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,227 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,228 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,228 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,228 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,228 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,228 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,230 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,230 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,230 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,230 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,231 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,231 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,231 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,232 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,232 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,233 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,233 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,234 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,235 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,235 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,237 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:03,237 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:03,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,240 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,240 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,241 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,242 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,242 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,243 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,244 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,244 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,245 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,246 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,246 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,247 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:03,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,248 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:03,248 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:03,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,250 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:03,250 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:03,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,256 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:54:03,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,256 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:54:03,257 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:03,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:03,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:03,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:03,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:03,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:03,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:03,264 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:03,264 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:03,363 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:54:03,418 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:54:03,418 INFO L444 ModelExtractionUtils]: 80 out of 85 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:54:03,418 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:54:03,419 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:54:03,419 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:54:03,420 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_2, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_2 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2019-11-15 22:54:03,808 INFO L297 tatePredicateManager]: 78 out of 78 supporting invariants were superfluous and have been removed [2019-11-15 22:54:03,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:54:03,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:03,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:54:03,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:03,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:54:03,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:03,886 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:54:03,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 57 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-15 22:54:03,917 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 57 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 102 states and 121 transitions. Complement of second has 7 states. [2019-11-15 22:54:03,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:54:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:54:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2019-11-15 22:54:03,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 25 letters. Loop has 5 letters. [2019-11-15 22:54:03,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:54:03,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 30 letters. Loop has 5 letters. [2019-11-15 22:54:03,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:54:03,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 25 letters. Loop has 10 letters. [2019-11-15 22:54:03,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:54:03,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 121 transitions. [2019-11-15 22:54:03,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:54:03,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 77 states and 91 transitions. [2019-11-15 22:54:03,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 22:54:03,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 22:54:03,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 91 transitions. [2019-11-15 22:54:03,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:54:03,925 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 91 transitions. [2019-11-15 22:54:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 91 transitions. [2019-11-15 22:54:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2019-11-15 22:54:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 22:54:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-15 22:54:03,929 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-15 22:54:03,929 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-15 22:54:03,929 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:54:03,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2019-11-15 22:54:03,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:54:03,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:54:03,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:54:03,937 INFO L849 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] [2019-11-15 22:54:03,938 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:54:03,939 INFO L791 eck$LassoCheckResult]: Stem: 2061#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2053#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; 2042#L588 assume !(main_~length1~0 < 1); 2043#L588-2 assume !(main_~length2~0 < 1); 2032#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 2033#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;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; 2034#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2035#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2023#L551-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; 2024#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2036#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2066#L551-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; 2069#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2065#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2037#L551-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); 2038#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 2054#L575-4 goto; 2055#L576-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; 2044#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 2045#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 2071#L575-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; 2073#L558 assume !(0 == cstrncmp_~n % 4294967296); 2072#L560-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); 2041#L561 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;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~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem9; 2046#L566 cstrstr_#t~ret16 := cstrncmp_#res; 2047#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 2062#L575-4 goto; 2052#L576-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; 2070#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 2048#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 2049#L575-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; 2025#L558 assume !(0 == cstrncmp_~n % 4294967296); 2026#L560-4 [2019-11-15 22:54:03,939 INFO L793 eck$LassoCheckResult]: Loop: 2026#L560-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); 2039#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;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); 2057#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 2058#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 2029#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 2026#L560-4 [2019-11-15 22:54:03,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:03,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2051218895, now seen corresponding path program 1 times [2019-11-15 22:54:03,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:03,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529444243] [2019-11-15 22:54:03,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:03,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:03,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:54:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:54:03,990 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:54:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 4 times [2019-11-15 22:54:03,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:03,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077227064] [2019-11-15 22:54:03,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:03,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:03,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:54:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:54:04,007 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:54:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1369353957, now seen corresponding path program 1 times [2019-11-15 22:54:04,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:04,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361501914] [2019-11-15 22:54:04,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:04,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:04,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:54:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:54:04,073 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:54:04,216 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-15 22:54:06,180 WARN L191 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 328 DAG size of output: 258 [2019-11-15 22:54:06,990 WARN L191 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 161 [2019-11-15 22:54:06,992 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:54:06,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:54:06,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:54:06,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:54:06,992 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:54:06,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:54:06,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:54:06,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:54:06,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration8_Lasso [2019-11-15 22:54:06,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:54:06,993 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:54:06,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:06,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:06,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:06,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:07,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,362 WARN L191 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 151 [2019-11-15 22:54:08,747 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 103 [2019-11-15 22:54:08,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:08,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:54:09,242 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-11-15 22:54:09,487 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-11-15 22:54:10,158 WARN L191 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 22:54:10,338 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-15 22:54:11,023 WARN L191 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-11-15 22:54:11,099 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:54:11,099 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:54:11,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,100 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,100 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,100 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,103 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,103 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,104 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,104 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,105 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,105 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,106 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,106 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,107 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,107 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,107 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,108 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,108 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,109 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,109 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,109 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,110 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,110 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,111 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,112 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:11,112 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:11,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,114 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,116 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,117 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,117 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,118 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,119 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,119 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,120 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,122 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,123 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,124 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,124 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,125 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,125 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:54:11,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,127 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:54:11,127 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:54:11,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,129 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:11,129 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:11,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,131 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,132 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:11,132 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:11,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,134 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,134 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,134 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,134 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,135 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:11,135 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:11,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,140 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:11,140 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:11,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,142 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:54:11,142 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:54:11,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,148 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-11-15 22:54:11,148 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 22:54:11,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,186 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:11,187 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:11,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,188 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,188 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,189 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:11,189 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:11,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,192 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:11,192 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:11,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,196 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:54:11,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,197 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:54:11,197 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:11,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:54:11,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:54:11,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:54:11,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:54:11,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:54:11,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:54:11,204 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:54:11,204 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:54:11,299 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:54:11,404 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 22:54:11,404 INFO L444 ModelExtractionUtils]: 73 out of 79 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:54:11,405 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:54:11,405 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:54:11,406 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:54:11,406 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_3, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_3 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2019-11-15 22:54:12,105 INFO L297 tatePredicateManager]: 102 out of 102 supporting invariants were superfluous and have been removed [2019-11-15 22:54:12,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:54:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:12,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:54:12,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:12,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:54:12,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:12,202 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:54:12,202 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-15 22:54:12,224 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 80 states and 94 transitions. Complement of second has 7 states. [2019-11-15 22:54:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:54:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:54:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2019-11-15 22:54:12,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 32 letters. Loop has 5 letters. [2019-11-15 22:54:12,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:54:12,226 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:54:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:12,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:54:12,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:12,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:54:12,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:12,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:54:12,363 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-15 22:54:12,397 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 79 states and 93 transitions. Complement of second has 7 states. [2019-11-15 22:54:12,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:54:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:54:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2019-11-15 22:54:12,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2019-11-15 22:54:12,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:54:12,399 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:54:12,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:12,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:54:12,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:12,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:54:12,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:12,512 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:54:12,512 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-15 22:54:12,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 82 states and 96 transitions. Complement of second has 6 states. [2019-11-15 22:54:12,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:54:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:54:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2019-11-15 22:54:12,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 32 letters. Loop has 5 letters. [2019-11-15 22:54:12,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:54:12,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 37 letters. Loop has 5 letters. [2019-11-15 22:54:12,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:54:12,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 32 letters. Loop has 10 letters. [2019-11-15 22:54:12,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:54:12,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 96 transitions. [2019-11-15 22:54:12,547 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:54:12,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 0 states and 0 transitions. [2019-11-15 22:54:12,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:54:12,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:54:12,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:54:12,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:54:12,548 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:54:12,548 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:54:12,548 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:54:12,548 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:54:12,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:54:12,549 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:54:12,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:54:12,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:54:12 BoogieIcfgContainer [2019-11-15 22:54:12,558 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:54:12,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:54:12,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:54:12,558 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:54:12,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:53:42" (3/4) ... [2019-11-15 22:54:12,562 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:54:12,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:54:12,564 INFO L168 Benchmark]: Toolchain (without parser) took 30886.45 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 610.8 MB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -582.6 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:54:12,564 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:54:12,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:54:12,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.26 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:54:12,567 INFO L168 Benchmark]: Boogie Preprocessor took 68.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:54:12,572 INFO L168 Benchmark]: RCFGBuilder took 409.44 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:54:12,573 INFO L168 Benchmark]: BuchiAutomizer took 29796.23 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 454.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -426.1 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:54:12,573 INFO L168 Benchmark]: Witness Printer took 4.13 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:54:12,580 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 527.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.26 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.51 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. * RCFGBuilder took 409.44 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29796.23 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 454.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -426.1 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.13 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 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 - 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 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s1] + -1 * s2 and consists of 9 locations. One deterministic module has affine ranking function unknown-#length-unknown[s1] + -1 * s1 and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s1] + -1 * s1 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.7s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 27.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 7. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 325 SDtfs, 368 SDslu, 554 SDs, 0 SdLazy, 235 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital313 mio100 ax106 hnf99 lsp91 ukn91 mio100 lsp43 div144 bol100 ite100 ukn100 eq171 hnf75 smp96 dnf224 smp89 tf100 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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...